regular language tools - automata-based tokenizer, LL(1) parser
-
Updated
Dec 17, 2016 - Python
regular language tools - automata-based tokenizer, LL(1) parser
word filtering demo implement by dfa and trie
Deterministic Finite Automata: This program analyzes a string of 0's and 1's, manually or automatically, and tells you if the string have the same number of 0's than 1's. Also. It works with an automata
Experiments with Direct Feedback Alignment and comparison to Backpropagation.
A Python implementation to convert a Deterministic Finite Automata to Regular Expression using state elimination method
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
Speechart lets you create artful visualizations of language data, including morphemes and IPA pronunciations.
Python implementation of DFA and Turing Machine
Testing ground for various python shenanigans.
根据正则表达式生成其对应 DFA 的状态转移图
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."