regex-to-nfa
Here are 28 public repositories matching this topic...
Language:All
Sort:Most stars
A repository containing all experiments for the course Compiler Design.
- Updated
Apr 27, 2021 - Python
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
- Updated
Apr 22, 2021 - Python
🍁 Compiler Compiler based on CSharp with GUI Program
- Updated
Oct 21, 2022 - C#
Code for Compiler Design Lab, Semester 7
- Updated
Nov 3, 2019 - Java
A RegEx engine that builds NFA/DFA and always returns the longest match.
- Updated
Feb 22, 2025 - PureBasic
A web application to demonstrate conversion from regular expression to NFA and NFA to DFA.
- Updated
Jun 9, 2022 - JavaScript
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 ♻️
- Updated
Oct 1, 2024 - TypeScript
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
- Updated
Jun 2, 2022 - TypeScript
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
- Updated
Mar 18, 2022 - Python
This is the repository for DSAAT CP
- Updated
Dec 31, 2022 - JavaScript
A regex compiler using NFA/DFA conversion to build lexers on data streams
- Updated
Sep 6, 2024 - C
Automata implementations
- Updated
May 19, 2024 - C++
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
- Updated
Jan 1, 2022 - Python
A comprehensive single tape Turing Machine simulator.
- Updated
Oct 30, 2018 - Java
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.
- Updated
May 15, 2022 - Python
Resolução dos problemas de Teoria de Computação 2019/2020
- Updated
Jul 10, 2020 - OCaml
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm
- Updated
May 28, 2021 - Python
A library for converting a regex to nfa and then to a dfa
- Updated
Aug 22, 2024 - C#
Input any regular expression and an NFA for it will be generated.
- Updated
May 27, 2023 - C++
Improve this page
Add a description, image, and links to theregex-to-nfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with theregex-to-nfa topic, visit your repo's landing page and select "manage topics."