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

2. Which of the following is not a form of Intermediate representation?

Abstract Syntax Tree
3-address code
Directed cyclic Graph
Reverse Polish Notation

3. How many descriptors are used for track both the registers (for availability) and addresses (location of values) while generating the code?

2
3
4
5

4. In parse tree, leaf nodes are called?

terminals
non-terminals
sub-terminals
half-terminals

5. Optimization can be categorized broadly into ____ types.

2
3
4
5

6. If the lexical analyzer finds a token invalid then?

it generates an exception
it generates an warning
it generates an error
reads the whole program

7. A compiler for a high-level language that runs on one machine and produces code for a different machine is called

optimizing compiler
one pass compiler
cross compiler
multipass compiler

8. The location of memory (address) where an expression is stored is known?

r-value
k-value
l-value
t-value

9. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion only
Factoring the grammar alone
Factoring & left recursion removal
None of the above

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

Results