Welcome to the Compilers MCQs Page

Dive deep into the fascinating world of Compilers with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Compilers, a crucial aspect of Systems Programming. In this section, you will encounter a diverse range of MCQs that cover various aspects of Compilers, 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 Systems Programming.

Check out the MCQs below to embark on an enriching journey through Compilers. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Systems Programming.

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

Compilers MCQs | Page 6 of 9

Explore more Topics under Systems Programming

01

System Programming Basics

02

Machine Structure

03

Machine and Assembly Language

04

Assemblers

05

Macro Processor

06

Loaders

07

Programming Languages

08

Phases of Compiler

09

Interpreters

Q51.

If A and B are any two sets, then A ∪ (A ∩ B) is equal to

A^B

B^A

Discuss

Answer: (a).A

Q52.

If A, B and C are any three sets, then A × (B ∪ C) is equal to

(A × B) ∪ (A × C)

(A × B) ∩ (A × C)

(A ∪ B) × (A ∪ C)

None of the above

Discuss

Answer: (a).(A × B) ∪ (A × C)

Q53.

__________ a part of a compiler that is responsible for recognizing syntax.

Parser

Bzr

Linker

Optimizer

Discuss

Answer: (a).Parser

Q54.

The process of forming tokens from an input stream of characters is called_____.

Liberalisation

Characterisation

Tokenization

None of the mentioned

Discuss

Answer: (c).Tokenization

Q55.

Which grammar defines Lexical Syntax ?

Regular Grammar

Syntactic Grammar

Context free Grammar

Lexical Grammar

Discuss

Answer: (d).Lexical Grammar

Q56.

Which of the following statements is false?

Left as well as right most derivations can be in Unambiguous grammar

An LL (1) parser is a top-down parser

LALR is more powerful than SLR

Ambiguous grammar can’t be LR (k)

Discuss

Answer: (a).Left as well as right most derivations can be in Unambiguous grammar

Q57.

Which of the following grammar rules violate the requirements of an operator grammar ?
P, Q, R are nonterminals, and r, s, t are terminals.

1. P → Q R
2. P → Q s R
3. P → ε
4. P → Q t R r

1 only

1 and 3 only

2 and 3 only

3 and 4 only

Discuss

Answer: (b).1 and 3 only

Q58.

The action of parsing the source program into the proper syntactic classes is called

syntax analysis

lexical analysis

interpretation analysis

general syntax analysis

Discuss

Answer: (b).lexical analysis

Q59.

Which of the following statement is true?

SLR parser is more powerful than LALR

LALR parser is more powerful than canonical LR parser

canonical LR parser is more powerful than LALR parser

parser SLR,canonical CR and LALR have the same power

Discuss

Answer: (d).parser SLR,canonical CR and LALR have the same power

Q60.

Minimum hamming distance method is used for connection of

syntactic errors

semantic errors

algorithm errors

transcription errors

Discuss

Answer: (a).syntactic errors

Page 6 of 9

Welcome to the Compilers MCQs Page

Compilers MCQs | Page 6 of 9

Explore more Topics under Systems Programming

System Programming Basics

Machine Structure

Machine and Assembly Language

Assemblers

Macro Processor

Loaders

Programming Languages

Phases of Compiler

Interpreters

Suggested Topics

Formal Languages and Automata Theory

Reverse Engineering

Visual Basic

UNIX

C# programming

PHP

Digital Logic Design

Embedded Systems

JavaScript