1 votes 1 votes consider a state having this L' -> L. {$} L -> L.b {$,B} does this state have SR coonflict Compiler Design compiler-design parsing lr-parser + – A_i_$_h asked Oct 21, 2017 • retagged Jun 18, 2022 by Lakshman Bhaiya A_i_$_h 354 views answer comment Share Follow See 1 comment See all 1 1 comment reply Manu Thakur commented Oct 21, 2017 reply Follow Share printing mistake! repost. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes No it's not Shift-Reduce conflict, because first is not a reduction, it's "Accept" operation. For your reference: Manu Thakur answered Oct 21, 2017 • edited Oct 21, 2017 Manu Thakur comment Share Follow See all 2 Comments See all 2 2 Comments reply A_i_$_h commented Oct 21, 2017 reply Follow Share @manu okay got it :) and what if it was L -> L. {$} L->L.b {$,b} then ? and what in this case L->L. {$} L->L.b {b} that is in both cases i am considering ot as reduce and not accept state 0 votes 0 votes Manu Thakur commented Oct 21, 2017 i edited Oct 21, 2017 reply Follow Share the first one is indeed an s/r conflict as look ahead symbols are not disjoint. {'dollar'} Intersection {'dollar',b} != phi hence S/R conflict. in second case, Intersection will be empty set hence no s/r conflict. 1 votes 1 votes Please log in or register to add a comment.
