CS301 Fall 1998

Homework Assignment #3

Do the following problems from the textbook with the indicated additions:

1. Exercise 3.4 (b), (c), (d)
2. Exercise 3.6 (b). Enumerate the parse tree nodes according to leftmost and rightmost derivations.
3. Exercise 3.12 (a) and (b)
4. Exercise 3.20 (b). Explain your decisions. Based on your explanations, give an algorithm to create a context-free grammar for any regular expression.
5. Exercise 3.24 (a) and 3.25

Please use a work processor (except for drawings, where you could use a pen).