GATE CS 2020 Set 1 — Question 34
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+1 / -0MediumSyntax AnalysisCompiler DesignParse Trees
Compiler Design → Syntax Analysis → Parse Trees
Last updated
Question
Consider the following grammar.
The number of reduction steps taken by a bottom-up parser while accepting the string is ________.
The number of reduction steps taken by a bottom-up parser while accepting the string is ________.
Correct answer
7 to 7
Solution
We trace the bottom-up parsing (shift-reduce) for the string :
1.Shift , Shift , Shift , Shift . Stack:
2.Reduce . Stack: (Reduction 1)
3.Shift . Stack:
4.Reduce . Stack: (Reduction 2)
5.Reduce . Stack: (Reduction 3)
6.Shift . Stack:
7.Reduce . Stack: (Reduction 4)
8.Reduce . Stack: (Reduction 5)
9.Shift . Stack:
10.Reduce . Stack: (Reduction 6)
11.Reduce . Stack: (Reduction 7)
The parser accepts the string. Total reductions = 7.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: Which of the following options is/are correct? [figure]2026 Set 1 Q28Which of the following statements is/are true?2026 Set 2 Q35A lexical analyzer uses the following token definitions - - …