Difference between revisions of "Bottom-Up Parsing/Exercise 8: LALR(1)"
From Wiki**3
< Bottom-Up Parsing
(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...") |
(→Solução) |
||
| Line 10: | Line 10: | ||
== Solução == | == Solução == | ||
| + | |||
| + | {{CollapsedCode|Solução completa| | ||
| + | [[image:sgbb.png]] | ||
| + | }} | ||
[[category:Compiladores]] | [[category:Compiladores]] | ||
[[category:Ensino]] | [[category:Ensino]] | ||
Revision as of 16:05, 21 April 2016
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>
- Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
- 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.
- Is this an SLR(1) grammar? Why?
Solução
| Solução completa |
|---|
|
|
