1 votes 1 votes Which states of LR(0) is having conflict..anyone please check Compiler Design compiler-design parsing lr-parser test-series + – KISHALAY DAS asked Nov 6, 2016 • retagged Jul 15, 2022 by Anjana5051 KISHALAY DAS 1.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes S' -> .S S -> .aSa | .bSb | .A A -> .aBb now second item set can be obtained by taking transition on a S -> a.Sa A -> a.Bb S -> .aSa | .bSb | .A A -> .aBb B -> .aB | .bB | . now this B-> . is a reduce move So SR conflict occurs hence it is not LR(0) Digvijaysingh Gautam answered Nov 7, 2016 Digvijaysingh Gautam comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Digvijaysingh Gautam commented Nov 7, 2016 reply Follow Share becoz dot is ahead of both a and b 0 votes 0 votes KISHALAY DAS commented Nov 7, 2016 reply Follow Share But see reduce i on B->. and i guess a is not in Follow of B 0 votes 0 votes KISHALAY DAS commented Nov 7, 2016 reply Follow Share No..sorry it is LR(0)...you are right 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes D neither LL(1) nor LR(0) https://stackoverflow.com/questions/34979911/why-does-a-lr1-dfa-doesnt-have-a-shift-reduce-conflict OO7 answered Jul 6, 2018 OO7 comment Share Follow See all 0 reply Please log in or register to add a comment.
