Top-Down Parsing/Exercise 9: Difference between revisions
From Wiki**3
< Top-Down Parsing
(Created page with "{{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 ->...") |
|||
| Line 14: | Line 14: | ||
== Solution == | == Solution == | ||
[[Image:CompilersTopDownParsingExercise9.jpg]] | [[Image:CompilersTopDownParsingExercise9.jpg|600]] | ||
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] | ||
Revision as of 20:47, 29 March 2013
Problem
Consider the following grammar, where A is the initial symbol and {x, y, z} 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 zvxy input sequence.
Solution
