7 votes 7 votes Which of the following statements is true? Every LL(1) grammar is LALR(1). Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let me correct. Compiler Design compiler-design grammar ll-parser parsing + – learner_geek asked Aug 5, 2017 • edited Nov 6, 2023 by Hira Thakur learner_geek 11.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply Apoorva Jain commented Jan 10, 2019 reply Follow Share Helpful link https://stackoverflow.com/questions/6487588/example-for-ll1-grammer-which-is-not-lalr/6492798#6492798 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes both are true . Every ll 1 grammar is lalr1 grammar and every lalr1 grammar is CLR1 grammar. check the standard book pritambiswas000007 answered Jun 5, 2020 pritambiswas000007 comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes 1. True 2.False kallu singh answered Aug 5, 2017 kallu singh comment Share Follow See all 5 Comments See all 5 5 Comments reply joshi_nitish commented Aug 5, 2017 reply Follow Share @kallu if first is true how could second be false, since every LALR(1) is CLR(1)... by the way @learner_geek, second is true but first is false since there are some LL(1) which are not LALR(1)... 1 votes 1 votes learner_geek commented Aug 5, 2017 reply Follow Share According to @kallu if first is true then 2nd will automatically true because every LALR(1) is CLR(1) 0 votes 0 votes learner_geek commented Aug 5, 2017 reply Follow Share thanks joshi_nitish 0 votes 0 votes reena_kandari commented Aug 14, 2017 reply Follow Share for any k>0 LR(k)=LR(k+1) 0 votes 0 votes sutanay3 commented Apr 3, 2018 reply Follow Share We can also refer to this link for better understanding- https://www.facebook.com/groups/gateoverflow/search/?query=parser%20diagram 0 votes 0 votes Please log in or register to add a comment.
