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. _________ of FA are represented by circles

States
Start state
Intermediate states
Transition

2. Peep-hole optimization is a form of 

loop optimization
local optimization
data flow analysis
constant folding 

3. Before generating intermediate code, the compiler can modify the intermediate code by address calculations and improving loops.

TRUE
FALSE
Can be true or false
Can not say

4. Which of the following called left side of the production?

production consists of a non-terminal
sequence of tokens and/or on- terminals
Both A and B
None of the above

5. The grammar defined by regular expressions is known as?

regular language
regular grammar
regular notations
regular operation

6. Dead code plays no role in any program operation and therefore it can simply be eliminated.

TRUE
FALSE
Can be true or false
Can not say

7. The basic limitation of finite automata is that

it can’t remember arbitrary large amount of information
it sometimes recognize grammar that are not regular
it sometimes fails to recognize regular grammar
None of the above

8. A procedure has a start and an end delimiter and everything inside it is called the body of the procedure.

TRUE
FALSE
A procedure has a start with delimiter but not end with delimiter.
A procedure has a not start with delimiter but end with delimiter.

9. Language of finite automata is

Type 0
Type 1
Type 2
Type 3

10. The language defined by regular grammar is known as?

regular language
regular grammar
regular notations
regular operation

Results