Top-Down Parsing/Exercise 6: Difference between revisions
From Wiki**3
Created page with "{{TOCright}} = Problem = Consider the following grammar, where '''<tt>F</tt>''' is the initial symbol and '''<tt>{a,b,c,d,e}</tt>''' is the set of terminal symbols: F -> G b |..." |
(No difference)
|
Revision as of 14:54, 16 May 2011
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.