M.Sc. DEGREE EXAMINATION, NOVEMBER 2017
First Semester
Computer Science
PRINCIPLES OF COMPILER DESIGN
(CBCS 2014 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is the role of lexical analyzer?
2. Define the term compiler.
3. Write a context free grammar to represent a palindrome.
4. What is meant by precedence parsing?
5. What are the four kinds of intermediate code often used
in compilers?
6. What are the methods of representing a syntax tree?
7. Define symbol table.
8. List out the issues of run time storage management.
9. Define DAG.
10. State the need for peephole optimization.
Sub. Code
4MCE1C4
AFF-4949
2
Wk16
Part B x 5 25)
Answer all questions choosing either or
11. Write short notes on compiler writing tools.
Or
Write an algorithm to construct an NFA from a
given regular expression.
12. Illustrate the construction of LR parsing tables with
an example.
Or
What are the difficulties with generalized top down
parsing? Discuss.
13. Explain syntax-directed translation schemes.
Or
Give a brief note on postfix translations.
14. Discuss about storage allocation strategy.
Or
How to represent scope information in symbol table?
Explain.
15. Write an algorithm to implement a simple code
generator.
Or
Explain about the various techniques of loop
optimization.
AFF-4949
3
Wk16
Part C 10 30)
Answer any three questions.
16. Explain in detail about the minimizing the number of
states of a DFA and to recognize
17. Write the translation scheme for generating 3-address
code for the CASE statement.
19. Compare and contrast syntactic phase errors with
semantic errors.
20. Explain in detail about Register allocation and
assignment in code generation.
————————