| 439 | 477,068 | 39,359 |
|---|---|---|
| articles | words | lines of code |
A regular expression, without much rigor, is a very compact way of representing several different strings. Given a regular expression (regex), can I find out all the strings the regex can find?
The 2 hardest problems in programming are naming, cache invalidation, and off-by-one errors.
