Exam Details
Subject | compiler design | |
Paper | ||
Exam / Course | m.c.a./ m.c.a.(lateral) | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | December, 2017 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
M.C.A./M.C.A. (Lateral) DEGREE EXAMINATION,
DECEMBER 2017.
Fifth Semester
COMPILER DESIGN
(2005 to 2010 calendar year)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
1. Explain the structure of a compiler.
Explain the algorithm for constructing an NFA
equivalent to a regular expression.
2. Explain the following
Bootstrapping a compiler
Bookkeeping.
3. Explain the following
Parse frees
Shift reduce parsing.
Sub. Code
54
DE-2763
2
SER
Write the rules for constructing FIRST and
FOLLOW sets for a given grammar.
4. Explain the method of constructing the canonical
collection of items, with an example.
Discuss using ambiguous grammars.
5. Explain how port fix code can be generated using
syntax directed translation scheme.
Discuss the implementation of syntax directed
translators.
6. How scope information is represented in symbol
tables? Explain.
Explain the following
Lexical phase errors
Semantic errors.
7. Explain the principal sources of optimization.
Discuss loop optimization.
8. Explain the algorithms for a simple code generator.
Discuss the use of DAG in optimization.
M.C.A./M.C.A. (Lateral) DEGREE EXAMINATION,
DECEMBER 2017.
Fifth Semester
COMPILER DESIGN
(2005 to 2010 calendar year)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
1. Explain the structure of a compiler.
Explain the algorithm for constructing an NFA
equivalent to a regular expression.
2. Explain the following
Bootstrapping a compiler
Bookkeeping.
3. Explain the following
Parse frees
Shift reduce parsing.
Sub. Code
54
DE-2763
2
SER
Write the rules for constructing FIRST and
FOLLOW sets for a given grammar.
4. Explain the method of constructing the canonical
collection of items, with an example.
Discuss using ambiguous grammars.
5. Explain how port fix code can be generated using
syntax directed translation scheme.
Discuss the implementation of syntax directed
translators.
6. How scope information is represented in symbol
tables? Explain.
Explain the following
Lexical phase errors
Semantic errors.
7. Explain the principal sources of optimization.
Discuss loop optimization.
8. Explain the algorithms for a simple code generator.
Discuss the use of DAG in optimization.
Other Question Papers
Subjects
- .net frame works
- .net lab
- accounting and financial management
- agent based intelligent system
- c-sharp (c#)
- communication skills
- compiler design
- computer applications
- computer networks
- data mining and warehousing
- data warehousing and mining
- distributed computing
- image processing and analysis
- internet programming
- lab : vi — algorithm and shell programming
- lab v — rdbms
- lab vii –– internet programming
- lab viii — network lab
- lab x — compiler design
- lab–ix : visual c++
- middleware technology
- mobile communications
- multimedia systems
- multimedia tools lab
- network lab
- neural networks
- object oriented analysis and design
- open source architecture
- open source programming lab
- operating systems
- rdbms
- resource management techniques
- software engineering
- software project management
- unix and shell programming
- visual programming
- visual programming lab
- web technology
- web technology lab