Tim> re1 in re2 Tim> should be True iff the language accepted by re1 is a subset of Tim> the language accepted by re2. In this case, it's OK to consider Tim> the empty language a subset of all others, since nobody will be Tim> able to make head or tail out of the code anyway. Note the distinction between the empty language and the empty string. As a language is a set of strings, the empty language is one that contains no strings, not even the empty string. Therefore, a regular expression that accepts the empty language is one that rejects every string, even the empty string. Pedantically y'rs --ark
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4