Compiler Design Quiz


Play this quiz that will help you to excel in Compiler Design certification exams, placements etc. This Compiler Design quiz consist of 10 questions that you need to solve in 10 minutes. We’ve specially designed this quiz so that you can quickly acquaint to the pattern of questions you can be asked in placement drives, certification exams etc. This test enables you to assess your knowledge of Compiler Design.

Take the Free Practice Test



Compiler Design MCQs

Practice Compiler Design MCQ Questions, which will help you to understand compiler related concepts and also helps you to prepare for placements, technical rounds, interviews, competitive exams etc.

Compiler Design Quiz

Try Free Compiler Design Quiz, to start a quiz you need to login first, after login you will get start quiz button and then by clicking on that you can start quiz. You will get 10 Minutes to answer all questions.

Compiler Design Quiz

1. Which of the following is true?

In Short Syntax Analysis Generates Parse Tree.
Syntax analyser does not check the type of the operand.
Symbol table is created by the compiler which contains the list of lexemes or tokens.
All of the above

2. What is true about Syntax Directed Definitions?

Syntax Directed Definitions + Semantic rules = CFG
Syntax Directed Definitions + CFG = Semantic rules
CFG + Semantic rules = Syntax Directed Definitions
None of the above

3. In Directed Acyclic Graph, Leaf nodes represent?

identifiers
names 
constants
All of the above

4. Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.

n1 is necessarily less than n2
n1 is necessarily equal to n2
n1 is necessarily greater than n2
None of the above

5. Substitution of values for names whose values are constant, is done in

local optimization
loop optimization
constant folding
None of the above

6. Which of the following error is expected to recognize by semantic analyzer?

Type mismatch
Undeclared variable
Reserved identifier misuse.
All of the above

7. A variable is called an _________ variable if its value is altered within the loop by a loop-invariant value.

Invariant 
induction
strength 
loop

8. Which of the following is a graphical depiction of a derivation?

Derivation Tree
Analyzers Tree
Parse Tree
Ambiguity Tree

9. Which of the following known as the text part of a program that does not change at runtime. Its memory requirements are known at the compile time?

Code
Procedures 
Variables 
All of the above

10. The following code is an example of?

void add_ten(int x)
{
   return x + 10;
   printf(""value of x is %d"", x);
}

Redundant instruction elimination
Unreachable code
Flow of control optimization
None of the above

Results