Skip to content

A powerful toolkit for converting Regular Expressions to DFA and Context-Free Grammars. Built for students, educators, and enthusiasts of Theory of Automata.

License

Notifications You must be signed in to change notification settings

kinza7124/RegexToDFA-CFG-TOAProject

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

RegexToDFA-CFG-TOAProject

A Flask web application that converts regular expressions to Deterministic Finite Automata (DFA), generates equivalent Context-Free Grammars (CFG), and Pushdown Automata (PDA) representations with visualization capabilities.

🚀 Features

  • ✅ Regex to DFA conversion
  • ✅ DFA visualization
  • ✅ CFG generation from regex or DFA
  • ✅ PDA creation from CFG
  • ✅ Web-based interface (Flask)

📦 Installation & Setup

Follow these steps to get the app running locally:

1. Clone the Repository

git clone https://github.com/kinza7124/RegexToDFA-CFG-TOAProject.git
cd RegexToDFA-CFG-TOAProject

2. (Optional) Create a Virtual Environment

# Windows
python -m venv venv
venv\Scripts\activate

# macOS/Linux
python3 -m venv venv
source venv/bin/activate

▶️ Running the App

python app.py
or
flask run

💻Contributing

Contributions are welcome! Follow these steps:

  1. Fork this repository

  2. Create a new branch:

git checkout -b feature-name
  1. Make your changes

  2. Commit:

commit -m "Describe your changes"
  1. Push:
git push origin feature-name
  1. Open a Pull Request on GitHub

📝 License

This project is licensed under the MIT License.

About

A powerful toolkit for converting Regular Expressions to DFA and Context-Free Grammars. Built for students, educators, and enthusiasts of Theory of Automata.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published