Quiz 4: Top-Down Parsing

Quiz | Posted (Thursdays) |
Given in class (Thursdays) |
||
---|---|---|---|---|

31 | Jan | 7 | Feb |

- Exercise 12 on page 110.
- Compute First and Follow sets for the grammar shown in Exercise 2 on page 137. Augment that grammar with the rule S-->Expr $.
- Exercise 1 on page 137, parts a and c.
- Exercise 2 on page 137.
- Exercise 4 on page 138. Recall that you must eliminate any left recursion, and make the predict sets distinct for each rule of any given nonterminal.
- Design a grammar whose language is the set of all regular
expressions over $a$ and $b$. Examples of such regular expressions are:
- a *
- b | (ab | a) *
- a | aba*