Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads

Question

Let G be any grammar with the following productions:

X → X+Y | Y
Y→ Y*Z | Z
Z → (X)
Z → id

If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?

Answer 1

 

Here (i) is X→ .Y 

and (ii) is Z→ .id

Comments

@raja11sep you might have overlooked and not included X--> .Y {+} for the later productions just check once.

---

Yes got my mistake.

Thannks @Sunnidhya Roy @Abhrajyoti00 @Souvik33 .

---

@Abhrajyoti00 Thanks 😊