An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
A Regular Languages Simulator to help CS students understand and experiment with everything Regular Languages 📕 Includes Regular Expressions (Regexes), DFAs, NFAs, as well as functionality and UI for...
This repository provides a lexer and parser for the Pascal programming language. Both lexer and parser can generate errors indicating the location in the code.
#算法刷题#Deterministic Finite-State Automata Library for Rust, written in L1