S2: The language cannot be recognized by deterministic PDA (this statement is true)

anyone explain s1 :??

The Gateway to Computer Science Excellence

0 votes

- Which of the following statement/s is/are false for the following language:

L = {a^{m}b^{n}c^{q}| m = n or n = q, m > 0, n > 0, q > 0}

S1: The language can be parsed by any LR(K) parsers for any value of K.

S2: The language cannot be recognized by deterministic PDA.- Only S2
- Only S1
- Both S1 and S2
- Neither S1 nor S2

0

S2: The language cannot be recognized by deterministic PDA (this statement is true)

anyone explain s1 :??

0

@kunal,why the language cannot be accepted by deterministic PDA??can you explain ?is it cuz of OR in the grammar ?but it can be accepted by non-deterministic PDA..right??

but they are separate conditions..so they can be accepted by DPDA na??

but they are separate conditions..so they can be accepted by DPDA na??

0

alright and if it would have been AND then,it could'nt be accepted by cfl also then..right??

and if language is L _{1}= {a^{m} b^{n} c^{q} d^{p} | m = n or p = q, m > 0, n > 0, q > 0,p>0}

and if language is L 2= {a^{m} b^{n} c^{q} d^{p} | m = n AND p = q, m > 0, n > 0, q > 0,p>0}

then please tell which is cfl anf which is dcfl??

thankyou

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,647 questions

56,508 answers

195,530 comments

100,966 users