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. Languages of a automata is

If it halts
If it is accepted by automata
If automata touch final state in its life time
All language are language of automata

2. A fragment of code that resides in the loop and computes the same value at each iteration is called a?

Induction analysis
Strength reduction
loop-invariant code
None of the above

3. In Directed Acyclic Graph, Leaf nodes represent?

identifiers
names 
constants
All of the above

4. Which of the following is true?

In Short Syntax Analysis Generates Parse Tree.
Syntax analyser does not check the type of the operand.
Symbol table is created by the compiler which contains the list of lexemes or tokens.
All of the above

5. The language defined by regular grammar is known as?

regular language
regular grammar
regular notations
regular operation

6. Which of the following known as the text part of a program that does not change at runtime. Its memory requirements are known at the compile time?

Code
Procedures 
Variables 
All of the above

7. Language of finite automata is

Type 0
Type 1
Type 2
Type 3

8. Semantic analyzer attaches attribute information with AST, which are called?

Analyzer attribute
Attributed AST
Analyzer AST
AST

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

10. Type checking is normally done during ____________

Lexical Analysis
Syntax Analysis
Syntax Directed Translation
Code generation

Results