1
GATE CSE 2021 Set 1
Numerical
+2
-0
Consider the following C code segment:
a = b + c;
e = a + 1;
d = b + c;
f = d + 1;
g = e + f;
In a compiler, this code segment is represented internally as a directed acyclic graph (DAG). The number of nodes of nodes in the DAG is ______
Your input ____
2
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following statements is FALSE?
3
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
A lexical analyzer uses the following patterns to recognize three tokens $${T_1},{T_2},$$ and $${T_3}$$ over the alphabet $$\left\{ {a,b,c} \right\}.$$
$$\eqalign{ & {T_1}:\,\,\,a?{\left( {b|c} \right)^ * }a \cr & {T_2}:\,\,\,b?{\left( {a|c} \right)^ * }b \cr & {T_3}:\,\,\,c?{\left( {b|a} \right)^ * }c \cr} $$
Note that $$'x?'$$ means $$0$$ or $$1$$ occurrence of the symbol $$x.$$ Note also that the analyzer outputs the token that matches the longest possible prefix.
If the string $$bbaacabc$$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs?
4
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following grammars is free from $$left$$ $$recursion$$?
Questions Asked from Lexical Analysis (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages