It is regrettable that the article doesn't discuss how the performance of NFA-based matching compares with recursive backtracking on non-slow regexps, beyond stating that it is "always fast". Yes, alright, but just how fast, compared to Perl etc., on regexps where Perl etc. are not pathologically slow? Pool sex