Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
30 views1 page

B.Tech Midterm: Computation & Compiler

important question of theory of computation and compiler design

Uploaded by

Indrajeet kumar Mehta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views1 page

B.Tech Midterm: Computation & Compiler

important question of theory of computation and compiler design

Uploaded by

Indrajeet kumar Mehta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Reg. No.

:
Name :

MID TERM EXAMINATIONS – Nov 2024


Programme : B.Tech. Semester : Interim Semester 2024-25
Course Title/ : Theory Of Computation And Compiler :
Slot B21+E14+E22
Course Code Design / CSE2004
Time : 1 ½ hours Max. Marks : 50

Answer all the Questions

Sub.
Q.No. Question Description Marks
Sec.

Construct the transition diagram and the transition table of the DFA for accepting the
1 a) 5
strings, which are starting with “aa” and ending with “bb”.
Write down the Regular expression of the following DFA by using state elimination
method.

b) 5

Try to minimize the number of states of the given DFA with procedure.

2 10

Construct a Deterministic PDA for language L = {anbn | n ≥ 1} and draw the transition
3 10
diagram.
Find out whether L={aibici | i>=1} is context free or not using Pumping Lemma
theorem for the following cases
4 10
i) with only one type of symbol and
ii) more than one kind of symbols.
Convert the following Context Free Grammar to Greibach Normal Form using left
recursive and assigning the variable in ascending order.
5 S→ABA | AB | BA | AA | B 10
A→aA | a
B→bB | b


Page 1 of 1

You might also like