News for hackers. Stuff that matters.

A comment on Regex literals optimization (or how to cheat on benchmarks). Parent comment

Re:Regex literals optimization (or how to cheat on benchmarks) by fizbin on Sunday December 13, 2020 @09:06PM (#25412725)
As an aside, it's possible to modify Laurikari's algorithm slightly and obtain PCRE semantics w.r.t. capturing groups, and those correctly. (POSIX capturing semantics are designed for standards specs. I've never met an actual practicing programmer who wanted those semantics instead of the PCRE ones)
[ Parent | on HN ]
Re:Regex literals optimization (or how to cheat on benchmarks) by nitely on Sunday December 13, 2020 @10:03PM (#25413064)
That's good to know. Is there an implementation of it? I know of TRE, regex-tdfa, ocaml-regex-tfa, and re2c, they all implement Laurikari's algorithm (or a variation of it), but have POSIX semantics.
[ Parent | on HN ]