BSc CSIT (TU) Science Compiler Design and Construction (BSc CSIT, CSC365) Question Paper 2080
This is the official BSc CSIT (TU) (Science stream) Compiler Design and Construction (BSc CSIT, CSC365) question paper for 2080, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Compiler Design and Construction (BSc CSIT, CSC365) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) Compiler Design and Construction (BSc CSIT, CSC365) exam or solving previous years' question papers, this 2080 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Discuss the specification and recognition of tokens. Explain the role of finite automata and input buffering in lexical analysis.
Explain top-down parsing. Construct the predictive (LL(1)) parsing table for the grammar E -> E+T | T, T -> T*F | F, F -> (E) | id after removing left recursion.
Explain code optimization. Discuss the principal sources of optimization and the various machine-independent optimization techniques.
Section B: Short Answer Questions
Attempt any EIGHT questions.
What is three-address code? Write the three-address code for x = (a + b) * (c + d).
Explain peephole optimization with an example.
Differentiate between synthesized and inherited attributes.
What is bootstrapping in compiler construction?
Construct an NFA for the regular expression (a|b)*abb.
What is operator precedence parsing?
Explain activation records and their role in run-time storage management.
What is a basic block and a flow graph?
Differentiate between top-down and bottom-up parsing.