redgrep
agda-regexp-automata
redgrep | agda-regexp-automata | |
---|---|---|
4 | 1 | |
150 | 15 | |
0.7% | - | |
5.8 | 10.0 | |
2 months ago | almost 4 years ago | |
C++ | Agda | |
Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
redgrep
-
Show HN: Regex Derivatives (Brzozowski Derivatives)
I don't think Rust regex engine relies on this technique. I guess the main point is when you construct the DFA directly you still have the possibility of the exponential explosion of the number of states. That's why modern engines balance between NFA/DFA and lazy DFA.
Though there is an implementation that relies only on Brzozowski derivatives: https://github.com/google/redgrep
-
Introducing: Pomsky (formerly Rulex)
redgrep did it though: https://github.com/google/redgrep
- Redgrep – grep based on regex derivatives, matches in linear time
-
Speed of Rust vs. C
It couldn't figure it out from looking through ripgrep's website: does ripgrep support intersection and complement of expressions? Like eg https://github.com/google/redgrep does.
Regular languages are closed under those operations after all.
agda-regexp-automata
-
Show HN: Regex Derivatives (Brzozowski Derivatives)
And here the formalized proof in less than 150 lines of code (in Agda) for Brzozowski Derivatives for regex matching (and additional regular languages theorems): https://github.com/desi-ivanov/agda-regexp-automata
What are some alternatives?
ixy-languages - A high-speed network driver written in C, Rust, C++, Go, C#, Java, OCaml, Haskell, Swift, Javascript, and Python
ocaml-re - Pure OCaml regular expressions, with support for Perl and POSIX-style strings
smartstring - Compact inlined strings for Rust.
re1-rust - A port of re1, Russ Cox’s simple, virtual machine–based regular expression engine
libskry_r - Lucky imaging library
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
barre - A Regular Expression Library and CFG parser for Rust using Brzozski Derivatives
recross-coq - Regexp engine in Coq for solving regexp crosswords
fst - Represent large sets and maps compactly with finite state transducers.
mcilroy-regex - Doug McIlroy's C++ regular expression matching library
ixy - A simple yet fast user space network driver for Intel 10 Gbit/s NICs written from scratch
brzozowski - Brzozowski derivative python sketch