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.

Introduction to Compiler Design

Bestseller by udemy

Learn all phases of Compiler Construction in a very easy & simple approach by enrolling in this course.

3 Hours
Paid

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. x * 2 can be replaced by x << 1 is an example of?

Algebraic expression simplification
Accessing machine instructions
Strength reduction
Code Generator

3. In Directed Acyclic Graph, Leaf nodes represent?

identifiers
names 
constants
All of the above

4. A set of tokens, known as?

non-terminals
terminal symbols
productions 
start symbol

5. If an error occurs, what compiler do?

terminate program
stops execution
reads the whole program even if it encounters errors
give warning

6. Lexical analysis is the _______ phase of a compiler

first
second
third
fourth

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

local optimization
loop optimization
constant folding
None of the above

8. How many alphabets are there in Binary language?

2
3
4
5

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

Derivation Tree
Analyzers Tree
Parse Tree
Ambiguity Tree

10. How many descriptors are used for track both the registers (for availability) and addresses (location of values) while generating the code?

2
3
4
5

Results