Top-Down Parsing/Exercise 6: Difference between revisions

From Wiki**3

< Top-Down Parsing
(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 |...")
 
(Redirected page to ist:Top-Down Parsing/Exercise 6)
 
(7 intermediate revisions by the same user not shown)
Line 1: Line 1:
{{TOCright}}
#REDIRECT [[ist:Top-Down Parsing/Exercise 6]]
= 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 | 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 '''<tt>acbe</tt>''' input sequence.
 
== Solution ==
 
[[category:Teaching]]
[[category:Compilers]]

Latest revision as of 22:20, 5 December 2018

Redirect to:

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Top-Down_Parsing/Exercise_6&oldid=11017"