Hacker News Reader

I sometimes ponder, how much effort it would take to make a similar matching interface not for binaries but for regexps and/or something grammar-like. After structured matching of binaries regexps in elixir just feel awkward.

It wouldn't work well with other matching constructs, though, if matching is baked into beamvm itself as a core instruction for speed or something. Guess I have something to investigate this evening.

View on HN

It's not Elixir, but you might be interested in F#'s active patterns, particularly the parameterized active patterns: https://learn.microsoft.com/en-us/dotnet/fsharp/language-ref...

F#'s active patterns allow you to extend the built-in pattern matching to other things, and in this case, you can have patterns that return regular expression matches.

sounds interesting, thanks.

You could probably write a regex parser in pure Elixir

Reply on news.ycombinator.com