@pcwalton Russ Cox makes a pretty good case for the Thompson method here: http://bit.ly/1g2dX7s . I'm planning on writing a version in Rust.
-
-
-
@graphenepunk For speed what you really need is a form that's easy to JIT. That's generally recursive backtracking. - 11 more replies
New conversation -
-
-
It's pretty funny you post this just after Cloudflare inflicted a major outage on half the world due to a pathologically backtracking regex. This opinion is fractally wrong - wrong at every level of magnification. PCRE is slower than modern automata-based regular expressions...pic.twitter.com/f343vgGZgU
-
in the extreme pathological case but also on average cases, as both determinization and bitwise implementations are way faster than backtracking. The advantage of PCRE and backtracking is expressiveness, not speed. I don't know whether you're trolling here or just woefully ...
- 6 more replies
New conversation -
-
-
@pcwalton it's just like the hashmap DoS attack a few years back. It too was only theoretical, but people seemed to care a lot about that. -
@jessemcnelis Unlike the hash map problem, a regex DoS can only happen with user-specified regexes, which are not as common.
End of conversation
New conversation -
-
-
@pcwalton This assertion seems testable. What's your defn of real world, though?Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.