401 | 437,500 | 36,874 |
---|---|---|
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 number 1 is not a prime number.