1,354 views
1 votes
1 votes
$A→ b.a , \left \{ b \right \}$

   $B→ b.,\left \{ a \right \}$

It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?

1 Answer

0 votes
0 votes
This productions are not from a LR (1) grammar. If after merging the states of LR(1) grammar we end up with shift reduce conflict then be sure that the grammar we have used was not LR(1).  We can only have reduce reduce conflict in LALR(1) which we form by merging states of LR(1) grammar

Related questions

4 votes
4 votes
0 answers
1
3 votes
3 votes
3 answers
2
thor asked Nov 15, 2016
2,227 views
0 votes
0 votes
1 answer
3
worst_engineer asked Jan 9, 2016
1,367 views
Will not there be 3 SR conflicts in CLR(1) reduction ?In fact their ans also says this :In the state I1 , will it not be SR conflict ?
0 votes
0 votes
1 answer
4
srestha asked Dec 15, 2015
1,606 views
Which of the following set could result SR conflict in LALR(1)?a) A→ a.b, {b} B→ a. , {a}b) A→ a.a , {a} B→ a. , {b}c) A→ b.a , {b} B→ b.,{a}d) A→ b...