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. Peep-hole optimization is a form of 

loop optimization
local optimization
data flow analysis
constant folding 

2. What is true about Syntax Directed Definitions?

Syntax Directed Definitions + Semantic rules = CFG
Syntax Directed Definitions + CFG = Semantic rules
CFG + Semantic rules = Syntax Directed Definitions
None of the above

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

4. A set of tokens, known as?

non-terminals
terminal symbols
productions 
start symbol

5. _________ of FA are represented by circles

States
Start state
Intermediate states
Transition

6. What is meant by compositional semantics?

Determining the meaning
Logical connectives
Semantics
All of the above

7. Which form of SDT uses both synthesized and inherited attributes with restriction of not taking values from right siblings?

T-attributed SDT
A-attributed SDT
S-attributed SDT
L-attributed SDT

8. _______ is a program that converts high-level language to assembly language.

assembler
compiler
interpreter
linker

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

10. The function ________ is automatically generated by the flex when it is provided with a .l file

flex()
yylex()
lex()
nnlex()

Results