Top-Down Parsing/Example 2: Difference between revisions

From Wiki**3

< Top-Down Parsing
(New page: == Problem == Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{d,e,f,g,h}</tt>''' is the set of terminal symbols: S -> A B d | C d A -> C d h ...)
 
(Redirected page to ist:Top-Down Parsing/Example 2)
 
(11 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Problem ==
#REDIRECT [[ist:Top-Down Parsing/Example 2]]
 
Consider the following grammar, where '''<tt>S</tt>''' is the initial symbol and '''<tt>{d,e,f,g,h}</tt>''' is the set of terminal symbols:
 
  S -> A B d | C d
  A -> C d h | S e
  C -> g B | h f
  B -> g | ε
 
# 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>hfded</tt>''' input sequence.
 
== Solution ==
 
[[category:Compilers]]
[[category:Teaching]]

Latest revision as of 22:18, 5 December 2018

Redirect to:

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