ExamSIDE
Questions (Powered by ExamGOAL)
Compiler Design
Lexical Analysis
Marks 1Marks 2
Parsing
Marks 1Marks 2Marks 5
Syntax Directed Translation
Marks 1Marks 2
Code Generation and Optimization
Marks 1Marks 2
Previous Next
1
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
Match all items in Group 1 with correct options from those given in Group 2.

Group 1

P. Regular expression
Q. Pushdown automata
R. Dataflow analysis
S. Register allocation

Group 2

1. Syntax analysis
2. Code generation
3. Lexical analysis
4. Code optimization
A
P - 4. Q - 1, R - 2, S - 3
B
P - 3, Q - 1, R - 4, S - 2
C
P - 3, Q - 4, R - 1, S - 2
D
P - 2, Q - 1, R - 4, S - 3
2
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
The number of tokens in the following C statement is: 
printf("i = %d, &i = %x",i, &i);
A
3
B
26
C
10
D
21
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Type checking is normally done during
A
Lexical analysis
B
Syntax analysis
C
Syntax directed translation
D
Code optimization
4
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
In some programming languages, an identifier is permitted to be a letter following by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?
A
$${\left( {L \cup D} \right)^ + }$$
B
$$L{\left( {L \cup D} \right)^*}$$
C
$${\left( {L.D} \right)^*}$$
D
$$L{\left( {L.D} \right)^*}$$
Previous Next
Questions Asked from Marks 1
GATE CSE 2024 Set 2 (1) GATE CSE 2011 (1) GATE CSE 2010 (1) GATE CSE 2009 (1) GATE CSE 2000 (1) GATE CSE 1998 (1) GATE CSE 1995 (2) GATE CSE 1990 (1) GATE CSE 1988 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization