 In <unk> , straight line code ( that is , sequences of statements without loops or conditional branches ) may be represented by a DAG describing the inputs and <unk> of each of the arithmetic operations performed within the code . This representation allows the <unk> to perform common <unk> elimination efficiently . 
