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的最小化)
These are my programs for compiler design lab work in my sixth semester
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
A Python package for automata theory.
根据正则表达式生成其对应 DFA 的状态转移图
SEU CS Compiler Course Design: Python Implementation of LEX & YACC for Cminus
The Python script uses to convert the E-NFA to DFA and show the result in the web browser
Theory of machines and languages course project.
This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.
a little programm to check if a minecraft account is nfa or sfa
A Python library for simulating and visualizing finite automata
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.
regular language tools - automata-based tokenizer, LL(1) parser
Kumpulan Projek Selama Mengikuti Matakuliah Teori Bahasa dan Otomata
A regular expression engine based on nondeterministic finite automata (NFA)
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."