GATE 1995
Available Expressions analysis is a forward data-flow analysis problem used to identify opportunities for:
Related Compiler Design PYQs
In a lexical analyzer, the buffer pair scheme is used primarily to:
In an LR parser, a Reduce-Reduce conflict indicates that the parser cannot decide:
Which compiler optimization combines multiple basic blocks that execute sequentially into a single basic block?
Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …
Which of the following statements is/are true?
Consider the following two syntax-directed definitions for type declarations. | SDD1: Grammar \(G_1\) | Semantic rules | | --- | …
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.