Bottom-Up Parsing/Exercise 8: LALR(1)

From Wiki**3

< Bottom-Up Parsing
Revision as of 13:48, 21 April 2016 by Root (talk | contribs) (Created page with "== Problema == Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols: <text> S -> G b b | a a b | b G a G -> a </text> # C...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problema

Consider the following grammar, where S is the initial symbol and { a, b } is the set of terminal symbols: <text> S -> G b b | a a b | b G a G -> a </text>

  1. Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
  2. Show the parsing process for input baaabb (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
  3. Is this an SLR(1) grammar? Why?

Solução

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Bottom-Up_Parsing/Exercise_8:_LALR(1)&oldid=7500"