Acharya Nagarjuna University (ANU) 2005 B.Tech Information Technology IT 323 Compiler Design - Question Paper
III/IV B.Tech Degree exam
October 2005
Compiler Design
IT 323
III/1V B.Tech, DEGREE EXAMINATION, OCTOBER 2005,
Second Semester
CtIPILER DESIGN
Time : Three' hours Maxunumf, 70 marks
Answer Question No, 1 compulsorily*
dfr V- '
(1 x 14 s 14) Answer ONE question from each Unit.
(4 X 14 = 56) All questions tarry equal marks,
1. .(a) What is LEX? '
(b) Define parse tree.
(c) What is left recursion? Give example.
(d) What are the entries in symbol table?
e) Define phase,
(0 Define SLR parsing table.
r*
.(g) What is the purpose of YACC tool Oi) Write the post fix rotation of (tf + 6) * c,
i)' Define ayntfut tree,
(j) What is meant by syntactic error?
(k) Explain call-by-name.
(1J Construct DAG for the expression u + fi -t* (b-c) + ibc) * d. ffh) What is meant by activation record?' i*i) Whiit is reduction in strength?
. UNIT I
2, taj Draw a block diagram of' phases of a compiler and indicate the main functions of1 e&ch phase.
(b) Write the chief differences between compiler and interpreter.
Or
(e) Explain he.xical analysis briefly,
{d) What are t.he- differsnl: ''translation rules of a LEX program'?
UNIT II
3, U() Construct predictive parse table for the following grammar:
E - E+TtT
(b) Construct LALR(1) parse table from the following grammar;
S > Aaih Adddbda d>
UK IT III
4, (a) Write top-down translation scheme to produce qu&di'uples for Boolean expressions.
(b) Translate u # - (-h0 in to post fis form.
Or
(cj Discuss the symbol table organization for block structured language like Pascal or 'C*.
UNIT TV
(a) Discuss and analyze about all the allocation in sum-time storiige environment, (10)
(b) Why is next use information collected by a code generator? (4)
Or
(c) Describe various error recovery strategies followed by parser of a compiler-
(d) Write short notes on peephole optimization Technique.
|
Attachment: |
| Earning: Approval pending. |
