Firstranker's choice
Printed Pages: 2
--- Content provided by FirstRanker.com ---
Paper Id: 110263
Roll No.
BTECH
(SEM VI) THEORY EXAMINATION 2018-19
COMPILER DESIGN
--- Content provided by FirstRanker.com ---
Time: 3 Hours
Total Marks: 70
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 7 = 14
--- Content provided by FirstRanker.com ---
- What are the two parts of a compilation? Explain briefly.
- What is meant by viable prefixes?
- What are the classifications of a compiler?
- List the various error recovery strategies for a lexical analysis.
- What is dangling else problem?
- What are the various types of intermediate code representation?
- Define peephole optimization.
--- Content provided by FirstRanker.com ---
SECTION B
2. Attempt any three of the following:
- Write the quadruples, triple and indirect triple for the following expression: +(x+(y+z)-(y-z)) x 3
- What are the problems with top down parsing? Write the algorithm for FIRST and FOLLOW.
- Perform Shift Reduce Parsing for the given input strings using the grammar S->(L) | a and L->L,S|S
- (a,(a,a))
- (a,a)
- What is global data flow analysis? How does it use in code optimization?
- Construct LR(0) parsing table for the following grammar S-> cBccA
A-> cAa
B-> ccB | b
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION C
3. Attempt any one part of the following: 7x1=7
--- Content provided by FirstRanker.com ---
- Convert following NFA to equivalent DFA and hence minimize the number of states in the DFA.
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University
--- Content provided by FirstRanker.com ---