Top-Down Parsing/Example 3

Problem

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

 S -> u B z
 B -> B v | D
 D -> E u E | B y E
 E -> v | v 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 uvuvxz input sequence.