Scribd
Upload
15 views9 pages

Anirudh Compiler Assesment

Uploaded by

aaggarwal4be21
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
15 views9 pages

Anirudh Compiler Assesment

Uploaded by

aaggarwal4be21
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/ 9

COMPILER CONSTRUCTION

UCS802

LAB ASSIGNEMENT 1
Regular Expression to DFA

Submitted By:
ANIRUDH 102103313

BE Third Year-
Group: 4CO`11

Date:- 19-09-2024

Submitted To
Dr. Geeta Kasana
Assistant Professor

Computer Science and Engineering Department


Thapar Institute of Engineering and Technology, Patiala
July-December 2024
Q1. Design a Minimized DFA for the Regular Expression (a/b)*abb i.e. All strings ending with abb. This will
involve three steps:

• Generate the NFA using Thomson’ s Construction (3 Marks) (2 Lab of 2 Hrs.)


• Generate the DFA using Subset Construction (5 marks) (3 Labs of 2 Hrs. each)
• Minimize the DFA generated (2 Marks)(2 Labs of 2 Hrs. each)

ANS:
CODE
OUTPUT:
Case 1: input: “bbaabb”

Case 2: input: “bbaababbb”


Detailed Solution:

You might also like