An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
-
Updated
Jan 2, 2023 - Python
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
A repository containing all experiments for the course Compiler Design.
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)
Implementation of finite-state machines and exportation to dot format
AUT Formal Languages and Automata course programming assignment
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
Regex -> ε-NFA -> DFA -> minDFA, lexical analysis
Midterm project of Theory of languages and automata - Mentorship
Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression
eNFA - NFA, DFA - DFA minimization, CNF and CKY
Analizador léxico que genera y simula AFNs y AFDs a partir de una expresión regular
Theory of Machines and Languages Project
Lexical analysis in python
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
A simple script to convert Python regular expression to expressions following the formal defintion
Lambda-NFA to DFA real-time visualizer
Add a description, image, and links to the nfa-to-dfa-conversion topic page so that developers can more easily learn about it.
To associate your repository with the nfa-to-dfa-conversion topic, visit your repo's landing page and select "manage topics."