regexp-Brzozowski
Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov] (by coq-community)
agda-regexp-automata
Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma. (by desi-ivanov)
| regexp-Brzozowski | agda-regexp-automata | |
|---|---|---|
| 1 | 1 | |
| 12 | 15 | |
| - | - | |
| 3.9 | 10.0 | |
| 7 months ago | almost 4 years ago | |
| Coq | Agda | |
| MIT License | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
regexp-Brzozowski
Posts with mentions or reviews of regexp-Brzozowski.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-07.
-
Show HN: Regex Derivatives (Brzozowski Derivatives)
Thanks for sharing. I am not familiar with Agda. Will take a look. There is somewhat similar code in COQ: https://github.com/coq-community/regexp-Brzozowski
agda-regexp-automata
Posts with mentions or reviews of agda-regexp-automata.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-03-07.
-
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?
When comparing regexp-Brzozowski and agda-regexp-automata you can also consider the following projects:
analysis - Mathematical Components compliant Analysis Library
ocaml-re - Pure OCaml regular expressions, with support for Perl and POSIX-style strings
re1-rust - A port of re1, Russ Cox’s simple, virtual machine–based regular expression engine
math-comp - Mathematical Components
regex - An implementation of regular expressions for Rust. This implementation uses finite automata and guarantees linear time matching on all inputs.
recross-coq - Regexp engine in Coq for solving regexp crosswords
brzozowski - Brzozowski derivative python sketch
mcilroy-regex - Doug McIlroy's C++ regular expression matching library
redgrep - ♥ Janusz Brzozowski
regexp-Brzozowski vs analysis
agda-regexp-automata vs ocaml-re
regexp-Brzozowski vs ocaml-re
agda-regexp-automata vs re1-rust
regexp-Brzozowski vs math-comp
agda-regexp-automata vs regex
regexp-Brzozowski vs recross-coq
agda-regexp-automata vs recross-coq
regexp-Brzozowski vs brzozowski
agda-regexp-automata vs mcilroy-regex
regexp-Brzozowski vs re1-rust
agda-regexp-automata vs redgrep