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 decades-old 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 |
Recent comments
26 min 22 sec ago
35 min 44 sec ago
40 min 41 sec ago
7 hours 55 min ago
8 hours 11 min ago
12 hours 53 min ago
15 hours 27 min ago
21 hours 38 min ago
1 day 4 hours ago
1 day 5 hours ago