Vel Tech High Tech

Dr.Rangarajan Dr.Sakunthala Engineering College

An Autonomous Institution
CONTINUOUS INTERNAL ASSESSMENT- III QUESTION BANK
Fifth Semester
COMPUTER SCIENCE AND ENGINEERING
CS8501 – THEORY OF COMPUTATION
(Regulations 2017)
PART - A
1. Define free grammar.
2. What is derivation?
3. What is derivation tree?
4. What is an useless symbol?
5. Identify and Eliminate the E-production from the following grammar. S-> as |bA|E A->E
6.What are the types of derivation?
7.What is CFL?
8.What is an ambiguous grammar?
9.Identify and Eliminate the useless symbol, from the following grammar. S-> AB|a A-> a
10.What is unit production?

PART – B
1. Distinguish between CNF and GNF?
2. Construct the CNF and GNF for the Grammar.
A1 -> A2 A3
A2 -> A3A1|b
A3 -> A1A2 | a
3. Discuss the CFG, Parse Trees, Ambiguity in Context Free Grammars with example.
4. Construct the following Grammar in CNF
S -> bA | ab
A -> bAA | as | a
B -> aBB | bs | b
5. Discuss about Grammar and define the types of Grammar.
6. Construct the CNF and GNF for the Grammar.
A1 -> A2 A3
A2 -> A3A1|b
A3 -> A1A2 | a
7.Discuss about the Basic Definitions of Push Down Automata.
8. Distinguish between CFL, CNF and GNF?

PART – C
1.Discuss the methods for the simplification of CFG
2.Construct the following Grammar in CNF
S -> bA | ab
A -> bAA | as | a
B -> aBB | bs | b
3. When is a grammar said to be ambiguous? Explain with the help of an example.
4. Construct a equivalent Grammar G in CNF for the Grammar. also discuss the procedure to convert the
Grammar into CNF.