0% found this document useful (0 votes)
175 views3 pages

Automata and Compiler Design

The document contains a list of multiple choice questions about compiler design topics like compiler phases, lexical analysis, parsing, code generation, and error handling. Specifically, it asks about the definition of a cross-compiler, parts of a Lex specification, the role of the lexical analyzer, language processors, phases of compilation not including booting, capabilities of compilers to detect errors, tasks of lexical analysis, and characteristics of an ideal compiler.

Uploaded by

Ramya Krishna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
175 views3 pages

Automata and Compiler Design

The document contains a list of multiple choice questions about compiler design topics like compiler phases, lexical analysis, parsing, code generation, and error handling. Specifically, it asks about the definition of a cross-compiler, parts of a Lex specification, the role of the lexical analyzer, language processors, phases of compilation not including booting, capabilities of compilers to detect errors, tasks of lexical analysis, and characteristics of an ideal compiler.

Uploaded by

Ramya Krishna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

[Link].

com

Automata and Compiler Design 276) The capacity of a language to compile itself is called as a) cross-compiler b) compiler c) bootstrapping d) all

277) A compiler which runs on one machine and produces target code for another machine is called a) crisp-compiler b)compact-compiler c) overlap compiler d)cross-compiler

278) Error handler is attached to a) All the phases of the compiler c) No phases b) few phases of the compiler d) the symbol table

279) Intermediate code generation and code generation phases of a compiler gives a) The same result b) different result c) no result d) none

280) The number of phases in the compiler are a) 6 b) 5 c) any number

281) The regular expression a* denotes a) Set of all strings of one or more number of as b) set of all strings of zero or more number of as c) set of all strings of two consecutive as d) all the above

282) A Lex specification consists of ______________ parts a) 2

283) Which of the is called as the lexical analyzer generator a) parser-generator c) lex compiler b) compiler construction tool d) compiler-compiler

T N
b) 3

W U

R O
c) 4

D L
d) 7 d) 5

284) The sequence of characters in the program that is matched by the pattern for a token is known as a) token string b) lexeme c) sentinel d) identifier

285) Which of the following are language processors? a) assemblers b) compilers c) interpreters d) all of the above

286) A translator is best described as a) application software b) system software c) a hardware component d) none

[Link]

[Link]

287. Which of the following is not a phase of compilation process a) booting b) optimizing c) parsing d) scanning

288. A Compiler 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) Accept a program written in a high level language and produces an object program d) Appears to execute a source a source program as if it were machine language. 289. Compilers can diagnose a) Grammatical errors only c) Grammatical as well as logical errors 290. Lexical analysis helps in a) Simpler design of compiler c) Enhancing compiler portability b) Logical errors only d) Neither grammatical not logical

b) Improving efficiency of compiler d) All the above

291. The task of the lexical analysis phase is

a) To parse the source program into the basic elements or tokens of the language. b) To build a literal table and an identifier table c) To build an uniform symbol table d) All of these 292. Which is the permanent database in the general model of a compiler? a) literal table b) Identifier table c) terminal table d) reductions 293. An ideal compiler should a) Be smaller in size and take less time for compiling b) Be written in a high level language c) Produce object code that is smaller in size and executes faster d) All the above 294. Semantic errors can be detected a) at compile time only c) both at compile time and at run time 295. Type checker checks for a) incompatible operand c) uniqueness of the object

T N

W U

R O

D L

b) at run time only d) none

b) flow of control d) all the above

[Link]

[Link]

296. A symbol that has different meanings depending on its content is said to be a) Polymorphic b) inherited c) extended d) overloaded 297. Which procedure when called allows the execution of statements in its body with arguments of different types? a) Open procedure b) macro c) polymorphic procedure d) all

T N

W U

R O

D L

[Link]

You might also like