✨ این یک ریپوزیتوری هستش که بهتون 100 تا ریجکس پترن مفید ایرانی 🇮🇷 میده و خیلی راحت میتونید توی وبسایتها و اپلیکیشنهاتون ازش استفاده کنید و لذت ببرید 🚀📱💻
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
A repository containing all experiments for the course Compiler Design.
🍁 Compiler Compiler based on CSharp with GUI Program
Code for Compiler Design Lab, Semester 7
A RegEx engine that builds NFA/DFA and always returns the longest match.
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
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 library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
A comprehensive single tape Turing Machine simulator.
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Automata implementations
A regex compiler using NFA/DFA conversion to build lexers on data streams
This is the repository for DSAAT CP
Resolução dos problemas de Teoria de Computação 2019/2020
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.
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."