Verifying Shift-Reduce conflicts in this SLR grammer

Question

S -> BB

B -> aB | bB | a | b

How many SLR conflicts will occur when we try make parsing table for it.

a) 0    b) 1   c) 2    d) None of these

----------------------------------------------------------------

Doubt: Do we count 2 SR conflicts for the same state as 2 separate conflicts. I mean to say that 'SR conflicts in parse table and SR conflicts in states can vary?' i.e, Suppose, as in one cell of parse table if we have 3 productions [ B -> a.  ;  B -> .a  ;   B -> .aB ] Then as you can see there are 2 SR conflicts in 1 state. So, do we count it as 1 conflict or 2 conflicts. 

So, in the above parse table for given grammer (in Qstn). As you can see, there is such a situation in I3 (left-bottom) and in I4 (right-bottom). So, how many SR conflicts are there 2 or 4 ??

Comments

2 conflicts.

Answer 1

My Answer is

We have 2 SR conflicts
i.e at I3 we have both final and non final items
 such as B->a. and all other productions
 so we get both shift and reduce under a (since follow of B is a,b)--its 1 conflict
and (same as I3 we have conflict at I4 ) -- 2nd conflict

Comments

In I₃ we have a final item B --> a.

FOLLOW(B)= {a,b}

There are 4 productions in I₃ that have SHIFT operation on 'a' and 'b' i.e

B--> .aB

B--> .a

B--> .bB

B--> .b

such that they each tend to cause SR conflict with the above final item. So, don't we consider them as 4 SR conflicts in state I₃ ? This is my doubt.