‘Total No, of Questions : #] | Total No. of Printed Pages : 2 602/2004 B. E, (Seventh Semester) EXAMINATION, May, 2004 (Computer Sclence Engg. Branch) PRINCIPLE OF COMPILER DESIGN (CSE = 403—C) Tie : Three Hours | [ Meaximaure Marks » 100 Note : Attempt any five questions, 1 2 Discuss all the phases of a compiler in detail. Differentiate between phase and pass of a compiler. 0 (a) Define regular expression, Also explain the rules for their coastruction. aU (b) Write and explain the algo to aimize the mumber of states of DFA, 0 (a) What is meant by CPG ? Write the notational” conventions for CFG. ry (b) What ic meant by left recursion 7 White an algorithm to remove left recursion, 10 (a) Write the rules to calculate the operator precedence relation between two terminals a and b of an operator grammas. Ww (©) ‘What do you mean by predictive parser ? Write the predictive parsing algorithm, 10 RTO21 Write how SLR parsing tables arc constructed ? Give an ‘example to support your answer ~» fa) Explain how the entries are stored in symbol table susing self onganizig lst 2 0 (b) Discuss how scope information is stored in grmbol table? 10 iceuss briefly the following = (@) Code optianization, TT (b) Error handling, eT) ‘Assuming appropriate translation fields for E given below, provide a syntax directed translation scheme for tbe following gramar : ww $+ ropeat $ until E/beygin L endo N times S Loss N+ id/const