An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
-
Updated
Dec 8, 2022 - Rust
An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
DFA regular expression library & friends
The fast scanner generator for Java™ with full Unicode support
Lex machinary for go.
A low level regular expression library that uses deterministic finite automata.
A lexical analyzer based on DFA that is built using JS and supports multi-language extensions / 一个基于DFA的支持多语言扩展的JS版开源词法分析器
Pure OCaml regular expressions, with support for Perl and POSIX-style strings
The high performance pinyin tool for java.(java 高性能中文转拼音工具。支持同音字。)
The jieba-analysis tool for java.(基于结巴分词词库实现的更加灵活优雅易用,高性能的 java 分词实现。支持词性标注。)
An Active Automata Learning Library Written in Python
python package for DFA (Detrended Fluctuation Analysis) and related algorithms
An implementation of regular expressions for Python that uses a finite state automaton(正则引擎的Python实现,包括从NFA到DFA和DFA的最小化)
Подсистема 1С для работы с HTTP
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."