Reg. No.

:
Name :

MidTerm Examination - October 2021

Programme : B.Tech (BCY, MEI) Semester : Fall 2021-22
Course : Theory of Computation and Compiler Design Code : CSE2004
Faculty : Dr. Sandip Mal Slot/Class no. : D11+D12+D13/ 0306
Time : 1½ hours Max. Marks : 50

Answer all the Questions

Sub.
Q.No. Question Description Marks
Sec.
Construct regular expression for the following Finite Machine.

1. 10

2. Find a minimum state automation equivalent to the finite automation describe the
following figure.

10

3 a) Build a transition system with minimal state for the following grammar G=({S,A},
{0,1}, P,S) where P consists of 5
S0A, A1A | a, A0S.

Page 1 of 2
 b) Illustrate a regular grammar equivalent to the following regular expression.
5
a*b(a+b)*ba*
4 Construct a grammar which doesn’t have any unused symbols equivalent to the
following grammar G = ({E, A, B, C, D}, {a, b}, P, E) where p consists the
following production rules. 10
EaAb, AbBB, Bab, CaBD, Db

5 Consider the following production rules for a grammar G= ({S, A, B}, {a, b), P, S)
where P are given below.
SaB|bA, AaS|bAA|a, BbS|aBB|b
10
For string aaabbabbba find the left most derivation, right most derivation and parse
tree. Also show whether the grammar is ambiguous or not?



Page 2 of 2