Bottom-Up Parsing/Example 4: LALR(1): Difference between revisions

From Wiki**3

< Bottom-Up Parsing
No edit summary
 
Line 1: Line 1:
{{TOCright}}
#REDIRECT [[ist:Bottom-Up Parsing/Example 4: LALR(1)]]
= Problem =
 
S -> L = R | R
L -> * R | id
R -> L
 
Initial symbol: S
 
Terminals: { =, *, id }
 
Input:
 
Compact.
 
Is this an SLR(1) grammar?
 
== Solution ==
 
[[category:Compiladores]]
[[category:Ensino]]

Latest revision as of 18:03, 6 December 2018