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 archivesActive forum topics
New forum topics

Recent comments
6 hours 9 min ago
12 hours 12 min ago
13 hours 37 min ago
13 hours 44 min ago
22 hours 53 min ago
22 hours 54 min ago
1 day 3 hours ago
1 day 3 hours ago
1 day 7 hours ago
1 day 18 hours ago