ll(k) and lr(k) grammars are unambiguous grammar and so they need to be dcfl...

//cfl's are ambiguous...

//cfl's are ambiguous...

The Gateway to Computer Science Excellence

+1 vote

Which of the following is FALSE?

(A) LL(k) grammars are context free grammar

(B) LL(k) grammars are unambiguous

(C) There are LL(k) grammars which are not context free

(D) LL(k) grammars cannot have left recursion

i marked a answer is given c)

(A) LL(k) grammars are context free grammar

(B) LL(k) grammars are unambiguous

(C) There are LL(k) grammars which are not context free

(D) LL(k) grammars cannot have left recursion

i marked a answer is given c)

+2 votes

0

i dont understand why people downvote... if you really know the correct answer than you should downvote...

.

moreover @Ravi kumar singh your answer is correct... one upvote from my side...

.

while answering always give valid reasons.

52,345 questions

60,503 answers

201,881 comments

95,331 users