The linker is a program used to link different pieces of code, modules in order to obtain an executable code. ...

2. What is an assembler?

An assembler is a program used to convert assembly language into machine language. ...

3. What is code optimization in compiler design?

In code optimization the code is improvised that is it is optimized so that it can use fewer resources and time while execution. ...

4. What is Lexical Analysis?

Lexical analysis is the first phase of compiler designing which takes the source code from the input and breaks it into tokens by removing whitespaces and special characters. ...

5. What is Symbol Table in Compiler?

In compiler design, the Symbol table is an important data structure created and maintained by compilers in order to store and track information about the occurrence of various entities such as variable names, function names, objects, classes, interfa ...

6. Explain three address code in Compiler?

Three address code is an intermediate code that can be easily generated and converted to machine code. It uses at most three addresses and one operator to represent an expression. The value computed at each instruction is stored in a temporary variab ...

7. What is BNF Notation?

BNF stands for Backus-Naur Form which is used to write a formal representation of context-free grammar. It is a variant of context-free grammar. ...

8. What is a garbage is in compiler design?

The resources in memory that will never be accessed after a certain time and is of no use are known as garbage value. ...

9. What does LR stands for in compiler design?

LR stands for L- left to right and R- rightmost derivation in reverse parsing. It is used for parsing the large class of grammars. ...

10. Explain Context free grammar?

CFG or Context-Free Grammar is used to generate all possible strings in a formal language. It can be defined by four tuples, G= (V, T, P, S). ...

03rd
Feb

Compiler Design MCQ

Admin
03rd Feb, 2023
820 Followers

Compiler Design MCQ PDF
Compiler Design MCQ Questions
Compiler Design MCQ PDF

Compiler Design MCQ Questions

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
15. When a computer is first turned on or resrarted, a special type of absolute loader is executed called
16. A self-relocating program is one which
17. Scissoring enables -
18. which is the permanent data base in the geneal model of Compiler ?
19. which of the following parsers is the most powerful ?
20. What is the output of lexical analyzer?

Take Compiler Design MCQ Quiz to Test Your Knowledge

Practice here the best 35+ Compiler Design MCQ Questions, that check your basic knowledge of Compiler Design. These MCQs are written by industry experts & asked mostly during compiler design jobs & interviews.

Compiler Design MCQ

1) A optimizing compiler

A. Is optimized to take less time for execution
B.Optimized the code
C.Is optimized to occupy less space
D.None of the mentioned

2) Which of the following actions an operator precedence parser may take to recover from an error?

A. Delete symbols from the stack
B.Insert symbols onto the stack
C.Inserting or deleting symbols from the input
D.All of the mentioned

3) Shift reduce parsers are

A. Bottom up parser
B.Top down parser
C.Top down parserMaybe both
D.None of the mentioned

4) Which of the following is used for grouping of characters into tokens?

A. Parser
B.Code generator
C.Lexical analyser
D.Code generator

5) In a compiler, keywords of a language are recognized during -

A. the code generation
B.parsing of the program
C.the lexical analysis of the program
D.dataflow analysis

Download Free : Compiler Design MCQ PDF

6) Compiler translates the source code to

A. Machine code
B.Binary code
C.Executable code
D.Both 1 and 2

7) What is the output of lexical analyzer?

A. A list of tokens
B.Intermediate code
C.A parse tree
D.Machine code

8) How many parts of compiler are there?

A. 8
B.4
C.2
D.1

9) ......................is a process of finding a parse tree for a string of tokens.

A. Analysing
B.Recognizing
C.Tokenizing
D.Parsing

10) Compiler can check ________ error.

A. Syntax
B.Content
C.Logical
D.Both A and B

Read Best: Compiler Design Interview Questions

11) ......................is the most general phase structured grammar.

A. Regular
B.Context free
C.Context sensitive
D.All of these

12) A _________ is a software utility that translates code written in higher language into a low level language.

A. Text editor
B.Compiler
C.Converter
D.Code optimizer

13) The graph that shows basic blocks and their successor relationship is called

A. Flow graph
B.control graph
C.Hamiltonion graph
D.DAG

14) When a computer is first turned on or resrarted, a special type of absolute loader is executed called

A. Boot strap loader
B." Compile and GO " loader
C.Relating loader
D.Boot loader

15) When a computer is first turned on or resrarted, a special type of absolute loader is executed called

A. Boot strap loader
B." Compile and GO " loader
C.Relating loader
D.Boot loader

Download Free: Compiler Design Interview Questions PDF

16) A self-relocating program is one which

A. consists of a program and relevant information for its relocation
B.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
C.can itself perform the relocation of its address sensitive portions
D.all of these

17) Scissoring enables -

A. entire data to be displayed
B.full data display on full area of screen
C.a part of data to be displayed
D.no data to be displayed

18) which is the permanent data base in the geneal model of Compiler ?

A. identifier table
B.literal table
C.terminal table
D.source code

19) which of the following parsers is the most powerful ?

A. Operator - precedence
B.LALR
C.SLR
D.Canonical LR

20) What is the output of lexical analyzer?

A. A list of tokens
B.A parse tree
C.Intermediate code
D.Machine code

21) The literal definition of a word is also called its ______.

A. Details
B.Denotation
C.Diction
D.None of above

22) Bottom-up processing involves the .................

A. brain tuning in to select information
B.brain's ability to integrate several stimuli simultaneously
C.brain's use of incoming signals to construct perceptions
D.brain imposing its own structure on incoming information based on previous experience

23) The output of the compiler is called ................

A. Program
B.Source code
C.Object code
D.Linked code

24) Java compiler translates java source code into ________.

A. Object file
B.Byte Code
C.Library files
D.Executable files

25) The process by which program code is converted into machine language is called ................

A. execution
B.compilation
C.documentation
D.variable declaration

26) which of the following is not constructed by a typical compiler?

A. Parse tree
B.Source code
C.Symbol table
D.Object program

27) A(n) ________ is a set of instructions that the computer follows to solve a problem.

A. Linker
B.Program
C.Operator
D.Compiler

28) Absolute code can be generated for ..................

A. load-time binding
B.interrupt binding
C.compile-time binding
D.execution-time binding

29) In a compiler keywords of a language are recognized during .................

A. dataflow analysis
B.the code generation
C.parsing of the program
D.the lexical analysis of the program

30) which of the following two keywords cannot come together when declaring a method ..............

A. static and final
B.final and abstract
C.static and abstract
D.All of the Above

31) The Output Of A Lexical Analyzer Is

A. A parse tree
B.Intermediate code
C.Machine code
D.A stream of tokens

32) Which One Of The Following Is FALSE?

A. A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end
B.Available expression analysis can be used for common subexpression elimination
C.Live variable analysis can be used for dead code elimination
D.x = 4 ∗ 5 => x = 20 is an example of common subexpression elimination