GATE CS 2021 Set 1 — Question 15
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33MediumLR(0) & SLR(1)Syntax AnalysisCompiler DesignCYK AlgorithmContext-Free LanguagesTheory of Computation
Compiler Design → Context-Free Languages → CYK Algorithm
Last updated
Question
Consider the following statements.
: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).
: For any context-free grammar, there is a parser that takes at most time to parse a string of length .Which one of the following options is correct?
: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).
: For any context-free grammar, there is a parser that takes at most time to parse a string of length .Which one of the following options is correct?
Correct answer
(C) S₁ is true and S₂ is true
Solution
is true: All LR parsers, including SLR(1), can only handle unambiguous grammars. However, the class of SLR(1) grammars is a proper subset of unambiguous grammars (e.g., some unambiguous grammars are LR(1) but not SLR(1)).
is true: General parsing algorithms like the Cocke-Younger-Kasami (CYK) algorithm or Earley's algorithm can parse any context-free grammar in time, where is the length of the input string.
is true: General parsing algorithms like the Cocke-Younger-Kasami (CYK) algorithm or Earley's algorithm can parse any context-free grammar in time, where is the length of the input string.
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
2026 Set 2 Q13Which one of the following statements is equivalent to the following assertion? Turing machine …2026 Set 2 Q17In C runtime environment, which one of the following is stored in heap?2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q25Consider the following grammar where is the start symbol, and and are terminal symbols.…2026 Set 1 Q26Let be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of…