GATE 2007
A basic block in compiler optimization is defined as a sequence of three-address instructions such that:
Related Compiler Design PYQs
In a compiler, the tool Lex generates a lexical analyzer based on which theoretical computational model?
Moving an invariant computation outside of a loop to avoid recomputing it on every iteration is called:
Replacing the expression x = y * 8 with the equivalent operation x = y << 3 is an example of:
In predictive parsing, FIRST(α) is the set of:
Peephole optimization is a technique that operates on:
In a syntax-directed definition (SDD), if every production A -> α has semantic actions containing only synthesized attributes, the…
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.