GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
-
Updated
Oct 8, 2024 - Rust
GLR, LR(1) LALR(1) parser generator for Rust with custom reduce action
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.
Manipulation, regular expression and automaton library. Allows conversion of regular expressions into automata and analysis of automata and their orbits.
Frame is a markdown language for creating state machines (automata) in Python as well as generating UML documentation.
Sandbox cellular automata simulation in web
A parser for dealing with Hanoi Omega-Automata (HOA) file format.
Virtual Machine.
🦠 Particles of different colors attract or repel each other. Simple rules generate complex behavior.
A low level regular expression library that uses deterministic finite automata.
A persistent state machine for redis
Deterministic Finite-State Automata Library for Rust, written in L1
A Model Checker in Rust
Add a description, image, and links to the automata topic page so that developers can more easily learn about it.
To associate your repository with the automata topic, visit your repo's landing page and select "manage topics."