Problem
Consider the following grammar, where S is the initial symbol and {d,e,f,g,h} is the set of terminal symbols:
S -> A B d | C d
A -> C d h | S e
C -> g B | h f
B -> g | ε
- 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 hfded input sequence.
Solution