Consider the grammar-
$S \rightarrow BB$
$B \rightarrow aB/bB/a/b$
How many shift-reduce conflicts will occur when we try to make SLR parsing table for the above grammar?
A. 0
B. 1
C. 2
D. None
I0:
S->.BB
B->.aB
B->.bB
B->.b
B->.a
I0 on B (i.e shift B)
I1:
S->B.B
shift a on I1
I2: Here you get shift reduce conflicts for 'a'
shift b on I1
I2: Here you get shift reduce conflicts for 'b'
Now, no more SR conflicts arise
@Sushant
See this once. Where is my mistake?