Bottom-Up Parsing/Example 4: LALR(1): Difference between revisions
From Wiki**3
No edit summary |
|||
| Line 1: | Line 1: | ||
__NOTOC__ | |||
= Problem = | == Problem == | ||
Initial symbol: '''S''' | Initial symbol: '''S''' | ||
Latest revision as of 09:42, 2 May 2024
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.