GATE CS 2020 Set 1 — Question 20

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MCQ+1 / -0.33MediumDPDA vs NPDAContext-Free LanguagesTheory of ComputationLL(1) ParsingSyntax AnalysisCompiler Design

Compiler Design → Context-Free Languages → DPDA vs NPDA

Last updated

Question

Consider the language L={ann0}{anbnn0}L = \{a^n \mid n \geq 0\} \cup \{a^n b^n \mid n \geq 0\} and the following statements.
I. LL is deterministic context-free.
II. LL is context-free but not deterministic context-free.
III. LL is not LL(k)LL(k) for any kk.
Which of the above statements is/are TRUE?
Your answer

Choose one option, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Context-Free Languages