1 votes 1 votes Every unambiguous grammar is LR(0) grammar? Compiler Design compiler-design lr-parser + – samarpita asked Nov 18, 2021 samarpita 1.3k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes No, Every unambiguous grammar need not be LR(0) grammar. But the converse is true means every LR(0) grammar is unambiguous.LR(0) grammar is a proper subset of SLR(1) grammar and both are unambiguous grammar only. So we can conclude there exist some unambiguous grammar which are SLR(1) but not LR(0). raja11sep answered Nov 18, 2021 raja11sep comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Hope this clarify the things :) anupam_12 answered Feb 3, 2022 anupam_12 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No, this is not true. As, all LR(1) grammars are unambiguous, and some LR(1) grammars are not LR(0) , so this implies that some unambiguous LR(1) grammars are not LR(0). Ankita87077 answered Nov 18, 2021 Ankita87077 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes @samarpita No, this is not true... LR parsing is not a useful technique for human languages with ambiguous grammars that depend on the interplay of words... Human languages are better handled by ... 1. https://gatecse.in/lr-parsing-part-2-language-of-ll-and-lr-grammars 2. https://gateoverflow.in/91352/Can-lr-1-parser-parse-any-context-free-grammar-language 3. https://gateoverflow.in/105785/Ll-k-grammars 4. https://web.stanford.edu/class/archive/cs/cs143/cs143.1128/handouts/090%20Top-Down%20Parsing.pdf 5. https://en.wikipedia.org/wiki/LR_parser Awe111 answered Nov 18, 2021 Awe111 comment Share Follow See all 0 reply Please log in or register to add a comment.
