Example

. Consider following grammar and its SLR parse table:

S ' S
S L = R
S R
L *R
L id
R L
I0 : S' .S
S .L=R
S .R
L .*R
L .id
R .L
I1 : goto(I0 , S)
S' S.
I2 : goto(I0 , L)
S L.=R
R L.

Construct rest of the items and the parse table.

Given grammar:

S L = R

S R

L *R

L id

R L

Augmented grammar:

S ' S

S L = R

S R

L *R

L id

R L

Constructing the set of LR(0) items:

Using the rules for forming the LR(0) items, we can find parser states as follows:

I₀ : closure(S ' .S)

S ' .S

S .L = R

S .R

L .*R

L .id

R .L

I ₁: goto(I₀ , S)

S ' S.

I₂ : goto(I₀ , L)

S L.=R

R L.

I₃ : goto(I ₀ , R)

S R.

I₄ : goto(I₀ , *)

L *.R

R .L

L .*R

L .id

I₅ : goto(I₀ , id)

L id.

I ₆ : goto(I₂ , =)

S L=.R

R .L

L .*R

L .id

I ₇ : goto(I ₄ , R)

L *R.

I ₈ : goto(I₄ , L)

R L.

goto(I ₄ , *) = I ₄

goto(I₄ , id) = I₅

I ₉ : goto(I₆ , R) S L=R.

I₁₀ : goto(I ₆ , L) R L.

goto(I ₆, *) = I ₄

goto(I₆ , id) = I ₅

So, the set is C = { I0, I1, I2, ... I10 }