An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）

A Python library for simulating and visualizing finite automata

These are my programs for compiler design lab work in my sixth semester

Some toy labs for compiler course

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 的状态转移图

A tiny library which contains tools to convert, minimize and visualize Regular Expressions, NFA and DFA.

rule matcher (context free grammar)

A Shotgun Toolkit app to create flipbook of your current scene with use of SGTK templates.

Theory of machines and languages course project.

SEU CS Compiler Course Design: Python Implementation of LEX & YACC for Cminus

regular language tools - automata-based tokenizer, LL(1) parser

A regular expression engine based on nondeterministic finite automata (NFA)

a little programm to check if a minecraft account is nfa or sfa

A startup app for engines in Shotgun Toolkit.

I was asked to write a Python program to execute regular expressions on strings using an algorithm known as Thompson's construction. In this, I have to build a non-deterministic finite automaton (NFA) from a regular expression, and can use this to check if the regular expression matches any given string text

The Python script uses to convert the E-NFA to DFA and show the result in the web browser

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)

Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.