MADE EASY TEST SERIES

Question

Consider the following augmented grammar G which is used to build LR (0) parsing table.

E' __> E

E __> E+T/T

T __> T*F/F

F -->(E)/id

The number of shift reduce conflict in the LR(0) parsing table construction are __________.

Please somebody help. I am not getting more then two but Made easy's answer is 3.

Comments

What is the third conflict ? @Rajesh_Raj
Im also getting 2 . Solution is given below,
Given grammer is augumented grammer . Why considereing E'' -> . E'

---

sry the grammar is already augumented ! not seen.. 2 is right

---

@pc yes you are right,  actually this question from made easy test series,  and according to answer,  conflict is 3.  But I also marked answer as 2. Actually they include one type of conflict 2 times.  

Now I also thinking,  answer is 2 only.

Answer 1

I am also getting 2 S/R conflict in these states -

E -> T.

T -> T. * F

and

E -> E + T.

T -> T. * F

Answer 2

There should be "2 SR CONFLICT" :-

Comments

In the question its actually T*F. There is no production T->T+F

---

sorry,while solving I took it mistakenly * instead of +

check edited the answer now

---

Here why I1 state is not considered as SR conflict.??

Answer 3

I'm also getting 2 conflicts