• Defined as trees with
– No SEQ or ESEQ nodes
– A CALL node can only be found directly in
• An EXP(…) – in which case it’s a void call
• A MOVE( TEMP t, … ) – result is stored at once
• Rewriting rules for lifting SEQ/ESEQ…
• Rewriting rules for lifting CALLs…
• Removing the SEQs
Text Box: ‹#›