retagged by
4,923 views

1 Answer

Best answer
2 votes
2 votes

you are right

if a grammar is Left Recursive ,left factoring and ambiguous. then it never be LL(1)

given grammar is left Recursive. then we can directly say it is not LL(1).

edited by

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,182 views
Can you give an example which is not LL(1) but is CLR(1)
8 votes
8 votes
3 answers
3
Parshu gate asked Nov 13, 2017
15,201 views
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...
7 votes
7 votes
6 answers
4
learner_geek asked Aug 5, 2017
11,493 views
Which of the following statements is true?Every LL(1) grammar is LALR(1).Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let ...