test series

Question

How many DFA states are constructed for the following augmented grammar using LR(0) parser?

S'->S$

S->x|(A)

A->A,S|S

Where S is the start symbol and S′ → S$ is augmented production.

i got 11 state but ans is 10 . can you plz explain i don't know where i am wrong

Comments

that is the solution my dobut in the state I3 in that state why is not add S transition after A->.S

---

Yes they haven't added the S transitions but even after adding the production rule of S it wouldn't have made any difference. Because on reading x from I3 it would have gone to I2 and on reading ( from I3 it would have gone to I3 itself (self loop).

---

ok thank u i got it where i m wrong

Answer 1

but, why are we going from state I1 to state I4? Is state I4  necessary state or it should be removed? Someone help me clearing this doubt.

Comments

Please prefer to answer only if you are sure. Doubts are always welcomed in comments! Best Luck :)