Code for Compiler Design Lab, Semester 7
A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
✨ این یک ریپوزیتوری هستش که بهتون 100 تا ریجکس پترن مفید ایرانی 🇮🇷 میده و خیلی راحت میتونید توی وبسایتها و اپلیکیشنهاتون ازش استفاده کنید و لذت ببرید 🚀📱💻
A RegEx engine that builds NFA/DFA and always returns the longest match.
🍁 Compiler Compiler based on CSharp with GUI Program
This is the repository for DSAAT CP
A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for converting back and forth between them ♻️
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
A program that takes a regular expression and creates an NFA that accepts it. The description of an NFA should be compatible with a NFA 2 DFA program, which means that it can be translated into a form that can be run on a DFA simulator.
Input any regular expression and an NFA for it will be generated.
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
A library for converting a regex to nfa and then to a dfa
A regex compiler using NFA/DFA conversion to build lexers on data streams
Regex to Automata converter
A comprehensive single tape Turing Machine simulator.
Automata implementations
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
Add a description, image, and links to the regex-to-nfa topic page so that developers can more easily learn about it.
To associate your repository with the regex-to-nfa topic, visit your repo's landing page and select "manage topics."