Bottom-Up Parsing/Exercise 9: LALR(1): Difference between revisions

Latest revision as of 09:49, 2 May 2024

Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:

E → [ E ; L ] | id
L → E | E ; L

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

Solução completa

@@ Line 1: / Line 1: @@
 == Problema ==
-Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:
+Consider the following grammar, where '''E''' is the initial symbol and '''{ [, ], ;, id }''' is the set of terminal symbols:
-<text>
+<source lang="text">
-E -> [ E ; L ] | id
+E → [ E ; L ] | id
-L -> E | E ; L
+L → E | E ; L
-</text>
+</source>
 # Compute the set of LALR(1) states for the grammar. Build the corresponding LALR(1) parse table.
 # Show the parsing process for input '''[id;id;id]''' (including the actions/gotos and the input and stack states). In case of conflict, assume YACC's behavior.
@@ Line 11: / Line 11: @@
 == Solução ==
+{{CollapsedCode|Solução completa|
+[[image:eobesclcb.png]]
+}}
 [[category:Compiladores]]
 [[category:Ensino]]