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

From Wiki**3

< Bottom-Up Parsing
Revision as of 11:42, 2 May 2024 by Root (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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.

Solution

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Bottom-Up_Parsing/Example_4:_LALR(1)&oldid=16328"