Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
This might look like a basic question to some of you but I expect intelligent replies here.
Why can’t a LR(1) grammar with left recursion or the LR(1) grammar that is not left factored be LL(1)?
Because you can never expect the termination of the string in LR(1) with left recursion.