[Solved] In a compiler, keywords of a language are recognized during

Q.	In a compiler, keywords of a language are recognized during
A.	parsing of the program
B.	the code generation
C.	the lexical analysis of the program
D.	dataflow analysis
Answer» C. the lexical analysis of the program

2.1k

Do you find this helpful?

View all MCQs in

Theory of Computation and Compiler Design

Discussion

No comments yet

Related MCQs

Incremental-Compiler is a compiler
Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L’ (complement of L) also context-free? 3) If L is a regular language, then is L’ also regular? 4) If L is a recursive language, then, is L’ also recursive?
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?
Which of the following are decidable ? 1. whether the intersection of two regular language is infinite. 2. whether a give context free language is regular 3. whether two push down automata accept the same language. 4. whether a given grammar is context free
Consider the following statements related to compiler construction : I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata. II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine. Which of the above statement(s) is/are correct?
In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction?
Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?
Consider the following two statements: S1: { 0^2n |n >= l} is a regu1ar language S2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regu1ar language Which of the following statements is correct?
Which of the following are decidable? I. Whether the intersection of two regular languages is infinite II. Whether a given context-free language is regular III. Whether two push-down automata accept the same language IV. Whether a given grammar is context-free