Compiler Design
Lexical Analysis
Marks 1Marks 2
Syntax Directed Translation
Marks 1Marks 2
Code Generation and Optimization
Marks 1Marks 2
1
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production ( i.e., of type $$A \to \varepsilon $$ and $$A \to a$$ ) to parse a string with n tokens?
A
$${n \over 2}$$
B
$$n - 1$$
C
$$2n - 1$$
D
$${2^n}$$
2
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Given the language L= { ab, aa, baa }, which of the following strings are in L* ?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

A
1,2 and 3
B
2,3 and 4
C
1,2 and 4
D
1,3 and 4
3
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
Which of the following describes a handle (as applicable to LR-parsing) appropriately?
A
It is the position in a sentential form where the next shift or reduce operation will occur
B
It is non-terminal whose production will be used for reduction in the next step
C
It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur
D
It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be found
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is a top-down parser?
A
Recursive descent parser.
B
Operator precedence parser.
C
An LR(k) parser.
D
An LALR(k) parser.
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