GATE CS 2015 Set 1 — Question 18
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 Design
Compiler Design → Syntax Analysis → LR(0) & SLR(1)
Last updated
Question
Which one of the following is TRUE at any valid state in shift-reduce parsing?
Correct answer
(C) The stack contains only a set of viable prefixes
Solution
In shift-reduce parsing, the stack contents at any point must form a viable prefix of a right sentential form. A viable prefix is a prefix of a right sentential form that can appear on the stack of a shift-reduce parser. This property ensures that as long as the stack contains a viable prefix, it is possible to continue parsing to reach the start symbol. Therefore, the stack contains only a set of viable prefixes (meaning the content of the stack is always a viable prefix).
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 Syntax Analysis
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 Q27Consider the following C statements: [figure] Which of the following options is/are correct?2026 Set 1 Q28Which of the following statements is/are true?2026 Set 2 Q35A lexical analyzer uses the following token definitions - - …