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 lexical analyzer read the source-code, it scans the code?

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

2. ____________ is a medium to provide semantics to the context-free grammar

Domain grammer
Attribute grammar
Object grammer
Value grammer

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

setReg
cinReg
pfReg
getReg

4. How many components context-free grammar has?

2
3
4
5

5. How many arrow does intermediate states have?

1
2
3
4

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

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

7. In parse tree, leaf nodes are called?

terminals
non-terminals
sub-terminals
half-terminals

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

Non-regular
Equal
Infinite
Regular

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

10. In finite automata, Q stands for?

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

Results