Bottom-Up Parsing/Example 4: LALR(1)
From Wiki**3
Problem
Initial symbol: S
Terminals: { =, *, id }
S → L = R | R L → * R | id R → L
Is this an SLR(1) grammar?
Compute and compact the parse table.
Initial symbol: S
Terminals: { =, *, id }
S → L = R | R L → * R | id R → L
Is this an SLR(1) grammar?
Compute and compact the parse table.