0 0 votes Q9-Consider the following grammar: S → aPbSQ | a Q → t | ε P → r The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____. made easy solution my solution please correct me if i wrong no of state is reduce =6? Compiler Design compiler-design parsing lr-parser numerical-answers made-easy-test-series + – ADITYA CHAURASIYA 5 1.5k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Stats that will merge (I2 I10), (I4 I11), (I5 I12), (I6 I13), (I7 I14), (I8I 15) is it correct?? OO7 answered Jul 9, 2018 OO7 comment Share Follow See all 2 Comments 2 2 Comments reply abhishekmehta4u commented Jul 9, 2018 reply Follow flag It seems to be correct 0 0 replyShare OO7 commented Jul 9, 2018 reply Follow flag plz check I13 I am getting lookahead as {t, dollar} whereas according made easy it is only { dollar } for Q ->.t 0 0 replyShare Please log in or register to add a comment.
0 0 votes i am getting 7 reduced state what is d answer? arch answered Nov 20, 2017 arch comment Share Follow See 1 comment 1 1 comment reply ADITYA CHAURASIYA 5 commented Nov 20, 2017 reply Follow flag please see in ans Q->t. ,{t$} is true or not which is not given in made easy solution 0 0 replyShare Please log in or register to add a comment.
0 0 votes The given grammar is not CLR(1) at all... See My Solution Below State I13 in made easy solution is an Inadequate state https://drive.google.com/open?id=0B3eLIyGEqcHQOGhnY1BIenY2VE1jYWkzcm9iUjdObm1xMXBV Ravi Raja answered Jan 2, 2018 Ravi Raja comment Share Follow 0 reply Please log in or register to add a comment.
