User loginNavigation 
Regular Expression Matching Can Be Simple And FastWith Peter's observation that everything good in Computer Science happened during the "Golden Age" freshly in mind, I found Russ Cox's recent article on regular expressions to be enjoyable reading.
Combining implementation details, finite automata, and a foray into decadesold theory, this article shows how most of our favorite little languages have an enormous performance bottlenecks for certain categories of string comparisons. An additional data point: The Shootout benchmarks have a large string comparison test. It's interesting that Tcl is at the top of the heap for performance. Guess which one is using the Thompson NFA algorithm for regular expressions? 
Browse archives
Active forum topics

Recent comments
19 weeks 1 day ago
23 weeks 3 days ago
25 weeks 22 hours ago
25 weeks 22 hours ago
27 weeks 5 days ago
32 weeks 3 days ago
32 weeks 3 days ago
32 weeks 6 days ago
32 weeks 6 days ago
35 weeks 4 days ago