Here are the practice problems for the final:

 6.2
 6.13 (just +, *, mod)
 6.17
 7.4
 7.6
 7.8 a,b
 8.1
 8.2
 8.9 (don't bother with rules for "and", "not", and "(E)")
 8.14
 9.1 b,c
 9.3 a
 9.12 a,b (Apply both the Sethi-Ullman and the DLS algorithms
           I presented in class.  For both, assume explicit
           "load" and "store" instructions are needed to move
           a variable into a register, all other operations
           operate on registers only.  Note this changes the
           Sethi-Ullman labeling algorithm, since now all leaves
           are labeled "1".)
 9.14
 9.15
 9.16
 10.5 c
 10.7
 10.24 a,b,c
 10.25 a,b,c
 10.26 b,c

Solutions will be posted towards the end of the semester in the usual place.