Compiler Design · Parsing
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2026 Set 2 Q41 · MCQ · 2 marks
Key concept
No account needed
Sit 5 related ParsingPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE heavily tests the Parsing stage of compiler design across both Top-Down (LL(1), recursive descent) and Bottom-Up (LR(0), SLR(1), LALR(1), CLR(1)) paradigms. Key evaluation areas include computing FIRST and FOLLOW sets to populate parsing tables, detecting conflicts (Shift-Reduce, Reduce-Reduce), classifying grammars within the parsing power hierarchy, and executing item-set closure/goto operations. In recent years, items have shifted toward exact item counting via GOTO/CLOSURE in NAT format, reverse engineering grammar rules from FIRST/FOLLOW sets, and multi-concept MSQ verification.
Full Parsing guide →Consider the canonical LR(0) parsing of the grammar below using terminals \a, b, c\ and non-terminals \A, B, C, S\ with S as the start symbol. S ACB A aA C cC B bB b Which one of the following options gives the number of shift-reduce conflicts that will occur in the LR(0) ACTION table?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
