2 votes 2 votes Compiler Design compiler-design parsing lr-parser ambiguous + – ansaritk asked Dec 17, 2014 • retagged Jun 17, 2022 by Lakshman Bhaiya ansaritk 916 views answer comment Share Follow See 1 comment See all 1 1 comment reply sonveer tomar 1 commented Nov 8, 2017 reply Follow Share LR(K) GRAMMAR ARE DCFL AND ALSO UNAMBIGUOUS, IF AMBIGUOUS WE CAN'T ALWAYS HAVE PARSE Tree 0 votes 0 votes Please log in or register to add a comment.
Best answer 3 votes 3 votes Yes as both LL grammer and LR grammer are sibset of unambiguous grammers Kuldeeppunjabi1729 answered Dec 17, 2014 • selected Dec 20, 2014 by ansaritk Kuldeeppunjabi1729 comment Share Follow See all 3 Comments See all 3 3 Comments reply ansaritk commented Dec 20, 2014 reply Follow Share You are correct.. 0 votes 0 votes spriti1991 commented Mar 19, 2015 reply Follow Share If i am not mistaken , LR (K) mean LR(1) or either LR(O), But for LR parser to work , the grammer must be non ambigious always . The only Bottom parser (LR parser + operator preecednce parser ) . In both of these , only Operator preecdence parser is capable of parsing ambigious grammar. whereas Top Down parser can not even handle unambigious, Left Recursive and Non Deteministic Grammar. 1 votes 1 votes spriti1991 commented Mar 19, 2015 reply Follow Share oh no the word garmmar was specified yes they can be ambigious Sorry !! 0 votes 0 votes Please log in or register to add a comment.
