3,532 views

1 Answer

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).

Related questions

1 votes
1 votes
0 answers
1
set2018 asked Oct 28, 2017
2,707 views
AS GIVEN GRAMMAR IS LEFT RECURSIVE SO OPTION D MUST TRUE.ANS GIVEN:C
2 votes
2 votes
1 answer
3
sripo asked Nov 10, 2018
3,181 views
Can you give an example which is not LL(1) but is CLR(1)
0 votes
0 votes
2 answers
4
sripo asked Nov 1, 2018
2,291 views
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]