Top-Down Parsing/Exercise 9

Problem

Consider the following grammar, where A is the initial symbol and {x, y, z} is the set of terminal symbols:

C -> v
A -> B x | z C A y
B -> A v | z C w | (eps)

1. Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.
2. Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.
3. Show the analysis table (stack, input, and actions) for the parsing process of the zvxy input sequence.

Solution