0 votes 0 votes Can LALR have more reduce entries than SLR ? As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less than or equal to those in SLR. Is it correct?, please verify. Compiler Design compiler-design parsing + – meghna asked Sep 19, 2018 meghna 291 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Nilabja Sarkar commented Sep 19, 2018 reply Follow Share if grammar is SLR then no of sates in SLR and LALR is same . if you consider blank entries then yes LALR has more no of entries 0 votes 0 votes meghna commented Sep 19, 2018 reply Follow Share means less or equal reduce entries in LALR 0 votes 0 votes Nilabja Sarkar commented Sep 19, 2018 reply Follow Share if you consider for same grammar 0 votes 0 votes meghna commented Sep 19, 2018 reply Follow Share yes definitely i am checking for same grammar only 0 votes 0 votes himan7196 commented Sep 19, 2018 reply Follow Share SLR is less powerful than LALR ( means that in the Parsing table LALR has more blanks as compared to SLR ). So reduce entries in LALR can't be more than that of SLR, so I think you're right. 0 votes 0 votes Please log in or register to add a comment.