Questions & Answers of Lexical analysis

Question No. 129

Match the following:

(P) Lexical analysis (i) Leftmost derivation
(Q) Top down parsing (ii) Type checking
(R) Semantic analysis (iii) Regular expressions
(S) Runtime environments (iv) Activation records

Question No. 127

Match the following:

P. Lexical analysis
Q. Parsing
R. Register allocation
S. Expression evaluation
   1.   Graph coloring
   2.   DFA minimization
   3.   Post-order traversal
   4.   Production tree

Question No. 1

In a compiler, keywords of a language are recognized during

Question No. 13

Which data structure in a compiler is used for managing information about variables and their attributes?

Question No. 42

Which of the following statements are TRUE?

I.  There exist parsing algorithms for some programming languages whose complexities are less than θ(n3).
II.  A programming language which allows recursion can be implemented with static storage allocation.
III.  No L-attributed definition can be evaluated in the framework of bottom-up parsing.
IV. Code improving transformations can be performed at both source language and intermediate code level.