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

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

3. When the lexical analyzer read the source-code, it scans the code?

line by line
word by word
letter by letter
reads the whole program

4. What is true about Syntax Directed Definitions?

Syntax Directed Definitions + Semantic rules = CFG
Syntax Directed Definitions + CFG = Semantic rules
CFG + Semantic rules = Syntax Directed Definitions
None of the above

5. the predictive parser puts some constraints on the grammar and accepts only a class of grammar known as LL(k) grammar.

TRUE
FALSE
Can be true or false
Can not say

6. Which of the following derivations does a top-down parser use while parsing an input string?

Leftmost derivation
Leftmost derivation in reverse
Rightmost derivation
Rightmost derivation in reverse

7. The following code is an example of?

void add_ten(int x)
{
   return x + 10;
   printf(""value of x is %d"", x);
}

Redundant instruction elimination
Unreachable code
Flow of control optimization
None of the above

8. What will be error?

7 = x + y;

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

9. How many arrow does intermediate states have?

1
2
3
4

10. In Final state, The number of odd arrows are one greater than even, i.e. odd = even+1?

TRUE
FALSE
Can be true or false
Can not say

Results