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