Recent Articles

Compiler Design MCQ Quiz

  1. A optimizing compiler
  2. Which of the following actions an operator precedence parser may take to recover from an error?
  3. Shift reduce parsers are
  4. Which of the following is used for grouping of characters into tokens?
  5. In a compiler, keywords of a language are recognized during -
  6. Compiler translates the source code to
  7. What is the output of lexical analyzer?
  8. How many parts of compiler are there?
  9. ......................is a process of finding a parse tree for a string of tokens.
  10. Compiler can check ________ error.
  11. ......................is the most general phase structured grammar.
  12. A _________ is a software utility that translates code written in higher language into a low level language.
  13. The graph that shows basic blocks and their successor relationship is called
  14. When a computer is first turned on or resrarted, a special type of absolute loader is executed called
Last Updated: May 21, 2021,
Posted in Interview Questions,
36 Questions
Compiler Design MCQ

Take Compiler Design MCQ Quiz to Test Your Knowledge 

We have listed below the best Compiler Design MCQ Questions, that checks your basic knowledge of Compiler Design. This Compiler Design MCQ Test contains 25+ most popular multiple-choice questions. You have to select the right answer to every question to check your final preparation. apart from this, You can also download below the Compiler Design MCQ PDF completely free.

  • Is optimized to take less time for execution
  • Optimized the code
  • Is optimized to occupy less space
  • None of the mentioned
View Answer
  • Delete symbols from the stack
  • Insert symbols onto the stack
  • Inserting or deleting symbols from the input
  • All of the mentioned
View Answer
  • Bottom up parser
  • Top down parser
  • Top down parserMaybe both
  • None of the mentioned
View Answer
  • Parser
  • Code generator
  • Lexical analyser
  • Code generator
View Answer
  • the code generation
  • parsing of the program
  • the lexical analysis of the program
  • dataflow analysis
Download Free : Compiler Design MCQ PDF
View Answer
  • Machine code
  • Binary code
  • Executable code
  • Both 1 and 2
View Answer
  • A list of tokens
  • Intermediate code
  • A parse tree
  • Machine code
View Answer
  • 8
  • 4
  • 2
  • 1
View Answer
  • Analysing
  • Recognizing
  • Tokenizing
  • Parsing
View Answer
  • Syntax
  • Content
  • Logical
  • Both A and B
Read Best: Compiler Design Interview Questions
View Answer
  • Regular
  • Context free
  • Context sensitive
  • All of these
View Answer
  • Text editor
  • Compiler
  • Converter
  • Code optimizer
View Answer
  • Flow graph
  • control graph
  • Hamiltonion graph
  • DAG
View Answer
  • Boot strap loader
  • " Compile and GO " loader
  • Relating loader
  • Boot loader
View Answer
  • Boot strap loader
  • " Compile and GO " loader
  • Relating loader
  • Boot loader
Download Free: Compiler Design Interview Questions PDF
View Answer
  • consists of a program and relevant information for its relocation
  • cannot be made to execute in any area of storage other than the one designated for it at the time of its coding or translation
  • can itself perform the relocation of its address sensitive portions
  • all of these
View Answer
  • entire data to be displayed
  • full data display on full area of screen
  • a part of data to be displayed
  • no data to be displayed
View Answer
  • identifier table
  • literal table
  • terminal table
  • source code
View Answer
  • Operator - precedence
  • LALR
  • SLR
  • Canonical LR
View Answer
  • A list of tokens
  • A parse tree
  • Intermediate code
  • Machine code
View Answer
  • brain tuning in to select information
  • brain's ability to integrate several stimuli simultaneously
  • brain's use of incoming signals to construct perceptions
  • brain imposing its own structure on incoming information based on previous experience
View Answer
  • Program
  • Source code
  • Object code
  • Linked code
View Answer
  • Object file
  • Byte Code
  • Library files
  • Executable files
View Answer
  • Parse tree
  • Source code
  • Symbol table
  • Object program
View Answer
  • load-time binding
  • interrupt binding
  • compile-time binding
  • execution-time binding
View Answer
  • dataflow analysis
  • the code generation
  • parsing of the program
  • the lexical analysis of the program
View Answer
  • static and final
  • final and abstract
  • static and abstract
  • All of the Above
View Answer
  • A parse tree
  • Intermediate code
  • Machine code
  • A stream of tokens
View Answer
  • A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end
  • Available expression analysis can be used for common subexpression elimination
  • Live variable analysis can be used for dead code elimination
  • x = 4 ∗ 5 => x = 20 is an example of common subexpression elimination
View Answer
  • Instructions and data in binary
  • Serial number of the CPU
  • Instructions and data in human readable form
  • Instructions and data in assembly code mnemonics
View Answer
  • annotated parse tree
  • syntax tree
  • semantic tree
  • all of the above
View Answer
  • Maintain Symbol Table
  • Collect type of information
  • Create parse tree
  • None of the mentioned
View Answer
Related Interview Questions
Subscribe Our NewsLetter

Never Miss an Articles from us.

Featured Categories