9 Repositories
Rust automata Libraries
falling sand sim for tmux 3.4+
termsand this is VERY rough and hacked together in a couple hours it may not work exactly right for you how do i use it this thing is designed to work
Provably optimal zero-copy parsers using nondeterministic finite automata.
inator: an evil parsing library You supply the evil plan; we supply the -inator! or, Provably Optimal Zero-Copy Parsers with Nondeterministic Finite A
3d Cellular Automata using WGPU in Rust (for the web and using compute shaders)
3D-Cellular-Automata-WGPU 3d Cellular Automata using WGPU in Rust (for the web and using compute shaders) The branches are very messy... I recommend y
Sandbox is a pixel physics simulator inspired by other such like Sandspiel and Noita
Sandbox Sandbox is a pixel physics simulator inspired by other such like Sandspiel and Noita. It's also a precursor for an ongoing game project. Sandb
A game of life🔬 simulator on an infinite♾️ plane
game-of-life A game of life 🔬 simulator on an infinite ♾️ plane NOTE: This is a toy project! I did this just for fun, not as a packaged product. Abou
Frame is a markdown language for creating state machines (automata) in 7 programming languages as well as generating UML documentation.
Frame Language Transpiler v0.5.1 Hi! So very glad you are interested in Frame. Frame system design markdown language for software architects and engin
A library and tool for automata and formal languages, inspired by JFLAP
Sugarcubes is a library and application for automata and formal languages. It is inspired by JFLAP, and is intended to eventually to be an alternative to JFLAP.
Web 3.0 Realized with Traceless Privacy and Seamless Compatibility
Automata Build On Ubuntu/Debian (or similar distributions on WSL), install the following packages: sudo apt-get update sudo apt-get install -y build-e
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
regex A Rust library for parsing, compiling, and executing regular expressions. Its syntax is similar to Perl-style regular expressions, but lacks a f