2 votes 2 votes Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)? Compiler Design compiler-design lr-parser grammar parsing + – rahul sharma 5 asked Oct 14, 2017 rahul sharma 5 1.5k views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply srestha commented Oct 14, 2017 reply Follow Share 1 SR conflict 0 votes 0 votes nikhil_cs commented Oct 19, 2017 reply Follow Share In the canonical collection of above grammar, we get many LR(0) items in which we get only one SR conflict and zero RR conflict. SR-Conflicts :- Var ->id.[E] | id. (which has one reduce move) on seeing '[' we get one shift move. Therefore SR-Conflicts. 1 votes 1 votes Ananya Jaiswal 1 commented Nov 13, 2017 i edited by Ananya Jaiswal 1 Nov 13, 2017 reply Follow Share can anyone please show how to find LR(0) item sets? I'm getting 3 S-R Conflicts 0 votes 0 votes hs_yadav commented Nov 13, 2017 reply Follow Share @ Ananya Jaiswal 1 LR(0) grammar is bottom up parser ..can parse left recursive grammar ....and here (one SR conflict) 0 votes 0 votes Please log in or register to add a comment.