Difference between revisions of "Top-Down Parsing/Exercise 11: Test 2014/04/10"
From Wiki**3
< Top-Down Parsing
(Created page with "= Problem = 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 |...") |
(→Problem) |
||
| Line 1: | Line 1: | ||
= Problem = | = Problem = | ||
| − | Consider the following grammar, where ''' | + | Consider the following grammar, where '''A''' is the initial symbol and '''{x, y, z}''' is the set of terminal symbols: |
| − | + | A → B y | x | ε | |
| − | + | B → A x | C z | |
| − | + | C → x | ε | |
# Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language. | # 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. | # 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 ''' | + | # Show the analysis table (stack, input, and actions) for the parsing process of the '''xzyxy''' input sequence. |
= Solution = | = Solution = | ||
Revision as of 11:43, 14 April 2015
Problem
Consider the following grammar, where A is the initial symbol and {x, y, z} is the set of terminal symbols:
A → B y | x | ε B → A x | C z C → 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 xzyxy input sequence.
Solution
