Welcome to the Compiler Design MCQs Page

Dive deep into the fascinating world of Compiler Design with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Compiler Design, a crucial aspect of GATE CSE Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Compiler Design, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within GATE CSE Exam.

Check out the MCQs below to embark on an enriching journey through Compiler Design. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Compiler Design. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Compiler Design MCQs | Page 1 of 12

Explore more Topics under GATE CSE Exam

01

Networking

02

Operating System

03

Data Structures and Algorithms

04

Computer Architecture

05

DBMS

06

Theory of Computation(TOC)

07

Engineering Mathematics

Q1.

The number of tokens in the following C statement is

printf("i = %d, &i = %x", i, &i);

Discuss

Answer: (c).10

Q2.

In a compiler, keywords of a language are recognized during

parsing of the program

the code generation

the lexical analysis of the program

dataflow analysis

Discuss

Answer: (c).the lexical analysis of the program

Q3.

The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Finite state automata

Deterministic pushdown automata

Non-Deterministic pushdown automata

Turing Machine

Discuss

Answer: (a).Finite state automata

Q4.

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 -> є and A -> a) to parse a string with n tokens?

n/2

n-1

2n-1

2^n

Discuss

Answer: (b).n-1

Q5.

Consider the following two sets of LR(1) items of an LR(1) grammar.

X -> c.X, c/d
X -> .cX, c/d
X -> .d, c/d
X -> c.X, $
X -> .cX, $
X -> .d, $

Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE?

1. Cannot be merged since look aheads are different.
2. Can be merged but will result in S-R conflict.
3. Can be merged but will result in R-R conflict.
4. Cannot be merged since goto on c will lead to two different sets.

1 only

2 only

1 and 4 only

1, 2, 3, and 4

Discuss

Answer: (d).1, 2, 3, and 4

Q6.

The grammar S → aSa | bS | c is

LL(1) but not LR(1)

LR(1)but not LR(1)

Both LL(1)and LR(1)

Neither LL(1)nor LR(1)

Discuss

Answer: (c).Both LL(1)and LR(1)

Q7.

Match all items in Group 1 with correct options from those given in Group 2.

Group 1 Group 2

P. Regular expression 1. Syntax analysis
Q. Pushdown automata 2. Code generation
R. Dataflow analysis 3. Lexical analysis
S. Register allocation 4. Code optimization

P-4. Q-1, R-2, S-3

P-3, Q-1, R-4, S-2

P-3, Q-4, R-1, S-2

P-2, Q-1, R-4, S-3

Discuss

Answer: (b).P-3, Q-1, R-4, S-2

Q8.

Which of the following statements are TRUE?

I. There exist parsing algorithms for some programming languages
whose complexities are less than O(n^3).
II. A programming language which allows recursion can be implemented
with static storage allocation.
III. No L-attributed definition can be evaluated in The framework
of bottom-up parsing.
IV. Code improving transformations can be performed at both source
language and intermediate code level.

I and II

I and IV

III and IV

I, III and IV

Discuss

Answer: (b).I and IV

Q9.

Which of the following describes a handle (as applicable to LR-parsing) appropriately?

It is the position in a sentential form where the next shift or reduce operation will occur

It is non-terminal whose production will be used for reduction in the next step

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

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

Discuss

Answer: (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

Q10.

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if

the SLR(1) parser for G has S-R conflicts

the LR(1) parser for G has S-R conflicts

the LR(0) parser for G has S-R conflicts

the LALR(1) parser for G has reduce-reduce conflicts

Discuss

Answer: (b).the LR(1) parser for G has S-R conflicts

Page 1 of 12

Welcome to the Compiler Design MCQs Page

Compiler Design MCQs | Page 1 of 12

Explore more Topics under GATE CSE Exam

Networking

Operating System

Data Structures and Algorithms

Computer Architecture

DBMS

Theory of Computation(TOC)

Engineering Mathematics

Suggested Topics

Discrete Mathematics

Data Warehousing and OLAP

Computer Hardware

Python

Reverse Engineering

JavaScript

Web Technologies

PHP

Software Engineering