Top-Down Parsing/Exercise 6

Problem

Consider the following grammar, where F is the initial symbol and {a,b,c,d,e} is the set of terminal symbols:

O -> a
G -> F c | O c d | ε
F -> G b | O c F e

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

Solution