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. _______ is a program that converts high-level language to assembly language.

assembler
compiler
interpreter
linker

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. If an error occurs, what interpreter do?

terminate program
stops execution
reads the whole program even if it encounters errors
give warning

4. Which of the following is NOT the set of regular expression R = (ab + abb)* bbab?

ababbbbab
abbbab
ababbabbbab
abababab

5. Which of the following is a graphical depiction of a derivation?

Derivation Tree
Analyzers Tree
Parse Tree
Ambiguity Tree

6. In activation record, Which of the following Stores the address of activation record of the caller procedure?

Access Link
Actual Parameters
Control Link
Temporaries

7. In the input file, In which section Anything written in this brackets is copied directly to the file lex.yy.c?

Rules Section
Definition Section
User Code Section
None of the above

8. In analyzing the compilation of PL/I program, the term Machine independent optimization is assosiated with

creation of more optical matrix
recognition of basic elements and creation of uniform symbols
recognization of basic syntactic construction through reductionsc
use of macro-processor to produce more optimal assembly code

9. What will be error?

7 = x + y;

l-value error
r-value error
Infinite loop
Both A and B

10. Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

40
80
120
160

Results