MCASemester 32022-23Compiler DesignKCA-015

Compiler Design (KCA-015) - AKTU Question Paper 2022-23

MCA · Semester 3 · Free PDF Download

This is the official AKTU Compiler Design Previous Year Question Paper for MCA Semester 3, academic session 2022-23. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.

Course:MCA

Semester:Semester 3

Session:2022-23

University:AKTU / UPTU

Rate this paper

Questions Asked in 2022-23

Compiler Design (KCA-015) — complete question paper

Section AAttempt all questions in brief. 2x10 = 20

a
Discuss the need of cross co mpiler and how it can be achieved?
b
Describe the Arden’s theorem
c
Investigate the use of pass of a compiler
d
Discuss the requirement of a “lookahead” feature in order t o specify their lexical Analyzers
e
Demonstrate an example of parse tree and syntax tree
f
Show the actions available with shift reduce parsers
g
Define a postfix notation
h
Explain peephole optimization. (i) Define DAG. (j) What do you mean by machine dependent and machine independe nt ptimization?

Section BAttempt any three of the following: 10x3 = 30

a
Describe the symbol table manager and error handler routines?

Examine the output of lexical analyzer for the following pr ogram.

int max (x, y)
int x, y;
/* this program find out the maximum of two numbers*/
{
        return (x > y? x: y);
}

c
What are the difficulties with top-down parsing? Explain wi th examples
d
What are the various ways of calling the procedure? Explain in detail
e
Discuss about the following: (i) Copy Propagation (ii) Dead-code Elimination

Section CAttempt any one part of the following: 10x1 = 10

a
Consider the following grammar Discover whether the above grammar is unambiguous or not. If not convert it and also remove the left recursion from the grammar
b
For the Regular expression (a/b)*a(a/b). Draw the NFA. Obtain D FA form NFA
a
Point out the various phases of compiler and write down the output of each phase of the compilation for the expression a: = (b +d) + (c* 5)
b
Illustrate how a lexical analyzer can be implemented and Write a LEX program to identify octal and hexadecimal numbers and implement specific action after identifying these tokens
a
Compute FIRST and FO LLOW for given Grammar S ->aBDh
b
Make use of the recursive de scent parser to write the code in C- Language for the following grammar
a
Break down the 3-address code for the statements a =c*-d + b*-c?
b
classify three types of imple mentations of three-address statements
a
What are the issues in the design of code generator? Explain in detail
b
What is an activation record? Draw diagram of General Activ ation record and explain the purpose of different fields of an activa tion record

Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.

Repeated Questions — KCA-015

Questions that appeared in more than one session, found by comparing 4 years of Compiler Design papers (2021-22, 2022-23, 2023-24, 2024-25)

Demonstrate an example of parse tree and syntax tree