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

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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

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

From Wiki**3

< Bottom-Up Parsing

Problem

Solution