Problem
Consider the following grammar, where A is the initial symbol and {x, y, z} is the set of terminal symbols:
A -> B C x | D C y
B -> z | A z
C -> z
D -> A y | B y
- Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.
- Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.
- Show the analysis table (stack, input, and actions) for the parsing process of the zzxyzy input sequence.
Solution