[Haskell-cafe] Haskell performance when it comes to regex?
jo at durchholz.org
Tue May 30 10:27:04 UTC 2017
Am 30.05.2017 um 12:08 schrieb Chris Dornan:
> I would generally recommend TDFA, unless you need the highest performance
> (as in this case) or Perl-style REs.
Just for the record: Be aware the PCRE isn't the fastest regex engine
out there. It's generally good, but (a) it's doing backtracking which
can make it exponentially slow, and (b) since Perl regexes have so many
features, the PCRE engine cannot apply all optimizations that a highly
optimized RE engine could.
As always, if speed is an issue, assumptions and word of mouth need to
be verified using benchmarks.
More information about the Haskell-Cafe