M.Sc. DEGREE EXAMINATION,
NOVEMBER 2017
Third Semester
Computer Science
COMPILER DESIGN
(CBCS 2016 onwards)
Time 3 Hours Maximum 75 Marks
Part A (10 x 2 20)
Answer all questions.
1. What is the difference between Compiler and Translator?
2. What are the components of a grammar for a language?
3. What do you mean by handle pruning?
4. What is the fundamental drawback of top down parsing?
5. Construct a syntax tree for the expression a .
6. What is Polish notation?
7. How information about array names is to be stored in
symbol table?
8. What is the use of flow graph?
9. What do you mean by local optimization?
10. Give an example for copy propagation.
Sub. Code
551301
RW-982
2
Wk 3
Part B x 5 25)
Answer all questions, choosing either or
11. Describe the principal aids provided by existing
compiler compilers.
Or
Define Regular Expression. Also write the rules for
constructing regular expression.
12. With an example, explain shift-reduce parsing.
Or
Explain ambiguity in grammar with an example.
13. Describe the three-address code with suitable
example.
Or
Describe the role of Type checker.
14. How hashing is implemented in Compiler?
Or
Explain any one non-block structure storage
allocation.
15. Illustrate how redundant expression is eliminated?
Or
How DAG helps for register allocation?
RW-982
3
Wk 3
Part C x 10 30)
Answer any three questions.
16. Explain the simple approach to design of Lexical
analyzer.
17. Describe the working principle of automatic parser
generator YACC.
18. Write about Loop optimization with examples.
19. Describe the Syntax-directed translation schemes.
20. Write a note on object code forms and explain how the
machine dependent code optimization is carried out.
————————