Top-Down Parsing/Exercise 10: Test 2013/04/03: Difference between revisions
From Wiki**3
Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols: S → M y S ..." |
|||
| Line 2: | Line 2: | ||
= Problem = | = Problem = | ||
Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{x, y, z}</tt>''' is the set of terminal symbols: | Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{v, w, x, y, z}</tt>''' is the set of terminal symbols: | ||
S → M y S x | L y | ε | S → M y S x | L y | ε | ||
Revision as of 18:26, 8 April 2013
Problem
Consider the following grammar, where S is the initial symbol and {v, w, x, y, z} is the set of terminal symbols:
S → M y S x | L y | ε L → w L | S v M → z | x
- 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 zyvyx input sequence.
