Latest revision as of 19:39, 23 April 2018

Problem

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

X -> X b Y | Y a c Z | c
Y -> Y b | b X a
Z -> a | d

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

Solution