There are 2 repositories under regex-to-nfa topic.
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
Resolução dos problemas de Teoria de Computação 2019/2020
This is the repository for DSAAT CP
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Automata implementations
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.
A library for converting a regex to nfa and then to a dfa
The C code that obtains an NFA machine from a regular expression using the Thompson construction algorithm has been shared.
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
Regex to NFA and simulation of lex tool
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
A Python tool for converting between regular expressions, DFA, NFA, and eNFA, helping users visualize and understand automata transformations in formal language theory.