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. Code generation can be considered as the?

first phase of compilation
second phase of compilation
third phase of compilation
final phase of compilation

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

Domain grammer
Attribute grammar
Object grammer
Value grammer

3. Whenever a procedure is executed, its activation record is stored on the stack, also known as?

Access Stack
Control stack
Formal Stack
Return Stack

4. When the parser starts constructing the parse tree from the start symbol and then tries to transform the start symbol to the input, it is called?

Recursive descent parsing
Backtracking
Top-down Parsing
Bottom-up Parsing

5. _______ is a program that converts high-level language to assembly language.

assembler
compiler
interpreter
linker

6. Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

40
80
120
160

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. Which of the following tasks should be performed in semantic analysis?

Scope resolution
Type checking
Array-bound checking
All of the above

9. There are ________ tuples in finite state machine

3
4
5
6

10. How many types of parsing are there?

2
3
4
5

Results