no need explanation for S_{1}.

coming to S_{2},

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.**

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

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

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

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 5.9k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,927 questions

47,580 answers

146,425 comments

62,311 users