GATE1988-10ia

Question

Consider the following grammar:

• $S \rightarrow S$
• $S \rightarrow SS \mid a \mid \epsilon$

Construct the collection of sets of LR (0) items for this grammar and draw its goto graph.

Comments

i think this is ambigous grammer try to gererate string "a" you will gate 2 LMD

---

It is ambiguous grammar and we can't parse it by LR(0) parser. right na?

---

Here  S→  ϵ will take as reduce/ shift action or not effect on LR(0) DFA??