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

bottom-up parsing
top-down parsing
Both A and B
None of the above

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

TRUE
FALSE
Can be true or false
Can not say

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

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. There are ________ tuples in finite state machine

3
4
5
6

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

loader
linker
memory
preprocessor

7. A variable is called an _________ variable if its value is altered within the loop by a loop-invariant value.

Invariant 
induction
strength 
loop

8. Code generator uses ______ function to determine the status of available registers and the location of name values.

setReg
cinReg
pfReg
getReg

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

10. Which of the following are Limitations of Syntax Analyzers?

it cannot determine if a token is valid,
it cannot determine if a token is declared before it is being used,
it cannot determine if an operation performed on a token type is valid or not.
All of the above

Results