3 ms·
> The first industrial implementation of derivatives for standard regexes in an imperative language (C#) materialized a decade later [Saarikivi et al. 2019] No
by kazinator 1y ago
> The first industrial implementation of derivatives for standard regexes in an imperative language (C#) materialized a decade
later [Saarikivi et al. 2019]
Nope; I did it in TXR in early 2010:
b839b5a212fdd77c5dc95b684d7e6790292bb3dc Wed Jan 13 12:24:00 2010 -0800 Impelement derivative-based regular expressions.
- def-lkb 1y agohttps://sourceforge.net/projects/libre/ https://sourceforge.net/projects/libre/ dates back to 2001. (One could object it is not imperative enough, whatever that means :))
- burntsushi 1y agoThe claim here wasn't just "first implementation of derivatives." It was a far more precise "first industrial implementation of derivatives for standard regexes in an imperative language."
- high_na_euv 1y agoWhats TXR
- gjm11 1y agoIt isn't clear to me what exactly OP means by "industrial" but it seems possible that they might not consider it to apply to TXR.
- kazinator 1y agoI implemented it as a committed feature in a programming language designed to be used for solving problems in the real world, rather than accompanying academic research into the topic. No different from what was done in C#.
- burntsushi 1y agoWhat is TXR? Was this implementation really "industrial"? Did it have the caching present in RE# to avoid worst case exponential compile times? Did it support Unicode? Did it have prefilters? What kind of match semantics did it support? "industrial" in this context to me means something like, "suitable for production usage in a broad number of scenarios." IDK if RE# lives up to that, but their benchmark results are impressive. This paper is a year old. In which production systems is RE# used?