There are 2 repositories under regex-to-nfa topic.
A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
đ Compiler Compiler based on CSharp with GUI Program
Code for Compiler Design Lab, Semester 7
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
A RegEx engine that builds NFA/DFA and always returns the longest match.
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
Resolução dos problemas de Teoria de Computação 2019/2020
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
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.
A comprehensive single tape Turing Machine simulator.
Input any regular expression and an NFA for it will be generated.
This is the repository for DSAAT CP
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
Group Assignment for 01418334(66-2) Compiler Techniques