GATE 1992
Consider a grammar with 5 non-terminals. What is the maximum number of entries in an LL(1) parse table if there are 4 terminals plus the endmarker $?
Related Compiler Design PYQs
Which of the following cannot be parsed using an operator precedence parser?
During code generation, intermediate three-address instructions of the type 'x = y op z' are represented using quadruples with whi…
An LR(1) parser with lookahead 1 resolves conflicts that cannot be parsed by:
In compiler optimization, copy propagation refers to replacing occurrences of variable y with variable x after an assignment of th…
Which of the following regular expressions represents standard C integer numeric constants?
Loop unswitching is an optimization technique that moves:
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.