CSCI 310 Spring 2005, Day 37

1. Administrivia
   1. Office hours today: GAH
   2. Reminder senior project talks: MWF 4:30 - 5:30.
   3. IRT example. Really, it's coming. Later today.
   4. Final Exam: last year's final review is relatively relevant. BUT, you may be asked about tree rewriting (which we didn't do last year). The questions are, for the most part, very concrete: give an IRT for ..., give the first/follow sets for ...

2. Project 6 questions?
   1. A note about expressions with logical AND and negation... how do you deal with those?
3. Blocks
   1. Consider pseudo on p. 175 (8.6).
   2. Convert it into a sequence of IRTs.
   3. Now, start a block everywhere you have a label. End the block when either you hit another label or a JUMP or CJUMP. (No JUMP or CJUMP or label inside a block.)
   4. Now fix the blocks so everything starts with a LABEL and ends with a JUMP.

4. Traces
   1. Consider your work above. How can you reorganize it to remove as many JUMPs as possible? And to put false cases under the CJUMPs?