424 views

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.

edited | 424 views
0
i think this is ambigous grammer try to gererate string "a" you will gate 2 LMD
0
It is ambiguous grammar and we can't parse it by LR(0) parser. right na?
0

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

0
So we cannot write LR(0) items if grammar is ambiguous?
+1
afaik, LR(0) items can be constructed if the grammar is ambiguous.

The augmented production is $S^{'} \rightarrow S$.

$\textbf{GOTO Graph:}$

Here, each of $I_0$, $I_1$, $I_2$, $I_3$ is a set of $LR(0)$ items. And hence $I_0$, $I_1$, $I_2$, $I_3$ are the collection of sets of $LR(0)$ items.

by Boss (15.4k points)
selected by
+1 vote

Augmented production S'-->S

by Boss (13.3k points)
reshown
0
Sir we can write LR(0) items..

But there will be conflicts in dfa (of canonical collection of LR(0) items).. so the grammar will not be LR(0)
+2
Thats all is asked in the question rt?
0
Yes..