GATE 2006
Which bottom-up parser construction merges states with identical sets of LR(0) items if their lookaheads differ, reducing the table size at the risk of introducing Reduce-Reduce conflicts?
Related Compiler Design PYQs
Dead code elimination in compiler optimization refers to:
In a shift-reduce parser, the operation of replacing a substring matching the right-hand side of a production with the left-hand n…
Which data structure is most commonly used by a compiler's symbol table to support fast insertions and lookups by name?
Loop unrolling is an optimization technique whose primary goal is to:
An operator precedence parser can be designed only for grammars with which of the following properties?
The pattern of a token is specified using:
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.