Code No: R2032052 R20 SET -1

III B. Tech II Semester Regular/Supplementary Examinations, May/June - 2024

COMPILER DESIGN
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) What are the different phases of compilation and explain the phases of the [7M]
compilation with the following C language statement as an input.
position = initial + rate * 60;
where position, initial, and rate are variables of type double
b) The programming language may be case sensitive or case in sensitive. Case [7M]
sensitive languages treat uppercase and lowercase letters as distinct characters in
programming whereas case insensitive languages treat both as same. Most of the
programming languages are case sensitive, However some languages like SQL are
case insensitive so the keyword can be written either in lower case, upper case, or
in any mixture case. The SQL keyword SELECT can also be written select,
Select, or SeLeCT. Show how to write a regular expression for a keyword in a
case insensitive language, explain with “select” in SQL
(OR)
2. a) What is sentinel character in input buffering and explain its significance [7M]
b) Write a regular expression for recognizing the following patterns where input [7M]
alphabet {a,b,c}
i) Which begins with ‘a’ and ends with ‘c’
ii) Which begins and ends with same symbol
UNIT-II
3. a) Consider the following grammar which is used for specifying subset of arithmetic [7M]
expressions in C
A -> A - id | -A | id
i) Construct a parse tree for the string id-id-id
ii) Prove that the above grammar ambiguous
b) Explain with an example “why left recursion is an issue in top down parsing” and [7M]
write steps for left recursion elimination
(OR)
4. Construct a LL(1) parsing table for the following grammar and show the working [14M]
of parser on input -id-id-id
A -> A -id | B
B -> -A | id
UNIT-III
a) Construct CLR(1) parsing table for the following grammar and
5. show the working of parser on input -id-id-id [7M]
A -> A - id | B
B -> -A | id
b) Explain about SDD’s and also evaluation orders for SDD’s. [7M]
(OR)
6. a) Explain shift-reduce and reduce-reduce conflicts in the context of shift-reduce [7M]
parsing.
b) Explain S-attributed and L-attributed definitions with an example. [7M]
1 of 2
|''|''|||''|'''|||'|
 Code No: R2032052 R20 SET -1

UNIT-IV
7. a) Explain the contents of an activation record with an example. [7M]
b) What is an induction variable and identify the induction variables in the [7M]
following statements in C
for( i=0,j=1,k=2,l=4 ; i< n ; i++){
j= j+2
k = k+3
l = l+4
sum = sum + i*j*k
}
(OR)
8. a) Compare static, stack, dynamic storage allocation strategies [9M]
b) What is dead code elimination explain with an example [5M]
UNIT-V
9. a) Generate simple assembly language target code for the following intermediate [9M]
code statements using simple code generator. Assume that target machine has
three registers (R1, R2, R3). Initially all registers are empty and no variable is
live at the end of all statements
T1 = a*b
T2 = a*c
T3 = T1 + b
T4 = a+T2
T5 = b + T4
b) Explain various object code forms used in compilation. [5M]
(OR)
10. a) Explain how does register allocation techniques affect program performance. [7M]
b) Explain peephole optimization on target assembly language programs with [7M]
examples.

2 of 2

|''|''|||''|'''|||'|
 Code
Code No:
No: P2031051
R2031011
R2031351
R203135A
R203147A
R203147C
R203105O
R2032052 R20 22SET
SET
SET
RA--22
-2
III B. Tech II Semester Regular/Supplementary Examinations, May/June - 2024
COMPILER DESIGN
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) What is boot strapping in the context of compiler and explain how it helps in [8M]
language independence and reducing development time.
b) Write a regular expression for recognizing the following tokens in C [6M]
i) Identifier ii) integer constant iii) string constant.
(OR)
2. a) What is input buffering in the context of lexical analysis and explain why we [7M]
take pair of input buffers instead of single buffer in lexical analysis.
b) Explain the output of the following Lex specification on input abbbabaa [7M]
%%
a*b {printf(“1”); }
ab* {printf(“2”); }
b*a {printf(“3”); }
ba* {printf(“4”); }
%%
UNIT-II
3. a) Consider the following grammar which is used for specifying logical [7M]
expressions in python
L ->L and L | L or L |not L | TRUE | FALSE
i) Construct parse tree(s) for the string
not TRUE and FALSE
ii) Prove that the above grammar ambiguous
b) Explain with an example “why common left factors is an issue in top down [7M]
parsing” and write steps for left factoring
(OR)
4. Construct a LL(1) parsing table for the following grammar and show the [14M]
working of parser on inputnot TRUE and FALSE
L -> L orB | B
B ->BandC | C
C ->not L | TRUE | FALSE
UNIT-III
5. Construct a SLR(1) parsing table for the following grammar and show the
working of parser on input not TRUE and FALSE [14M]
L -> L or B | B
B -> B andC | C
C ->not L | TRUE | FALSE
(OR)
6. a) Justify the following statements [9M]
(i) If there is no shift-reduce conflict in CLR(1) parsing table then there is no
shift-reduce conflict in LALR(1) parsing table of same grammar
(ii)Even If there is no reduce-reduce conflict in CLR(1) parsing table also there
maybe reduce-reduce conflict in LALR(1) parsing table of same grammar
1 of 2

|''|''|||''|'''|||'|
 Code No: R2032052 R20 SET -2

b) Write quadruple, triple , and indirect triple for the following statement [5M]
x = y*-z + y*-z
UNIT-IV
7. a) Consider the following intermediate code statements numbered from 1 to 12 [7M]
1 i=0
2 if i<n goto 4
3 goto 11
4 t1 = 4*i
5 t2 = a[t1]
6 t3 = t2 + 1
7 t4 = 4*i
8 b[t4] = t3
9 i= i+1
10 goto 2
11 t5 = 4*i
12 b[t5] = 0
Construct a control flow graph for the given code and explain which of the 4*i
computation in statement 7 and statement 11 are redundant.
b) Explain with an example why static allocation strategy is not appropriate for [7M]
languages like C.
(OR)
8. a) Draw the activation tree for the function call f(5) where definition of f is given [7M]
as follows
int f(int n){
if n==0 return 0
else if n==1 return 1
else return f(n-1) + f(n-2)
}
b) Explain different loop optimizations with examples. [7M]
UNIT-V
9. a) Explain about next-use, register descriptor, address descriptor data structures [7M]
used in simple code generation algorithm.
b) Write simple code generation algorithm. [7M]
(OR)
10. a) Explain about different forms object code forms used as target code in target [7M]
code generation.
b) Explain register allocation by graph coloring. [7M]

2 of 2

|''|''|||''|'''|||'|
 Code
Code No:
No: R203105O
R2031011
R2031351
R203135A
R203147A
R203147C
R2032052 R20 SET - 32

III B. Tech II Semester Regular/Supplementary Examinations, May/June - 2024

COMPILER DESIGN
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) Compare and contrast compiler and interpreter. [5M]
b) Define token, pattern, and lexeme. And mark the token, lexeme and pattern [9M]
required for the following C language statement.
printf(“ sum of %d and %d is %d”,a,b,a+b)
(OR)
2. a) What are the different ways of designing a lexical analyzer and explain each [6M]
method with an example.
b) Write a regular expression for recognizing the following patterns where input [7M]
alphabet {a,b,c}
i) Which contains at least one a and at most one b
ii) Which contains at lease two a’s and at most two b’s
UNIT-II
3. a) Consider the following grammar which is used for specifying subset of [7M]
arithmetic expressions in C, where num is an integer constant
E ->num –E | num + E | num
i) Construct a parse tree for the string
num – num - num + num
ii) As per the grammar given above , what is the result of the
expression 9-5-2+4
b) Explain dangling else problem and what is the solution for it as per the C [7M]
language specification.
(OR)
4. Construct a LL(1) parsing table for the following grammar and show the [14M
working of parser on input aa+a* ]
S-> SS + | SS * | a
UNIT-III
5. Construct a LALR(1) parsing table for the following grammar and show the [14M
working of parser on input aa+a* ]
S-> SS + | SS * | a
(OR)
6. a) Compare and contrast SLR(1), CLR(1), LALR(1) parsers. [7M]
b) Write triples for the following statement. [7M]
c[i] = a[i] + b[i]
where a,b,c are arrays of type integers
UNIT-IV
7. a) Show the contents of the activation record for the function call f(6) where [7M]
definition of f is given as follows and f is called from main function
int f(int n){
if n==0 return1
else returnn* f(n-1)
}
1 of 2

|''|''|||''|'''|||'|
 Code
Code No:
No: R203105O
R2031011
R2031351
R203135A
R203147A
R203147C
R2032052 R20 SET - 32

b) Explain in detail common sub expression elimination, copy propagation, dead [7M]
code elimination optimizations with examples.
(OR)
8. a) Explain the purpose of live variable data flow analysis with an example. [7M]
b) Write a brief note on structure preserving transfromations. [7M]
UNIT-V
9. a) Explain different addressing modes and how does address modes helpful in [7M]
improving the performance of the target program.
b) Explain different machine dependent code optimizations with examples. [7M]
(OR)
10. a) Explain which phases of compilation are machine independent and which are [7M]
machine dependent?
b) Explain how relocatable object code form helps in cross-platform [7M]
compatibility.

2 of 2

|''|''|||''|'''|||'|
 Code
Code No:
No: P2031051
R2031011
R2031351
R203135A
R203147A
R203147C
R203105O
R2032052 R20 2SET
RA--42-
SET
SET
2
III B. Tech II Semester Regular/Supplementary Examinations, May/June - 2024
COMPILER DESIGN
(Computer Science and Engineering)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions ONE Question from Each unit
All Questions Carry Equal Marks
*****
UNIT-I
1. a) Define compiler and explain which phases of the compilation aremachine- [6M]
dependent and which are machine-independent.
b) Languages like Fortran ignores spaces and spaces having no significance, [8M]
Consider the following the statements A and B in Fortan
A: DO 5 I = 1.50
B: DO 5 I = 1,50
In statement A DO5I is an identifier and In statement B DO is a keyword. How
a lexical analyzer differentiates DO in statement A and B explain.
(OR)
2. a) Explain the purpose of lexeme beginning and forward pointers in buffer pairs [7M]
with an example.
b) Explain the output of the following Lex specification on inputbbaabaab [7M]
%%
a*b {printf(“1”); }
ab* {printf(“2”); }
b*a {printf(“3”); }
ba* {printf(“4”); }
%%
UNIT-II
3. a) Consider the following grammar which is used for specifying subset of [7M]
arithmetic expressions in C, where num is an integer constant
E -> num * E| num/E | num
i) Construct a parse tree for the string
num / num / num * num
ii) As per the grammar given above, what is the result of the
expression 12 / 12 / 2 * 3
b) Explain with an example “why ambiguity is an issue in parsing” and write an [7M]
intuitive argument why it is difficult to solve.
(OR)
4. Construct a LL(1) parsing table for the following grammar and show the [14M]
working of parser on input ((a,a),a,(a))
S-> (L) | a
L-> L, S | S
UNIT-III
5. Construct a SLR(1) parsing table for the following grammar and show the [14M]
working of parser on input ((a,a),a,(a))
S-> (L) | a
L-> L, S | S
(OR)
6. a) Compare and contrast top-down parsing and bottom-up parsing. [7M]
b) Explain synthesized and inherited attribute with examples. [7M]
1 of 2

|''|''|||''|'''|||'|
 Code
Code No:
No: R2031011
R2032052 R20 SET-4
SET -

UNIT-IV
7. a) Explain the stack allocation strategy with an example. [7M]
b) Define basic block and write algorithm for constructing control flow graph [7M]
from the intermediate code.
(OR)
8. Perform available expression analysis on the following intermediate code [14M]
statements numbered from 1 to 9
i) Argue whether a*b expression is available at statement 6 and
statement 8
ii) Argue whetherb*c expression is available at statement5 and
statement 9
1 x = a*b
2 y = b*c
3 if a>20 goto 6
4 z = a*b
5 w = b*c
6 p = a*b
7 a = a+20
8 q = a*b
9 r = b*c
UNIT-V
9. a) How register assignment will be done? Explain in detail. [7M]
b) Explain how assembly code as target code helps in understanding program [7M]
execution.
(OR)
10. a) Explain peephole optimization on target assembly language programs with [7M]
examples.
b) Discuss various issues in the design of code generator. [7M]

2 of 2

|''|''|||''|'''|||'|