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

From Wiki**3

< Bottom-Up Parsing

Problema

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

S → G b b | a a b | b G a
G → a
  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

[Expand] Solução completa

Sgbb.png

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