Regex is dead. We replaced it(matchlang.com)
matchlang.com
Regex is dead. We replaced it
https://matchlang.com
9 comments
The effort here is laudable, and this is cool! But your real competition isn't regexes, but parser combinator libraries. For cases where readability and matching matter, parser combinators are the go to. It's a bit difficult to see how this improves on that front.
We built Match, a pattern matching language that compiles to WASM and replaces regex with readable grammars.
Instead of this: ^[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$
You write this:
email: username then "@" then domain
username: one or more of (letter, digit, ".", "_", "-")
domain: one or more of (letter, digit, "-") then "." then between 2 and 6 letters
Match features:
- WASM JIT + JS JIT: matches or beats native regex on most patterns
- Linear-time parsing, no backtracking, no ReDoS, ever
- Full parse trees with named extractions, not just match/no-match
- Zero dependencies, ~7KB, MIT licensed
- Composable grammars via modules
Website: https://matchlang.com
Performance: https://matchlang.com/docs/api/performance
GitHub: https://github.com/hollowsolve/Match
Instead of this: ^[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$
You write this:
email: username then "@" then domain
username: one or more of (letter, digit, ".", "_", "-")
domain: one or more of (letter, digit, "-") then "." then between 2 and 6 letters
Match features:
- WASM JIT + JS JIT: matches or beats native regex on most patterns
- Linear-time parsing, no backtracking, no ReDoS, ever
- Full parse trees with named extractions, not just match/no-match
- Zero dependencies, ~7KB, MIT licensed
- Composable grammars via modules
Website: https://matchlang.com
Performance: https://matchlang.com/docs/api/performance
GitHub: https://github.com/hollowsolve/Match
The preferred style here for the titles is more dry, something like "Matchlang: A pattern matching language that replaces regular expressions. Full parse trees, no ReDoS" or a shorter version like "Matchlang: A replacement for regular expressions. Full parse trees, no ReDoS".
If you write in the title "Regex is dead" people will get skeptical and ask for proofs.
If you write in the title "Regex is dead" people will get skeptical and ask for proofs.
How about performance?
Performance breakdown: https://matchlang.com/docs/api/benchmarks
You didn't understand the query
How does yours compare to regexp on performance across many inputs?
Regexp is incredibly fast, I doubt yours comes anywhere close
and then there's the kicker, Ai are really good at crafting regexp, better than writing code to replace it, that's for sure
---
looks like the comment I am replying to has changed the link, it was this one: https://matchlang.com/docs/api/performance
Note to OP, use standard regexp benchmarks
How does yours compare to regexp on performance across many inputs?
Regexp is incredibly fast, I doubt yours comes anywhere close
and then there's the kicker, Ai are really good at crafting regexp, better than writing code to replace it, that's for sure
---
looks like the comment I am replying to has changed the link, it was this one: https://matchlang.com/docs/api/performance
Note to OP, use standard regexp benchmarks
elaborate?
Look at a fast regex library [1] and take a subset of those tests or benchmarks and apply to match.
[1] https://github.com/intel/hyperscan/tree/master
That could be a fun comparison. As someone mentioned, regular expressions are extremely fast, and have been benchmarked forever.
[1] https://github.com/intel/hyperscan/tree/master
That could be a fun comparison. As someone mentioned, regular expressions are extremely fast, and have been benchmarked forever.
Dead? Replaced?... Your toy is cute, but it's more suited as a regex generator, or perhaps parser/"explainer" (but we already have several well-known projects there) than a standalone tool.