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. Relocation is the process of replacing symbolic references or names of libraries with actual usable addresses in memory before running a program.

TRUE
FALSE
Can be true or false
Can not say

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

Domain grammer
Attribute grammar
Object grammer
Value grammer

3. Which of the following is used to link all the parts of the program together for execution?

loader
linker
memory
preprocessor

4. What is true about Attribute Grammar?

Attribute grammar is a special form of context-free grammar
Each attribute has well-defined domain of values
The right part of the CFG contains the semantic rules
All of the above

5. In ___________________, if one derivation of a production fails, the syntax analyzer restarts the process using different rules of same production

Bottom-up Parsing
Recursive descent parsing
Backtracking
All of the above

6. Union of two languages L and M is written as?

LM = {st | s is in L and t is in M}
L+M
L*M
L U M = {s | s is in L or s is in M}

7. If an error occurs, what interpreter do?

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

8. Which of them are not left associative?

*
|
plus(+)
.

9. What will be error?

7 = x + y;

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

10. Optimization can be categorized broadly into ____ types.

2
3
4
5

Results