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.

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. A form of recursive-descent parsing that does not require any back-tracking is known as?

predictive parsing
non-predictive parsing
recursive parsing
non-recursive parsing

2. Which of the following is true?

In Short Syntax Analysis Generates Parse Tree.
Syntax analyser does not check the type of the operand.
Symbol table is created by the compiler which contains the list of lexemes or tokens.
All of the above

3. The compiler can make use of memory hierarchy and CPU registers.

Can be true or false
Can not say

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

5. How many arrow does intermediate states have?


6. Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.

L = {aaaa,aabb,bbaa,bbbb}
L = {abab,abaa,aaab,baaa}
L = {aaab,baba,bbaa,bbbb}
L = {aaaa,abab,bbaa,aaab}

7. _________ of FA are represented by circles

Start state
Intermediate states

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

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

Can be true or false
Can not say

10. What is meant by compositional semantics?

Determining the meaning
Logical connectives
All of the above