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. How many types of parsing are there?

2
3
4
5

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

local optimization
loop optimization
constant folding
None of the above

3. Language of finite automata is

Type 0
Type 1
Type 2
Type 3

4. 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

5. What will be error?

7 = x + y;

l-value error
r-value error
Infinite loop
Both A and B

6. There are ________ tuples in finite state machine

3
4
5
6

7. ____________ is a medium to provide semantics to the context-free grammar

Domain grammer
Attribute grammar
Object grammer
Value grammer

8. _________ of FA are represented by circles

States
Start state
Intermediate states
Transition

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

regular language
regular grammar
regular notations
regular operation

10. Semantic analyzer attaches attribute information with AST, which are called?

Analyzer attribute
Attributed AST
Analyzer AST
AST

Results