1 votes 1 votes Compiler Design compiler-design parsing made-easy-test-series + – Sambhrant Maurya asked Jan 11, 2019 edited Mar 4, 2019 by ajaysoni1924 Sambhrant Maurya 627 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply raahul commented Jan 11, 2019 reply Follow Share |||? 0 votes 0 votes Sambhrant Maurya commented Jan 11, 2019 reply Follow Share They've given I , II and III as the answer. 0 votes 0 votes raahul commented Jan 11, 2019 reply Follow Share Ohh yes...I misjudged ....all s-r r-r are possible ..When you merge them they will look like this: A->d.,c|b|f B->d., b|d|$ X->.fx,g|$ Y-> .g,a|$. There is R-R confilct in B->d. and A->d. as both will have look-ahead as b. S-R conflict between X->.fx and A->d. . 0 votes 0 votes Sambhrant Maurya commented Jan 12, 2019 reply Follow Share I get the explanation, but how can "Can be merged" as in I and II and "cannot be merged" as in III both be the answer? 0 votes 0 votes Ravi kumar singh commented Jan 12, 2019 reply Follow Share I and II are only true. The given example is LR(1). Since every production is same only lookaheads are different so we can definately merge them to form LALR(1) example. 0 votes 0 votes Please log in or register to add a comment.