The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
32 views
Consider the following
S1: Pumping lemma is used to prove, that particular language is not regular
S2: For all DCFL there exist LR(k) grammar but LL(k) may not exist.
Which of the above statements are true?
(a) Only S1 (b) Only S2
(c) Only S1 and S2 (d) None of these
asked in Theory of Computation by Active (1.3k points) | 32 views
0

no need explanation for S1.

coming to S2,

LL(k) grammars are proper subset to LR(k) -----> This can learn in CD

i hope there is a typing mistake also, it would be

 For all DPDA there exist LR(k) grammar but LL(k) may not exist.

Please log in or register to answer this question.

Related questions



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

44,071 questions
49,594 answers
162,954 comments
65,786 users