regex
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
- 4.1k
- Rust
- Apache-2.0
- 3 d ago
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
These are my programs for compiler design lab work in my sixth semester
Interactive step-by-step NFA to DFA converter with live graph visualization, powerset subset construction animation, ε-closure transition tables, and offline PWA support.
Implementation of a Finite Automaton Comparator in C++. The input finite automaton can be deterministic or non-deterministic.
A Python program that uses an NFA to check if a regular expression matches a given string
Implementation of a Non-deterministic Finite Automaton in C++. The program can show the dead states, check if the NFA is a DFA and analyze a string to see if it belongs to the NFA.