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

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

3. Lexical analysis is the _______ phase of a compiler

first
second
third
fourth

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

Recursive descent parsing
Backtracking
Top-down Parsing
Bottom-up Parsing

5. Does compiler reads the whole source code at once?

Yes
No
Depends on compiler
Don't know

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

7. A set of tokens, known as?

non-terminals
terminal symbols
productions 
start symbol

8. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

Removing left recursion only
Factoring the grammar alone
Factoring & left recursion removal
None of the above

9. Which of the following called left side of the production?

production consists of a non-terminal
sequence of tokens and/or on- terminals
Both A and B
None of the above

10. In how many types parsing is divided?

2
3
4
5

Results