Automata implementations
-
Updated
May 19, 2024 - C++
Automata implementations
Regex to Automata converter
A RegEx engine that builds NFA/DFA and always returns the longest match.
Group Assignment for 01418334(66-2) Compiler Techniques
Input any regular expression and an NFA for it will be generated.
This is the repository for DSAAT CP
🍁 Compiler Compiler based on CSharp with GUI Program
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
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.
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
Resolução dos problemas de Teoria de Computação 2019/2020
Code for Compiler Design Lab, Semester 7
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."