Top-Down Parsing/Exercise 11: Test 2014/04/10

Problem

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

A → B y | x | ε
B → A x | C z
C → x | ε

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 xzyxy input sequence.

Solution