Bottom-Up Parsing/Example 3: SLR(1)

From Wiki**3

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

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

Problem

Initial symbol: S

Terminals: { k, w, x, y, z }

Input: xwxkyy 

S → x A y | x B y | x A z
B → k
A → w S | k

Is this an SLR(1) grammar?

Derive the SLR(1) parser for this grammar. Compact the parse table. Describe the processing of the input string by the compacted parser.

Solution

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