Bottom-Up Parsing/Example 3: SLR(1): Difference between revisions
From Wiki**3
< Bottom-Up Parsing
Line 11: | Line 11: | ||
Input: xwxkyy | Input: xwxkyy | ||
Is this an SLR(1) grammar? | |||
== Solution == | == Solution == |
Revision as of 15:16, 16 May 2011
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?