An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
May 21, 2024 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
The fast scanner generator for Java™ with full Unicode support
All the weekly lab work of the subject 18CSC304J Compiler Design.
DFA regular expression library & friends
Match tens of thousands of regular expressions within milliseconds - Java bindings for Intel's hyperscan 5
Lex machinary for go.
A low level regular expression library that uses deterministic finite automata.
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
These are my programs for compiler design lab work in my sixth semester
A program to convert the given regular expression to Non Definite Automata (NFA)
A Web Application to convert NFA to DFA.
Visual Automata is a Python 3 library built as a wrapper for the Automata library to add more visualization features.
clex is a simple lexer generator
OCaml code to construct an NFA from a regular expression
Simulations of deterministic finite automata in different languages!
A Python package for automata theory.
根据正则表达式生成其对应 DFA 的状态转移图
Russ Cox/Rob Pike pikevm regex implementation
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."