Register

Is there SR conflict in SLR(1) ?

• retagged by
2,305 views
3 votes
3 votes

• retagged by
User Avatar

3 Answers

2 votes
2 votes
It is not SLR(1). Shift-reduce conflict in I-6 over terminal t. [Q -> . ] will be in Follow(Q)={t, $}. There is shift entry on t in I-6.
User Avatar
0 votes
0 votes
its not SLR(1) while finding follow for S and Q, we got multiples entries inthe $ and t cell so its not SLR(1)..
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
worst_engineer asked Jan 9, 2016
1,399 views
Is there three SR conflict in the CLR(1) grammar
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 ?
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 ?
User Avatar
4 votes
4 votes
0 answers
2
learner_geek asked Aug 5, 2017
725 views
IN SLR(1) SR CONFLICT
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possible with terminal(which is after dot in unfinished production) Please help what to do????
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possibl...
User Avatar
1 votes
1 votes
1 answer
3
srestha asked Jun 17, 2018
1,400 views
SR conflict in LALR(1)
$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$) ?
$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$) ?...
User Avatar
0 votes
0 votes
1 answer
4
sripo asked Nov 1, 2018
543 views
Is there shift reduce conflict in this production?
For given production for a LR(1) grammar B->b.C ,$|c here C is non terminal C->c. ,$|c and here c is terminal. $|c are lookup symbols Will there be a shift reduce conflict if a non terminal is visited.Please explain how shift reduce conflict works
For given production for a LR(1) grammarB->b.C ,$|c here C is non terminalC->c. ,$|c and here c is terminal. $|c are lookup symbolsWill there be a shift reduce conflict...
User Avatar
Link Copied!