Code No.

: C1209 MR 22

MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)

(Affiliated to JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD)
Gundlapochampally (H), Maisammaguda (V), Medchal (M), Medchal-Malkajgiri (Dist), Hyderabad
III B.TECH - II SEM (MR 22) MODEL QUESTION PAPER
Subject: Automata Theory and Compiler Design
Branch: Information Technology and B.Tech AIML
Time: 3 hours Max. Marks: 60
PART A
10x1M=10 M
Answer all the Questions

Q.NO Question Marks BTL CO

a L1 1
Differentiate between Transition function of DFA and NFA 1
b Compare PDA and TM L2
1 1
c List few closer properties of regular Language L1
1 2

d Write a note on Pumping lemma for context Free Grammar L1

1 2
e What are the requirements construct Regular Expression L2
1 3
f Write short note on Grammars L1
1 3
g What is Compiler and Interpreter L2
1 4
h L1
What is Left recursion And Left Factoring 1 4
i L2
Illustrate the code optimization techniques. 1 5
j What are the method to handle peephole optimization L2
1 5
PART B
Answer all the Questions 10*5=50M

BT
Q. No. Question Marks CO
Level
1. i. Design a DFA for set of all strings over {a,b} ending with aaa
5
ii. consider the following ε–NFA. Illustrate the ε–closure of each state
and find it‟ s equivalent DFA L2
1
L3
5
 OR
2. i.construct DFA that accept all strings of a’s and b’s where each string 5 L4
even no.of a’s and odd no. of b’s
1
ii. Difference between DFA and NFA
5 L3

3. i. Find the regular expression for the language { L=a 2nb2m | n>=0,
5 L3
m>=0}
2
ii. Construct E-NFA to accept the regular expression (0+1)* (00+11)
5 L3
(0+1)*
OR
4. i. State pumping lemma for regular languages. Prove that the following 5 L3
language {an | n is a prime number} is not a regular.
2
ii. Construct NFA equivalent to the grammar S→Ab |ab, A→Ab | Bb,
B→ Ba | a 5 L3

5. i.What do you mean by ambiguity in grammars ?

Check whether the following grammar is ambiguous or not.
S →i C t S | i C t S e S | a L3
5
C→b
3
ii.Construct regular expression for the given DFA L3
5

OR
6. i) Design a PDA which accepts L = {WCWr | W ∈ (a +b)*}.
5 L4
ii) Construct a PDA equivalent to the following grammar: 3
5 L3
S →aAA, A →aS | bS | a

7. i. Design Turing machine and its transition diagram to accept the 5 L4

language: L = {a n bn| n >=1} 4
ii. Explain Chomsky hierarchy 5 L2
OR
8. i) Design a TM for finding 2’s complement of a given binary number. 5 L4
4
ii) Demonstrate an overview of Recursively Enumerable Languages 5 L4

9. i.Construct SLR parsing table for following grammar: 5 L2 5

E -> E + T/T 5 L2
T -> T * F/F

F -> (E)/id.
ii.Differentiate between Static and Dynamic Storage allocation
 Strategies.
OR
10. i. Explain the various phases of a compiler with an illustrative example 5 L3
ii. Construct a quadruple, triples for the following expression: 5
a +a*(b-c)+(b-c)*d? 5 L2