diff options
| author | Kaz Kylheku <kaz@kylheku.com> | 2010-01-17 08:14:24 -0800 |
|---|---|---|
| committer | Kaz Kylheku <kaz@kylheku.com> | 2010-01-17 08:14:24 -0800 |
| commit | 313673744f11987e0a01cd6c4bfba4cc89964005 (patch) | |
| tree | d0815ccdde5d52288c3daa9a73688b5903ebd625 /txr.1 | |
| parent | a8360e9420ee978e814acbc07f3f7814bea7613d (diff) | |
| download | txr-313673744f11987e0a01cd6c4bfba4cc89964005.tar.gz txr-313673744f11987e0a01cd6c4bfba4cc89964005.tar.bz2 txr-313673744f11987e0a01cd6c4bfba4cc89964005.zip | |
Close parenthesis. De Morgan is two words.
Diffstat (limited to 'txr.1')
| -rw-r--r-- | txr.1 | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -2889,9 +2889,9 @@ that they are of some use. .SS Equivalence to Sets Regexp intersection is not essential; it may be obtained from complement and -union as follows, since DeMorgan's law applies to regular expression algebra: +union as follows, since De Morgan's law applies to regular expression algebra: (R1)&(R2) = ~(~(R1)|~(R2)). (The complement of the union of the complements of -R1 and R2 constitutes the intersection. This law works because the regular +R1 and R2 constitutes the intersection.) This law works because the regular expression operators denote set operations in a straightforward way. A regular expression denotes a set of strings (a potentially infinite one) in a condensed way. The union of two regular expressions R1 | R2 denotes the union of the set |