4 votes 4 votes Do we directly say it is not LL(1) because it is left recursive or do we eliminate the left recursion, create the parsing table and then make a decision. Compiler Design parsing compiler-design + – Akshay Jindal asked Oct 19, 2015 Akshay Jindal 3.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes Yes, you can directly say that left recursive grammar is not LL(1) .But after eliminating the Left recursion also, there is no 100% surity that it will become LL(1). Vivek sharma answered Oct 19, 2015 Vivek sharma comment Share Follow See all 3 Comments See all 3 3 Comments reply set2018 commented Oct 28, 2017 reply Follow Share if a grammar has left recursion definitely not LL(1),but whart about slr(1)? 0 votes 0 votes sripo commented Nov 9, 2018 reply Follow Share SLR(1) can handle left recursion and left factoring,hence it is more powerful.Please correct me if I am wrong. 1 votes 1 votes shaleen govil commented May 10, 2021 reply Follow Share Why? Why we directly say that grammar is not LL(1) if it has a left recursion. why don’t we first eliminate the Left recursion and then check if the grammar is LL(1) or not ? 0 votes 0 votes Please log in or register to add a comment.