adplus-dvertising

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.

frame-decoration

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 6 of 12

Explore more Topics under GATE CSE Exam

Q51.
Consider the following statements:

(I) The output of a lexical analyzer is groups of characters.
(II) Total number of tokens in printf("i=%d, &i=%x", i, &i); are 11.
(III) Symbol table can be implementation by using array and hash table but not tree.

Which of the following statement(s) is/are correct?

a.

Only (I)

b.

Only (II) and (III)

c.

All (I), (II), and (III)

d.

None of these

Discuss
Answer: (d).None of these
Q52.
Which one of the following statements is FALSE ?

a.

Context-free grammar can be used to specify both lexical and syntax rules.

b.

Type checking is done before parsing.

c.

High-level language programs can be translated to different Intermediate Representations.

d.

Arguments to a function can be passed using the program stack.

Discuss
Answer: (b).Type checking is done before parsing.
Q53.
A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}.

T1: a?(b∣c)*a
T2: b?(a∣c)*b
T3: c?(b∣a)*c

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 processes by the analyzer, which one of the following is the sequence of tokens it outputs?

a.

T1T2T3

b.

T1T1T3

c.

T2T1T3

d.

T3T3

Discuss
Answer: (d).T3T3
Q54.
Match the description of several parts of a classic optimizing compiler in List - I, with the names of those parts in List - II:

a.

(1)

b.

(2)

c.

(3)

d.

(4)

Discuss
Answer: (a).(1)
Q55.
The output of a lexical analyzer is

a.

A parse tree

b.

Intermediate code

c.

Machine code

d.

A stream of tokens

Discuss
Answer: (d).A stream of tokens
Q56.
The number of tokens in the following C statement is printf("i=%d, &i=%x", i&i);

a.

13

b.

6

c.

10

d.

9

Discuss
Answer: (d).9
Q57.
A particular BNF definition for a "word" is given by the following rules. Which of the following lexical entries can be derived from < word > ?
I. pick
II. picks
III. c44

a.

I, II and III

b.

I and II only

c.

l and III only

d.

lI and III only

Discuss
Answer: (d).lI and III only
Q58.
For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. ε is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (a).A
Q59.
Consider the following statement:

if (expression)
statement
else
statement

Which of the following describes the above statement?

a.

Regular grammar

b.

Context free grammar

c.

Both a and b

d.

None of these

Discuss
Answer: (b).Context free grammar
Q60.
Removal of left recursion is necessary because?

a.

It causes recursive decent parser to loop forever

b.

It generates an ambiguous grammar

c.

Both a and b

d.

None of these

Discuss
Answer: (a).It causes recursive decent parser to loop forever
Page 6 of 12

Suggested Topics

Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...