Top-Down Parsing/Exercise 12: Test 2016/04/08
From Wiki**3
< Top-Down ParsingRevision as of 12:28, 11 April 2016 by Root (talk | contribs) (Created page with "= 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...")
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
| [Expand] Solução completa |
|---|
