CD 1
CD 1
PART – A (5 X 2 = 10)
1. Explain three address code with example
2. Difference between lexical analyzer and parser
3. Draw the transition diagram for relational operators and unsigned numbers.
4. What are the two parts of compilation? Explain briefly
5. What are the error recovery actions in lexical analyzer?
PART – B (13 X 2 = 26)
6. Explain detail about lexical analysis
OR
7. Construct finite automata equivalent to regular expression
(a|b)*|(ab)*b|a*(bb)*
8. Explain in detail about role of lexical analyzer with possible error recovery actions.
OR
9. Explain about input buffering.