Compiler Design Set 1

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Free Online Best Compiler Design MCQ Questions for improve your basic knowledge of Compiler Design. This Compiler Design set 1 test that contains 25 Multiple Choice Questions with 4 options. You have to select the right answer to a question.

Start

Congratulations - you have completed Compiler Design Set 1.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1

Which concept of FSA is used in the compiler?

A	Lexical analysis
B	Parser
C	Code generation
D	Code optimization

Question 2

Which concept of grammar is used in the compiler?

A	Lexical analysis
B	Parser
C	Code generation
D	Code optimization

Question 3

The graph that shows the basic blocks and their successor relationship is called______

A	Hamiltonian graph
B	Control graph
C	Flow graph
D	DAG

Question 4

Which of the following are Lexemes?

A	Identifiers
B	Constants
C	Keywords
D	All of Above

Question 5

Which of the following symbol table implementation has the minimum access time?

A	Self-organizing list
B	Linear
C	Search tree
D	Hash table

Question 6

Interpreter is preferred over a compiler is____

A	During program development phase
B	When storage space is to be minimized
C	When efficient use of computer resources is the consideration
D	All of Above

Question 7

Compiler is a program that______

A	Accepts a program written in a high level language and produces an object program
B	Appears to execute a source program as if it were machine language
C	Automates the translation of assembly language into machine language
D	Places programs into memory and prepares them for execution

Question 8

A compiler for a high-level language that runs on one machine and produces code for a different machine is called ___________

A	Optimizing compiler
B	One pass compiler
C	Cross compiler
D	Multipass compiler

Question 9

A compiler which allows only the modified section of the source code to be recompiled is called___

A	Subjective compiler
B	Dynamic compiler
C	Re-configurable compiler
D	Incremental compiler

Question 10

A system program that combines separately compiled modules of a program into a form suitable for execution is called ___________

A	Assembler
B	Linking loader
C	Cross compiler
D	None of Above

Question 11

____ or scanning is the process, where the stream of characters making up the source program is read from left to right and grouped into tokens.

A	Modeling
B	Diversion
C	Lexical analysis
D	All of Above

Question 12

All ___________ are automatically treated as regular expressions.

A	Programmatic description
B	Window
C	Win Object
D	Collection

Question 13

Compiler should report the presence of __________ in the source program, in translation process.

A	Classes
B	Objects
C	Errors
D	Text

Question 14

Compiler translates the source code to_____

A	Executable code
B	Machine code
C	Binary code
D	Both B and C

Question 15

An optimizing compiler______

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

Question 16

What is the output of lexical analyzer?

A	A set of RE
B	Syntax Tree
C	Set of Tokens
D	String Character

Question 17

A compiler for a high level language that runs on one machine and produce code for different machine is called______

A	One pass compiler
B	multipass compiler
C	croos compiler
D	optimizing compiler

Question 18

Which table is a permanent database that has an entry for each terminal symbol?

A	Reductions
B	Identifier table
C	Literal table
D	Terminal table

Question 19

Which symbol table implementation is based on the property of locality of reference?

A	Linear list
B	Search tree
C	Hash Table
D	Self Organisation

Question 20

A compiler is preferable to an interpreter because____

A	Debugging can be faster and easier
B	If one changes a statement, only that statement needs re-compilation
C	It is much helpful in the initial stages of program development
D	It can generate stand alone programs that often take less time for execution

Question 21

An optimizer Compiler __________

A	Is optimized to occupy less space
B	Is optimized to occupy less space & Optimize the code
C	Optimize the code
D	None of Above

Question 22

Loader is a program that_____

A	Places programs into memory and prepares them for execution
B	Automates the translation of assembly language into machine language
C	Accepts a program written in a high level language and produces an object program
D	Appears to execute a source program as if it were machine language

Question 23

Which of the following groups is/are token together into semantic structures?

A	Syntax analyzer
B	Intermediate code generation
C	Lexical analyzer
D	Semantic analyzer

Question 24

What is the output of lexical analyzer?

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

Question 25

The action of parsing the source program into proper syntactic classes is called___

A	General syntax analysis
B	Interpretation analysis
C	Syntax analysis
D	Lexical analysis

Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results

There are 25 questions to complete.

←

List

→

Return

Shaded items are complete.

1	2	3	4	5
6	7	8	9	10
11	12	13	14	15
16	17	18	19	20
21	22	23	24	25
End

Return

NEXT SET 2

Study Zone

MCQ » Compiler Design Set 1

Compiler Design Set 1

Important Links