0 votes 0 votes If the grammar be left recursive then is it always be ambiguous? Compiler Design compiler-design parsing left-recursion ambiguous-grammar descriptive + – vaishali jhalani asked Nov 21, 2016 • retagged Jun 22, 2022 by Lakshman Bhaiya vaishali jhalani 1.9k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Amitabh Tiwari 1 commented Nov 21, 2016 reply Follow Share If the grammar is left recursive and right recursive both then is it always ambiguous. 1 votes 1 votes LeenSharma commented Apr 24, 2017 reply Follow Share A grammar is ambiguous if it is both left and right recursive. http://cs.txstate.edu/~ch04/webtest/teaching/courses/5318/lectures/slides2/s4-amb-assoc-prec.pdf 1 votes 1 votes Verma Ashish commented Jun 6, 2019 reply Follow Share It need not be.. https://gateoverflow.in/1493/gate1999-2-15 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes No, Not necessary if a grammar is left recursive then it may or may not be ambiguous. Let's take one small example A-> Aa/ε this grammar is left recursive but not ambiguous. prashant dubey answered Jun 6, 2019 prashant dubey comment Share Follow See all 0 reply Please log in or register to add a comment.
