Regular Expression Matching Can Be Simple And Fast (2007)
1 comments · compsci, programming
- Comments1
–Rank now
#9Peak rank
1Days on list
–Score · 7d
Oct 31, 2026First seen
On Lobsters
compsciprogramming
- Score
- 4
- Comments
- 1
- Submitted by
- guillaume
- Tags
- compsci, programming
- Site
- swtch.com
Story details from Lobsters ↗ · linked article on swtch.com.
Trending history
Regular Expression Matching Can Be Simple And Fast (2007) was first seen on Lobsters · Hottest on Oct 31, 2026. Since then it has appeared in 1 check on 1 different day. Its best position was #9 of 25, reached on Oct 31, 19:21 UTC. It dropped off the list after Oct 31, 19:21 UTC.
Rank history
Position on Lobsters · Hottest at every check (lower is better).
Last 14 days
Best rank per day (UTC).
9
Oct 26today
From the discussion
A few top-level comments from Lobsters, shortened. Read the full thread on Lobsters.
If I remember correctly, DFA is regex-directed, whereas NFA is text-directed, which explains the curves. It isn't uncommon in modern programming languages to switch between both engines as they see fit
Featured in
Archived daily, weekly and monthly lists that include this entry.
Lobsters 1 day, best #9
Questions
Is Regular Expression Matching Can Be Simple And Fast (2007) trending on Lobsters right now?
Not at the moment. It was last on the list on Oct 31, 19:21 UTC, after 1 day of trending.
What is the highest rank Regular Expression Matching Can Be Simple And Fast (2007) reached?
#9 on Lobsters · Hottest, on Oct 31, 19:21 UTC. Trendoday checks this list every 30 minutes.
How long has Regular Expression Matching Can Be Simple And Fast (2007) been trending?
It was first seen on Oct 31, 2026 and has been on the list on 1 day (1 check) since.