3 votes 3 votes Assume that the SLR(1) parser for a grammar has P1 states, and the CLR(1) parser for the same has P2 states. Which of the following clearly depicts the relationship between P1 and P2? $P1 \leq P2$ $P1 = P2$ $P1 \geq P2$ It depends on the grammar. Compiler Design tbb-cd-1 compiler-design parsing + – Bikram asked Nov 25, 2016 retagged Sep 14, 2020 by ajaysoni1924 Bikram 268 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Hradesh patel commented Dec 16, 2016 reply Follow Share sir ..here why not consider the gerenal case LR(0) = SLR(1) = LALR(1) < CLR(1) 2 votes 2 votes Bikram commented Dec 16, 2016 reply Follow Share read this https://gateoverflow.in/907/gate2003-17 0 votes 0 votes Sheshang commented Dec 17, 2016 reply Follow Share answer should be A. hardesh patel is right 2 votes 2 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes Number of states all three parser will be same but there might be increase coming to CLR(1) A is Correct. Ravijha answered Jun 25, 2019 selected Jun 26, 2019 by Bikram Ravijha comment Share Follow See all 0 reply Please log in or register to add a comment.