BSc CSIT (TU) Science Compiler Design and Construction (BSc CSIT, CSC365) Question Paper 2077
This is the official BSc CSIT (TU) (Science stream) Compiler Design and Construction (BSc CSIT, CSC365) question paper for 2077, 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 2077 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
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.
Discuss target code generation. Explain register allocation and the issues in the design of a code generator.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Differentiate between a compiler and an interpreter.
Eliminate left recursion and perform left factoring on the grammar A -> Aab | Ac | bd | f.
What is a symbol table? Explain its role in a compiler.
Differentiate between a parse tree and a syntax tree.
What is an ambiguous grammar? Show with an example.
Explain the role of the lexical analyzer in a compiler.
Differentiate between LL(1) and LR parsers.
What are regular expressions? Write a regular expression for identifiers.
Explain the handle and handle pruning in shift-reduce parsing.