Number of conflict

Question

Consider the grammar given below

S⟶ SS | a | ∈

The number of inadequate states in the DFA of LR(1) items is

(a) 1       (b) 2     (c) 3     (d) 4

Comments

What would be the answer for LR(o) items in same question ?

---

see my Answer Below .

---

state having conflict...draw its dfa..there will be 3 such states

Answer 1

Ans 3

Comments

both are different state how will u merge.rt?

---

@Manoj @Vamsi

check my one

where is the 3rd conflict? :o

---

what is meant by inadequate states given in question.

and how the answer is 3. didn't get the explanation.

help please.

Answer 2

In state 1 : 1 -SR conflict

In state 2 : 1 -SR conflict

In state 3 : 1 -SR conflict  +  1 RR conflict

Answer 3

Number of inadequate states is nothing but states which has S/R or R/R conflicts

Ref:http://www.cs.nuim.ie/~jpower/Courses/Previous/parsing/node64.html

Comments

How to draw the dfa?

---

After getting LR(0) items what you do is DFA diagram(something looks below(not for this grammar))

Answer 4

finding no of conflict

Comments

ok means any one state I1 can go in input S, (either I1 or I3) rt?

---

yes

---

In i1 state the first production is S’ → S. , $

which will not be genrated again by [i1,S] , So how its self loop can be correct ??