The Gateway to Computer Science Excellence
+3 votes
863 views
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.
in Compiler Design by (385 points) | 863 views

1 Answer

+7 votes
Best answer
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).
by Active (2.6k points)
0
if a grammar has left recursion definitely not LL(1),but whart about slr(1)?
+1
SLR(1) can handle left recursion and left factoring,hence it is more powerful.Please correct me if I am wrong.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,459 answers
195,378 comments
100,274 users