RE to NFA to DFA, code explanation
[CS-301, THEORY OF AUTOMATA] November 24, 2014
THEORY OF AUTOMATA
Fall 2014-Project
RecM - Regular Expression Combo Machine
GROUP MEMBERS:
NAME
ROLL NO. SECTION
Ali Arslan
13i-1804
C
Burhan Khan
13i-1809
C
Shahryar Shahid 12i-0107
C
[CS-301, THEORY OF AUTOMATA] November 24, 2014
Table of Contents
Acknowledgements ....................................................................................................................... 3
Scope of the Document ................................................................................................................. 3
Code Explanation .......................................................................................................................... 4
Step 01 - Concatenating Input String ....................................................................................... 4
Step 02 - Converting and validating to Postfix String.............................................................. 4
Step 03 - Converting Postfix String to NFA ............................................................................ 4
Step 04 - Conversion to DFA ................................................................................................... 5
Step 05 - Conversion to CFG ................................................................................................... 6
Screenshots .................................................................................................................................... 7
[CS-301, THEORY OF AUTOMATA] November 24, 2014
Acknowledgements
First of all, we owe our deepest gratitude to almighty ALLAH, the Most Merciful and
Compassionate, the Most Gracious and Beneficent, for blessing us strength, health and will power to prevail and finish this work. May Allah accept this work, count it as a good deed and make it useful.
We would like to express our profound thanks and gratitude to our teachers, especially our course instructor Dr. Aftab Maroof, who provided us with
THEORY OF AUTOMATA
Fall 2014-Project
RecM - Regular Expression Combo Machine
GROUP MEMBERS:
NAME
ROLL NO. SECTION
Ali Arslan
13i-1804
C
Burhan Khan
13i-1809
C
Shahryar Shahid 12i-0107
C
[CS-301, THEORY OF AUTOMATA] November 24, 2014
Table of Contents
Acknowledgements ....................................................................................................................... 3
Scope of the Document ................................................................................................................. 3
Code Explanation .......................................................................................................................... 4
Step 01 - Concatenating Input String ....................................................................................... 4
Step 02 - Converting and validating to Postfix String.............................................................. 4
Step 03 - Converting Postfix String to NFA ............................................................................ 4
Step 04 - Conversion to DFA ................................................................................................... 5
Step 05 - Conversion to CFG ................................................................................................... 6
Screenshots .................................................................................................................................... 7
[CS-301, THEORY OF AUTOMATA] November 24, 2014
Acknowledgements
First of all, we owe our deepest gratitude to almighty ALLAH, the Most Merciful and
Compassionate, the Most Gracious and Beneficent, for blessing us strength, health and will power to prevail and finish this work. May Allah accept this work, count it as a good deed and make it useful.
We would like to express our profound thanks and gratitude to our teachers, especially our course instructor Dr. Aftab Maroof, who provided us with