Compiler Questions
Download as DOC, PDF3 likes3,583 views
The document contains questions from past university exams on the topics of compilers. It is organized into 5 main sections: I. Compilers - Questions cover the different phases of a compiler and the structure of a compiler. II. Lexical Analyzer - Questions cover implementing a lexical analyzer, the role of lexical analyzers, and constructing NFAs and DFAs. III. Parser - Questions cover top-down and bottom-up parsing, LR parsers, parser generators, and constructing syntax trees. IV. Intermediate Code Generation - Questions cover recursive evaluators, type checking, polymorphic functions, and intermediate code. V. Code Generation - Questions cover code optimization techniques like register allocation,
Compiler Questions
- 1. PRINCIPLES OF COMPILER DESIGN – UNIVERSITY QUESTIONS MCA/MSc(CS) I. Compilers Give introduction about compiler. 5 marks MCA Dec’08 Explain the different phases of a compiler.5-MCA-May08/5MscDec08/5MscMay08 Discuss briefly about the structure of a compiler. 20MscMay09 IA. Lexical Analyzer How to implement Lexical Analyzer.? Explain. 5 Marks MCA Dec’08/20MCAMay08 Explain role of lexical analyzer. 5MCADec07 /5MscDec07 How token can be recognized using LEX tool? 5-MCA-May08 Write algorithm for constructing NFA. 5MCADec08 Construct a NFA for the regular expression (a/b)*abb. 5MscDec08 Describe simple approach to the design of lexical analyzers. 5MscMay09 What do you mean by regular expression? Write down its rules. 5MscMay09/5MscDec07 Explain about lexical analysis, regular expression, non-deterministic automata. 20-MCA-Dec08 Define DFA. How will you minimize the states DFA. 20MCADec07/5MscMay08 Write an algorithm for constructing a DFA from a NFA and give one example. 20MscDec08/20MscDe07 Explain briefly about NFA and DFA with examples. 20MscDec07 II. Parser Describe the following: i) Bottom up parsing ii)Shift reduce parsing 5MCA Dec08/May08/Dec07/MscMay09/MscDec08/20MscDec08 Explain top down parsing. 5MCADec07/5MscMay08 What are the difficulties in top down parsing.5MscMay09 Write about LR parsers 5 marks MCA Dec’08/20MCAMay08/5MscMay08 Describe parser generators. 5-MCA-May08 Write notes on parameter passing. 5MCADec07/5MscDec08/5MscDec07
- 2. Write the operator precedence parsing algorithm. 5MscDec08/5MscDec07 Write about parsers and how to generate YACC. 20-MCA-Dec08/5MscDec07 Explain the construction of recursive descent parsing with example. 20MCADec07/10MscDec08 Explain model of predictive parser. 20MscM09/20MscDec07 Discuss the stack implementation of shift reduce parsing with examples. 20MscDec07 III. Intermediate Code Generation Write about recursive evaluators. 5-MCA-Dec08 Describe polymorphic functions. 5-MCA-Dec08/5MCAMay08/5MscDec08/5MscMay08 Explain top-down translation. 5MCAMay08 Explain the evaluation of inherited attributes. 5MCADec07/10MscDec07 Explain syntax directed definition for constructing a syntax tree for the expression. 5MscMay09 Explain about overloading of functions and operators. 20-MCA- Dec08/5MCADec07/5MscDec07 Explain in detail the concept of type checking which includes type systems, type conversions etc., 20MCAMay08/10MscDec08 Write notes on type systems. 5MscMay09/5MscMay08 Differentiate between parse tree and syntax tree. 5MscDec08 Explain the construction of syntax tree with example. 20MCADec07/10MscDec07/5MscDec07 Describe four kinds of intermediate code used in a compiler. 20MscMay09/20MscDec07 IV. Storage Write about dynamic storage allocation. 5-MCA-Dec08/20MCADec07 Write notes on storage allocation strategies. 5MCAMay08/20MscDec08/5MscMay08/20MscDec07 Explain Back patching. 5-MCA-Dec08/10MCAMay08 Describe representation declarations. 5MCAMay08/5MscMay08 What are assignment statements? Explain 5MCADec07 Describe the translation scheme for the assignment statements. 5MscMay09 Difference between call by value and call by reference. MscMay09 Explain about Boolean expression with examples – 20-MCA-Dec08/10MCAMay08
- 3. Discuss briefly about the data structure for symbol table. 20MscMay09/5MscDec08/20MscMay08/5MscDec07 V. Code Generation Write about global data flow analysis. 5-MCA-Dec08/5MCADec07 Write short notes on code optimization 5MCA/May08 What are the issues in the design of a code generator? Explain. 5MscDec08 Define optimization. Explain the principal sources of optimization.20MCADec07/5MscDec07 What are the principal sources of optimization. Explain. 5MscMay09 Describe register allocation and assignment 5MCAMay08 Describe runtime storage management. 5MCADec07/5MscMay09 What is a flow graph. Give an example. 5MscMay08 Describe the algorithm to construct a directed acyclic graph. Explain DAG representation of basic blocks. 20-MCA-Dec08 Define Basic Block. Write an algorithm for partition into basic blocks. 5MscDec08/5MScDec07 Explain algorithm to construct a DAG 20MCAM08 Explain the various concepts involved in code optimization. 20MscMay09 Discuss about the peephole optimization and global data flow analysis. 20MscDec08/5MSCDec07 Discuss about the GDF and loop optimization. 20MSCDec07