Bottom-Up Parsing/Example 3: SLR(1): Difference between revisions

From Wiki**3

< Bottom-Up Parsing
No edit summary
 
Line 1: Line 1:
{{TOCright}}
#REDIRECT [[ist:Bottom-Up Parsing/Example 3: SLR(1)]]
= Problem =
 
S -> x A y | x B y | x A z
B -> k
A -> w S | k
 
Initial symbol: S
 
Terminals: { k, w, x, y, z }
 
Input: xwxkyy
 
Is this an SLR(1) grammar?
 
== Solution ==
 
[[category:Compiladores]]
[[category:Ensino]]

Latest revision as of 18:03, 6 December 2018