4 ms·
It's regular expressions via derivatives which is sanely representable in functional programming fashion. Matching a single string doesn't need the caching laye
by JonChesterfield 2y ago
It's regular expressions via derivatives which is sanely representable in functional programming fashion. Matching a single string doesn't need the caching layers for termination, you could do this in C++ templates if you have the patience. Nice to see it in typescript syntax.
- jonstewart 2y agoHana Dusikova did this in C++ several years ago, with her CTRE library. https://github.com/hanickadot/compile-time-regular-expressions https://github.com/hanickadot/compile-time-regular-expressio... Of course, it has all the usual tradeoffs of compile-time template programming.
- gpderetta 2y agoAlso relevant Boost.Expressive, by Eric Niebler, from 2007.