Russ Cox personal blog
Regular expression matching can be simple and fast (2007)
This is a tale of two approaches to regular expression matching. One of them is in widespread use in the standard interpreters for many languages, including Perl. The other is used only in a few places, notably most implementations of awk and grep. The two approaches have wildly different performance characteristics:
- Points
- 141
- HN comments
- 113
- Submissions
- 4
- Cited by
- 122 commenters
Software EngineeringMath & Algorithms2024
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| May 21, 2024 | Regular expression matching can be simple and fast (2007) by momonga | 141 | 43 |
| Feb 5, 2009 | Regular Expression Matching Can Be Simple And Fast by ambition | 95 | 17 |
| Feb 9, 2018 | Regular Expression Matching Can Be Simple and Fast (2007) by Toast_25 | 78 | 20 |
| Jun 29, 2019 | Regular Expression Matching Can Be Simple and Fast (2007) by prabhupant | 73 | 33 |
Cited in comments
Linked from 152 Hacker News comments by 122 different people, from Dec 2008 to May 2026.
Most recent:
