View source for Top-Down Parsing/Exercise 9

{{TOCright}}
= Problem =

Consider the following grammar, where '''<tt>A</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols:

 C -> v
 A -> B x | z C A y
 B -> A v | z C w | (eps)

# 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 '''<tt>zvxy</tt>''' input sequence.

== Solution ==

[[Image:CompilersTopDownParsingExercise9.jpg|700px]]

[[category:Compiladores]]
[[category:Ensino]]