DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BAPATLA ENGINEERING COLLEGE::BAPATLA

AUTONOMOUS

CLASS:II/IV B.Tech A,B&C Max.Marks:10

SUB:atfl/14CS502 DATE:23/9/2016 Duration:50mins

1. State pumping lemma for regular languages

2. List out closure properties of regular languages
3. What is CFL
4. What is CFG
5. What is Left most derivation
6. What is right most derivation
7. What is derivation
8. What is parse tree
9. What is nullable variable
10. What is unit production
11. What is epsilon production
12. What is useless symbol
13. What is reduced grammar
14. What is CNF
15. What is GNF
16. What is the language of CFG
17. What is sentential form
18. What is the use of pumping lemma

1. a). Construct CFG for L={0a 1b 2c / b=a+c}

b). Give left most, right most derivations and parse tree for the string ‘aabbabba’ to the
grammar
SaB | bA
Aa | aS | bAA
Bb | bS | aBB
2. a). Construct CFG for L={ai bj ck / i=j or j=k}
b). Show that the following grammar is ambiguous.
EE+E | E*E | E |id
3. Convert the following into CNF.
SAACD
AaAb | ε
CaC | a
DaDa | bDb | ε
4. Convert the following into GNF
G=({A1,A2,A3 }, {a,b}, P, A1)
P: A1 A2A3
A2 A3A1 | b
A3 A1A2 | a
5. a). Give the proof of pumping lemma for regular languages.
b). Prove that L={0p/ p is prime} is not regular.

6. a). Minimize the following DFA.

0 1
A B A
B A C
C D B
*D D A
E D F
F G E
G F G
H G D

b). Construct grammar for the language L={ambn |m≥n}