Parsing Techniques GATE 2005 Question #7537 with Solution

GATE 2005

Compiler DesignParsing TechniqueseasyMCQ1 mark

In a syntax tree, FOLLOW(A) for a non-terminal A contains '$' (endmarker) if:

AA is the start symbol of the grammarBA derives εCA has no recursive productionsDA is an operator symbol

Related Compiler Design PYQs

In bottom-up LR parsing, a 'handle' is defined as:

A Directed Acyclic Graph (DAG) for a basic block is primarily used to eliminate:

During lexical analysis, which of the following is NOT treated as a white space character by default in ANSI C?

Which of the following parsers reads its input from left to right and produces a rightmost derivation in reverse?

Which of the following is a top-down parsing technique?

In regular expressions used for lexical analysis, the positive closure operator (+) applied to symbol 'a' (a+) is defined as:

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.