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

From Wiki**3

< Bottom-Up Parsing
Revision as of 19:27, 24 May 2023 by Root (talk | contribs) (Created page with "== Problema == Consider the following grammar, where '''R''' is the initial symbol and '''{ a, b, c }''' is the set of terminal symbols: <source lang="text"> X -> X Y c | X...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problema

Consider the following grammar, where R is the initial symbol and { a, b, c } is the set of terminal symbols: 

X -> X Y c | X a | a
Y -> a | b
  1. Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
  2. Compact the parse table, eliminating and propagating reductions.
  3. Show the parsing process for input aabc (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.

Solução

Solução completa

768px 768px

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Bottom-Up_Parsing/Exercise_17:_LALR(1)&oldid=15741"