Lexical Analysis GATE 2023 Question #10088 with Solution

GATE 2023 · CS - Forenoon

Compiler DesignLexical AnalysismediumMCQ1 mark

Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions: letter → [A-Za-z] digit → [0-9] id → letter (letter | digit)* Which one of the following Non-deterministic Finite-state Automata with ε-transitions accepts the set of valid identifiers? (A double-circle denotes a final state.) The alternatives A–D are shown in the image.

AABBCCDD

Save your progress

Related Compiler Design PYQs

GATE 2023 · CS - Forenoon

Consider the following statements regarding the front-end and back-end of a compiler. S1: The front-end includes phases that are i…

GATE 2023 · CS - Forenoon

Consider the syntax directed translation given by the following grammar and semantic rules. Here N, I, F and B are non-terminals. …

GATE 2023 · CS - Forenoon

Consider the following program: ```c int main() { f1(); f2(2); f3(); return(0); } int f1() { return(1); } int…

GATE 2023 · CS - Forenoon

Consider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit p…

GATE 2026 · CS1 - Forenoon

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

GATE 2026 · CS1 - Forenoon

Which of the following statements is/are true?

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.

Related Compiler Design PYQs

Turn practice into measurable progress