JSVerbalExpressions
ocaml-re
| JSVerbalExpressions | ocaml-re | |
|---|---|---|
| 4 | 2 | |
| 12,168 | 229 | |
| 0.1% | 2.6% | |
| 7.8 | 8.6 | |
| 6 days ago | 5 days ago | |
| JavaScript | OCaml | |
| MIT License | GNU General Public License v3.0 or later |
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.
JSVerbalExpressions
-
A portable, modern regular expression language
I agree with you. I got tired of fighting with regex where I got to the point of simply not using it if at all possible.
A comment further up offered a very promising alternative.
https://github.com/VerbalExpressions/JSVerbalExpressions#tes...
It's a bit verbose, but I don't care anymore, I am too much a veteran to care about my code being sleek, I want it readable and workable.
-
Melody - A language that compiles to regular expressions and aims to be more easily readable and maintainable
There is also VerbalExpressions with a somewhat similar idea
-
Regular expressions vs Me
JSVerbalExpressions — construct regular expressions with natural language terms
-
Super-expressive – Write regex in natural language
https://github.com/VerbalExpressions/JSVerbalExpressions
ocaml-re
-
Show HN: Regex Derivatives (Brzozowski Derivatives)
Note that it's not difficult to (lazily or not) build a NFA using derivatives as well (with Antimirov's construction).
[1]: https://github.com/ocaml/ocaml-re/
-
Super-expressive – Write regex in natural language
I'm familiar with standard (compact) regex syntax, but I've been using the above syntax recently in a couple small places. I'm a bit on the fence as to which is "better". The compact syntax is, of course, more compact. I think it's a very similar comparison between APL (which I've not used) and most other common programming languages.
One advantage of the expanded syntax is that it's a bit nicer to incorporate a string variable, e.g. "str some_string" vs. "/#{Regexp.escape(some_string)}/" (to borrow Ruby's syntax).
[1] https://github.com/ocaml/ocaml-re
What are some alternatives?
melody - Melody is a language that compiles to regular expressions and aims to be more readable and maintainable
google-drive-ocamlfuse - FUSE filesystem over Google Drive
super-expressive - 🦜 Super Expressive is a zero-dependency JavaScript library for building regular expressions in (almost) natural language
recross-coq - Regexp engine in Coq for solving regexp crosswords
logstash-patterns - Grok patterns for parsing and structuring log messages with logstash
mcilroy-regex - Doug McIlroy's C++ regular expression matching library
fluent-plugin-grok-parser - Fluentd's Grok parser
regex - Regex to parse translator
agda-regexp-automata - Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.
common-regex - Most common regex
regexp-Brzozowski - Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]