Top-Down Parsing/Example 2

From Wiki**3

< Top-Down Parsing
Revision as of 10:45, 10 April 2008 by Root (talk | contribs) (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 ...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Consider the following grammar, where S is the initial symbol and {d,e,f,g,h} 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 | ε
  1. Examine the grammar and rewrite it so that an LL(1) predictive parser can be built for the corresponding language.
  2. Compute the FIRST and FOLLOW sets for all non-terminal symbols in the new grammar and build the parse table.
  3. Show the analysis table (stack, input, and actions) for the parsing process of the hfded input sequence.

Solution

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