The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+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)
in Compiler Design by Loyal (5.5k points)
recategorized by | 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

1 Answer

+2 votes
Your answer is correct its c) not a)

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.

Related questions

0 votes
0 answers
5
0 votes
0 answers
7
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,092 questions
55,239 answers
190,756 comments
85,992 users