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. __________ are used to keep track of memory locations where the values of identifiers are stored.

Register descriptor
Address descriptor
Both A and B
None of the above

2. System program such a compiler are designed so that they are ________

Re-enterable
Non-Usable
Serially usable
None of the above

3. How many alphabets are there in Binary language?

2
3
4
5

4. In parse tree, leaf nodes are called?

terminals
non-terminals
sub-terminals
half-terminals

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

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

7. If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________

Non-regular
Equal
Infinite
Regular

8. The output of an assembler is called?

data file
task file
object file
program file

9. In finite automata, Q stands for?

Finite set of input symbols
Transition function
Finite set of states
One Start state

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

Access Stack
Control stack
Formal Stack
Return Stack

Results