Revision as of 22:36, 11 April 2008

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.

Solution

The grammar can be parsed by an LL(1) parser if it does not have left recursion and no ambiguity is present (i.e., the LOOKAHEADs for all productions of each non-terminal are disjoint).

A simple inspection of the grammar shows that indirect left recursion is present in rules B and D. Also, there are left corners that may hide ambiguity (E).

The first step, then, is to rewrite the grammar so that mutual recursion is eliminated (A becomes unreachable and can be removed from the grammar):

 S -> u B z
 B -> B v | E u E | B y E
 D -> E u E | B y E
 E -> v | v x

Now we handle the left corner (E in B) (since E is not completely replaced, it cannot be removed from the grammar):

 S -> u B z
 B -> B v | v u E | v x u E | B y E
 E -> v | v x

Now, left recursion can be eliminated:

 S  -> u B z
 B  -> v u E B1 | v x u E B1
 B1 -> v B1 | y E B1 | ε

Factoring...

 S  -> u B z
 B  -> v B2
 B1 -> v B1 | y E B1 | ε
 B2 -> u E B1 | x u E B1

The FIRST and FOLLOW sets are as follows:

 FIRST(S)  = FIRST(u B z) = {u}
 FIRST(B)  = FIRST(v B2) = {v}
 FIRST(B1) = FIRST(v B1) ∪ FIRST(y E B1) ∪ {ε} = {v, y, ε}
 FIRST(B2) = FIRST(u E B1) ∪ FIRST(x u E B1) = {u, x}

 FOLLOW(S) = {$}    FOLLOW(B1) ⊇ FOLLOW(B2)    
 FOLLOW(B) = {z}    FOLLOW(B2) ⊇ FOLLOW(B)

 FOLLOW(B1) = FOLLOW(B2) = FOLLOW(B) = {z}