Parsing Techniques GATE 1990 Question #8868 with Solution

GATE 1990

Compiler DesignParsing TechniquesmediumMCQ2 marks

An LR parser can recognize handles in the right sentential form using:

AA Deterministic Finite Automaton on the parser stackBA Turing MachineCA linear search over the symbol tableDA depth-first search graph traversal

Related Compiler Design PYQs

Which data structure is primarily used by a compiler symbol table to support fast lookups?

A basic block ends at:

Loop unrolling improves program runtime performance primarily by:

Which parser generator tool constructs LALR(1) parsing tables automatically from context-free grammar specifications?

Which grammar rule causes shift-reduce conflicts in bottom-up parsing?

Consider the following C statements: char *str1 = "Hello; /* Statement S1 */ char *str2 = "Hello;"; /* Statement S2 …

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.