В ТЕСН. DEGREE EXAMINATION, NOVEMBER 2015 Seventh Semester
Branch Computer Science and Engineering CS 010 702 COMPILER CONSTRUCTION (CS)
(New Scheme—2010 Admission onwards,
[Regular/Supplementary]
Time - Three Hours
Maximum : 100 Marks
Part A
Answer all questions.
Each question carries 3 marks.
- Define phases of compiler.
- What is recursive descent parsing .
- Define runtime stack.
- Define ICG.
- Define various types of errors.
(5 × 3 = 15 marks)
Part B
Answer all questions.
Each question carries 5 marks.
- Draw a DFD that accepts the four reserved words case, const and continue from c language.
- Explain shift reduce parsing.
- Discuss memory allocation in block structured languages.
- Explain quadruples.
- Discuss data descriptors.
(5 x 5 = 25 marks)
Part C
Answer all questions.
Each question carries 12 marks.
- (a) Explain the tokens using regular expressions.
Or(b) Discuss the lexical analysis and its role.
- (a) Given the following grammar contract SLR parsing X->YX/Z, Y->XY/W table for string ZWWZ.
Or(b) Explain operator precedence parsing.
- (a) Explain memory allocation strategies.
Or(b) Discuss the role of declaration statements in intermediate code generation.
- (a) Explain machine dependent and independent code optimization techniques.
Or(b) Give the semantic rules for declarations in a procedure.
- (a) Write a note on (i) cross compilers; (ii) Incremental compilers.
(6 + 6 =12 marks)Or(b) Explain the basic issues in code generation.
[5 × 12 = 60 marks]
