Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
-
Updated
Apr 22, 2021 - Python
#
regex-to-nfa
Here are 25 public repositories matching this topic...
A repository containing all experiments for the course Compiler Design.
computer-science python3 parsing-expression-grammar lexical-analysis compiler-design automata-theory predictive-parsing intermediate-code-generation shift-reduce-parsers regex-to-nfa nfa-to-dfa-conversion first-follow-compiler
-
Updated
Apr 27, 2021 - Python
🍁 Compiler Compiler based on CSharp with GUI Program
parser-generator regular-expression lexer-generator lexical-analyzer compiler-construction dfa-minimization scanner-generator shift-reduce-parsers slr-parser compiler-compiler regex-to-nfa nfa-to-dfa-conversion
-
Updated
Oct 21, 2022 - C#
Code for Compiler Design Lab, Semester 7
java-8 java-library compiler-design lexical-parser assembly-x86 lalr-parser top-down-parser-with-backtracking slr-parser regex-to-dfa-java regex-to-nfa bottom-up-parser
-
Updated
Nov 3, 2019 - Java
A RegEx engine that builds NFA/DFA and always returns the longest match.
-
Updated
Dec 20, 2024 - 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 ♻️
regex regular-expression nfa dfa regex-engine regular-languages dfa-minimization dfa-construction dfa-simulator regex-to-nfa nfa-to-dfa-conversion regex-parser nfa-to-regex gnfa nfa-simulator regex-simulator
-
Updated
Oct 1, 2024 - TypeScript
A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.
automata automata-simulator dfa-construction regex-to-nfa nfa-to-dfa-conversion automata-and-formal-languages finite-automaton nfa-to-regex
-
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
Automata implementations
pda tfa context-free-grammar automata-theory dfa-minimization dfa-construction regex-to-nfa nfa-to-dfa-conversion epsilon-nfa
-
Updated
May 19, 2024 - C++
Conversions between NFA, DFA, regex and DFA minimization, Automata Theory | Spring 2021
-
Updated
May 30, 2021 - Python
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
regex ocaml programming-challenge edit-distance nfa lcs-distance suffix-array regex-to-nfa thompson-algorithm nfa-to-regex
-
Updated
Jul 10, 2020 - OCaml
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 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.
python cpp graphs regex networkx nfa dijkstra-algorithm dijkstra-shortest-path graphs-theory matplotlib-pyplot regex-to-nfa graphs-algorithms
-
Updated
May 27, 2023 - C++
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
Regex to Automata converter
-
Updated
Apr 16, 2024 - C#
Improve this page
Add a description, image, and links to the regex-to-nfa topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the regex-to-nfa topic, visit your repo's landing page and select "manage topics."