DISTANCE EDUCATION
M.C.A./M.C.A. DEGREE EXAMINATION, MAY 2017.
Fourth Semester
COMPILER DESIGN
(2010 Academic Year Onwards)
Time Three hours Maximum 100 marks
SECTION A — 8 40 marks)
Answer any FIVE questions
1. Write a note on finite Automata.
2. How regular expressions are created?
3. What is meant by Top Down parsing? Explain.
4. Write a note on Dead Code Elimination.
5. Explain Data Structure for Symbol Table.
6. Explain the importance of flow graphs.
7. Explain the concept of Code Propagation.
8. What is meant by global Optimization? Explain.
SECTION B — 15 60 marks)
Answer any FOUR questions.
9. What are the issues in Lexical Analysis?
Elaborate the recognition of tokens.
Sub. Code
404
DE-696
2
Ws7
10. Explain Bootstrapping.
Distinguish between phases and passes.
11. Construct the predictive parser for the following
grammar.


12. Explain in detail about the specification of a simple
type checker.
How to subdivide a run-time memory into code and
data areas? Explain.
13. Construct SLR parsing table for the following grammar.
E
T
F
14. Explain in detail about the various issues in design
of code generator.
Write an algorithm to partition a sequence of three
address Statements into basis blocks.
15. Explain the principle sources of optimization in
detail.
Discuss the various peephole optimization
techniques in detail.