1 votes 1 votes IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT? CAN SOMEONE EXPLAIN?? Compiler Design compiler-design parsing ll-parser lr-parser + – sushmita asked Jan 17, 2017 retagged Jun 19, 2022 by Lakshman Bhaiya sushmita 483 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply srestha commented Jan 17, 2017 reply Follow Share see pic 5 votes 5 votes sudsho commented Jan 17, 2017 reply Follow Share if ur grammmar is epsilon free then every LL(1) will be LALR also but if it contains epsilon..it may or may nt be LALR.. 0 votes 0 votes sushmita commented Jan 17, 2017 reply Follow Share thanx. can u plz tell from where to read this topic? 0 votes 0 votes sudsho commented Jan 17, 2017 reply Follow Share dragon book is best...these diagrams are from that only..just keep this fig in mind nthng much ... 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes So, there are certain grammars which are LL(1) but not LALR(1) Samujjal Das answered Jan 17, 2017 selected Jan 17, 2017 by sushmita Samujjal Das comment Share Follow See 1 comment See all 1 1 comment reply sushmita commented Jan 17, 2017 reply Follow Share Thanx :) 0 votes 0 votes Please log in or register to add a comment.