Bottom-Up Parsing/Example 3: SLR(1): Difference between revisions
From Wiki**3
< Bottom-Up Parsing
No edit summary |
|||
| Line 16: | Line 16: | ||
== Solution == | == Solution == | ||
[[category: | [[category:Compiladores]] | ||
[[category: | [[category:Ensino]] | ||
Revision as of 14:27, 6 April 2015
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?