Questions Search

This website covers previous years question papers of various universities and colleges in India. Moreover, the information on admission to various courses from various universities/institutes/colleges are also available. Also the latest teaching faculty plus teachers jobs, Government jobs, Banking Jobs, and other jobs are regularly updated to help jobless candidates. Admit cards of various recruitment of Govt organisation are updated. Search your terms using the search box provided.

Follow by Email

Thursday, May 5, 2016

ANU B.Tech CS IT Compiler Design 2016 Question Paper

University : Acharya Nagarjuna University
Course: B.Tech Computer Science and Engineering / Information Technology
[Total No. of Questions : 09]
CS/IT 322 (CR)
III/IV B.Tech Degree Examinations, March - April 2016
Second Semester
Compiler Design
Time : 3 hours
Maximum Marks : 70
Question Paper Type: Old Question Papers, Previous Years Question Papers

Answer question No.1 Compulsory
Answer ONE question from each Unit

1. Answer the following [7 x 2 = 14M]
a) Distinguish between Pass and Phase
b) Define token, pattern and lexeme
c) Predictive parser
d) Syntax tree purpose
e) What is syntax directed definition?
f) Explain with an example how dead code is eliminated
g) Address Descriptor

UNIT - I [1 x 14 = 14M]

2. a) Explain the different phases of a compiler, showing the output of each phase, using the example of the following statement:
A = (B + C) - D / (E + 50)

2. b) Distinguish between compiler and interpreter. (OR)
3. What is recursive descent parser? What are its limitations? Construct recursive descent parser for the following grammar.
E -> E + T | T          T -> TF | F          F -> F* | a |b

UNIT - II [1 x 14 = 14M]

4. a) Explain the purpose of SLR parsing and construct the SLR parsing table for the Grammar
E -> E + T | T          T -> TF | F          F -> F* | a |b

4. b) Explain different error handling methods in Predictive parsers. (OR)
5. a) Write the Pseudo code for the recovery schema employed by YACC.
5. b) Write short notes on (i) S-attributed definitions and (ii) Dependency Graph.

UNIT - III [1 x 14 = 14M]

6. a) What are the issues in the design of a Code generator? Explain.
6. b) Write a brief on Peephole optimization. (OR)
7. Explain the role of intermediate code generator in compilation process and explain with an example how case statements are handled in intermediate code generation.

UNIT - IV [1 x 14 = 14M]

8. Explain different storage allocation strategies exploring their purpose. (OR)
9. What is the purpose of symbol table, its entries and different data structures used in symbol tables. 

No comments:

Post a Comment

Pen down your valuable important comments below