Bottom-Up Parsing/Example 4: LALR(1)

From Wiki**3

< Bottom-Up Parsing
Revision as of 14:27, 6 April 2015 by Root (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

S -> L = R | R
L -> * R | id
R -> L

Initial symbol: S

Terminals: { =, *, id }

Input:

Compact.

Is this an SLR(1) grammar?

Solution

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Bottom-Up_Parsing/Example_4:_LALR(1)&oldid=6110"