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

From Wiki**3

< Bottom-Up Parsing
(Created page with "== Problema == Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols: <text> E -> [ E ; L ] | id L -> E | E ; L </...")
 
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
== Problema ==
#REDIRECT [[ist:Bottom-Up Parsing/Example 9: LALR(1)]]
 
Consider the following grammar, where E is the initial symbol and { [, ], ;, id } is the set of terminal symbols:  
<text>
E -> [ E ; L ] | id
L -> E | E ; L
</text>
# 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 ==
 
[[category:Compiladores]]
[[category:Ensino]]

Latest revision as of 18:04, 6 December 2018

Redirect to:

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