Compiler Design MCQ Quiz - Objective Question with Answer for Compiler Design - Download Free PDF

Compiler design is a field of computer science that focuses on the development of software tools known as compilers. A compiler is a program that translates source code written in a high-level programming language into a low-level language (such as machine code) that can be executed by a computer. It involves various stages, including lexical analysis, syntax analysis, semantic analysis, code generation, and code optimization. MCQs on compiler design cover topics such as lexical analysis, parsing techniques (such as LL and LR parsing), symbol table management, intermediate code generation, optimization techniques, and error handling. These MCQs assess knowledge of compiler architecture, compiler phases, compiler construction techniques, and compiler optimization strategies. Find out how much you know about this compiler and its uses by solving the given Compiler Design MCQs.

Latest Compiler Design MCQ Objective Questions

Compiler Design Question 1:

Phase 3 of a typical 6-phase compiler is _____.

1. Intermediate Code Generation
2. Syntax Analysis
3. Semantic Analysis
4. Code Optimization

Answer (Detailed Solution Below)

Compiler Design Question 1 Detailed Solution

The correct answer is Semantic Analysis.

Key Points

• Semantic Analysis is the third phase in the typical phases of a compiler.
• In this phase, the compiler checks the source code for semantic errors and ensures that the meaning of the code is correct.
• This phase uses the syntax tree and symbol table generated in earlier phases to verify that the code adheres to the language's rules.
• Examples of checks performed during semantic analysis include type checking, scope resolution, and ensuring that variables are declared before use.

Additional Information

• Intermediate Code Generation: This phase is typically the fourth phase of a compiler. It generates an intermediate representation of the source code that is easier to optimize and translate into machine code.
• Syntax Analysis: This is the second phase of a compiler. It involves parsing the source code to check for correct syntax and construct a syntax tree.
• Code Optimization: This phase is generally the fifth phase of a compiler. It aims to improve the intermediate code so that the final machine code runs faster or takes up less space.

Compiler Design Question 2:

1. 1.02e+2
2. #define
3. MAX
4. "Testbook"
5. Keyword

Answer (Detailed Solution Below)

Compiler Design Question 2 Detailed Solution

A token is a sequence of characters that can be treated as a single logical entity. C tokens are the basic building blocks in C language which are constructed together to write a C program.

● Each and every smallest individual unit in a C program are known as C tokens.

● C tokens are of six types. They are,

1.Keywords (eg: int, while),

2.Identifiers (eg: main, total, MAX),

3.Constants (eg: 10, 20, 1.02e+2),

4.Strings (eg: “total”, “hello”, "Testbook"),

5.Special symbols (eg: (), <>),

#define is C Preprocessor, which is not part of the compiler but is a separate step in the compilation process. So it is not a token.

Compiler Design Question 3:

1. A - I, B - III, C - II, D - IV
2. A - II, B - III, C - I, D - IV
3. A - II, B - I, C - IV, D - III
4. A - IV, B - II, C - I, D - III

Answer (Detailed Solution Below)

Compiler Design Question 3 Detailed Solution

The correct answer is A - II, B - III, C - I, D - IV

Key Points

• A. P vs NP Problem deals with II. Polynomial-Time Verification.
• B. Chomsky Hierarchy defines various III. Classes of Formal Grammars.
• C. Rice's Theorem pertains to properties of I. Undecidable Problems.
• D. Savitch's Theorem is about IV. Space Complexity.

Therefore, the correct matching is: A - II, B - III, C - I, D - IV.

Compiler Design Question 4:

The number of tokens in the following line: int main()
int a = 1, b = 2;
printf("Sum is:%d",a+b);
return 0;
>

Answer (Detailed Solution Below)

Compiler Design Question 4 Detailed Solution

The correct answer is 27

Explanation:

Total number of tokens = 4 + 1 + 9 + 9 + 3 + 1 = 27 tokens

Compiler Design Question 5:

Arrange the following stages of the lexical analysis process in the correct order: A. Token classification
B. Tokenization
C. Input preprocessing
D. Output generation
E. Token validation

1. C, B, A, E, D
2. B, C, A, E, D
3. C, B, E, A, D
4. A, B, C, E, D

Answer (Detailed Solution Below)

Compiler Design Question 5 Detailed Solution

The correct answer is C, B, A, E, D

Key Points

• C (Input preprocessing): This stage involves cleaning up the input text.
• B (Tokenization): This breaks the input text into a sequence of tokens.
• A (Token classification): The lexer determines the type of each token.
• E (Token validation): The lexer checks the validity of each token according to the language rules.
• D (Output generation): The lexer generates the output list of tokens to be used in the next stage of compilation.

Top Compiler Design MCQ Objective Questions

Compiler Design Question 6

1. Command Language
2. Machine Language
3. Markup Language
4. Style Sheet Language

Answer (Detailed Solution Below)

Compiler Design Question 6 Detailed Solution

Programs written in high-level languages are translated into assembly language or machine language by a compiler. Every CPU has its unique machine language.

Share on Whatsapp

Compiler Design Question 7

Answer (Detailed Solution Below)

Compiler Design Question 7 Detailed Solution

Concept:

A token is a sequence of characters that can be treated as a unit in the grammar of the programming languages.

Lexical Analysis is the first phase of compiler also known as scanner. It converts the High level input program into a sequence of Tokens.

Explanation

Analysing the given code for tokens, we get

Counting all the boxes, the total number of tokens comes out to be 26.

Important Point:

• Everything inside doubts quotes “ ” in a print() statements is counted as a single token.

For example, printf(“Testbook has tests for GATE, ISRO, etc.”); has 5 tokens.

printf, (, “Testbook has tests for GATE, ISRO, etc.”, ), and ;

• Increment ++ and Decrement -- are considered as single token each.

Share on Whatsapp

Compiler Design Question 8

1. P – i, Q – ii, R – iv, S - iii
2. P – iii, Q – i, R – ii, S - iv
3. P – ii, Q – iii, R – I, S - iv
4. P – iv, Q – I, R – ii, S - iii

Answer (Detailed Solution Below)

Compiler Design Question 8 Detailed Solution

Lexical analysis: Lexical analysis is the first phase of a compiler. It takes the modified source code from language pre-processors that are written in the form of sentences. Lexical analyser breaks these syntaxes into a series of tokens. Lexical analysis uses regular expression to recognize identifiers.

Top down parsing: Top down parsing technique parses the input by starts constructing a parse tree from the root node moving down to the leaf nodes. Top down parser uses the left most derivation to generate the string.

Semantic analysis: Semantic analysis is the task of ensuring that declarations and statements of a program are semantically correct. For this, it uses type casting.

Run time environments: Run time environment is a state of the target machine, which may include software libraries, environment variables etc. to provide services to the processes running in the system. Activation records of a function are loaded into stack at runtime.