0 votes 0 votes Suppose Grammars given:- S→ Bbb B→ epsilon If we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right?? Because B→ epsilon would be same as B→ . right? Please make this clear. Compiler Design compiler-design + – Shamim Ahmed asked Jan 13, 2019 Shamim Ahmed 454 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Shaik Masthan commented Jan 13, 2019 reply Follow Share shift means you have a terminal which reach to another state But here you have Non-terminal, which leads to GOTO function but not Shift 0 votes 0 votes Shamim Ahmed commented Jan 13, 2019 reply Follow Share Yes! you are right. It should be GOTO. Is B→ epsilon is same as B -> . ? Will it cause any conflict in the first state? 0 votes 0 votes Shaik Masthan commented Jan 14, 2019 reply Follow Share Is B→ epsilon is same as B -> . ? yes. Will it cause any conflict in the first state? there is no shift operation, therefore it may cause reduce-reduce conflict ! But in this question, is there any productions leads to reduce-reduce conflict ? Answer :- NO 2 votes 2 votes Shamim Ahmed commented Jan 14, 2019 reply Follow Share Thank you :) 0 votes 0 votes Please log in or register to add a comment.
