Difference between revisions of "Top-Down Parsing/Exercise 6"
From Wiki**3
< Top-Down Parsing
(→Solution) |
(→Solution) |
||
| Line 14: | Line 14: | ||
== Solution == | == Solution == | ||
| − | [[Image:Top-Down Parsing-exercise-06. | + | [[Image:Top-Down Parsing-exercise-06.jpg|800px|Temporary handwritten solution]] |
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] | ||
Revision as of 14:27, 27 March 2015
Contents |
Problem
Consider the following grammar, where F is the initial symbol and {a,b,c,d,e} is the set of terminal symbols:
F -> G b | O c F e O -> a G -> F c | O c d | (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 acbe input sequence.
Solution
