EXERCISES

$*8\mathrm{.}1$ The rewriting rules in Figure $8\mathrm{.}1$ are a subset of the rules necessary to eliminate

all ESEQs from expressions. Show the right$-$hand side for each of the following

incomplete rules:

a$.$ MOVE$(TEMPt,$ESEQ$(s,e))=>$

b$.$ Move$(MEm(ESEQ(s,e_1)),e_2)=>$

c$.$ Move$(MEm(e_1),$ESEQ$(s,e_2))=>$

d$.$ ExP$(ESEQ(s,e))=>$

e$.$ ExP$(CALL(ESEQ(s,e),$args$))=>$

f$.,$ args

$8\mathrm{.}6$ Break this program into basic blocks.

$8\mathrm{.}7$ Express the basic blocks of Exercise $8\mathrm{.}6$ as statements in the Tree intermediate

form, and use Algorithm $8\mathrm{.}2$ to generate a set of traces.