Match – A pattern matching language that replaces regex
Match – A pattern matching language that replaces regex
I built Match, a pattern matching language designed to replace regex. Instead of cryptic escape sequences, you describe patterns in plain English. Example — matching an email address: 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 Key differences from regex: - Human-readable grammar syntax - Full parse trees with named extractions - No backtracking, no ReDoS by design - Composable grammar modules (use "module" (rule1, rule2)) - Zero dependencies, ~15KB Available on npm (@hollowsolve/match). Docs, playground, and examples on the site. GitHub: https://github.com/hollowsolve/Match
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Incorrect prediction on native model
Similar products
My first attempt at adding pattern matching to C#
VisualTail graphical tail with pattern matching
Match(it): A C++17 pattern-matching library with lots of good stuffs
Motif – Scala-like pattern matching with Java 8
MarkovJunior, PPL based on pattern matching and constraint propagation
A gem for method overloading based on pattern matching for Ruby
Derive4j – Java8 support for ADTs, pattern matching, and more
Derive4j – Java8 support for ADTs, pattern matching, and more
NPeg – a Nim pattern matching library with nice extras
Egna – basic pattern matching for JS