+1 vote
121 views
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)

recategorized | 121 views
0
ll(k) and lr(k) grammars are unambiguous grammar and so they need to be dcfl...

//cfl's are ambiguous...
0
every $LL(K)$ is $LR(K)$. So, $(a)$ is true. $(c)$ should be false
0
sorry there is typo i edited it see now
0
ll(k) and lr(k) are dcfl according to me first is given that they are cfl which is false
0

@Prince Sindhiya a is true and c is false..

0

@Prince Sindhiya $a$ is true, every DCFL is CFL and $c$ is false

0
ok i got that.. since every LL(k) grammar is dcfl and every dcfl is cfl so a is true and c is false...
0
ok bro i got it thnxx

Bcoz Every LL(k) grammers are context free.
by Active (1.1k points)
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.

2
+1 vote