Computer Engineering (Semester 6)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.
Q.1 Attempt all 4.
(a) What is Handle pruning?
(5 marks)
00
(b) What is role of finite automata in compiler theory?
(5 marks)
00
(c) What are different type of attributes in SDD? Explain with examples.
(5 marks)
00
(d) Backpatching with example.
(5 marks)
00
Q.2
(a) Explain two pass macro processor with flowchart and databases.
(10 marks)
00
(b) Explain various loop optimization techniques with example.
(10 marks)
00
Q.3
(a) Construct SLR parsing table for following grammar. Show how parsing
actions are done for the input string ( 0 S. Show stacks content, i/p buffer, action.
$\hspace{10mm}$S ->(S)S
$\hspace{10mm}$S -> $\varepsilon$
(12 marks)
00
(b) What are various databases used in two pass assembler design. Explain with
example.
(8 marks)
00
Q.4
(a) Discuss various intermediate code forms in detail.
(10 marks)
00
(b) What is Loader ? Explain functions of loader with examples.
(10 marks)
00
Q.5
(a) For the given grammar below constmct operator precedence relations matrix,
assuming *. + are binary operators and id as terminal symbol and E as non terminal symbol.
$\hspace{10mm}$ E $\rightarrow$ E + E
$\hspace{10mm}$ E $\rightarrow$ E*E
$\hspace{10mm}$ E $\rightarrow$ id
Apply operator precedence parsing algorithm to obtain skeletal syntax tree for the statement:
$\hspace{10mm}$ id + id * id
(10 marks)
00
(b) Explain Run time organization in detail.
(10 marks)
00
Q.6 Write short notes on any (02) [20]
$\hspace{10mm}$(a) LEX and Y ACC
(5 marks)
00
$\hspace{10mm}$(b) Design of an Editor
(5 marks)
00
$\hspace{10mm}$(c) Syntax Directed Translation
(5 marks)
00
$\hspace{10mm}$(d) Recursive Descent parsing
(5 marks)
00