Given two regex patterns R1 and R2, is it possible at all to determine/calculate:

- whether R1 is "a subset of" R2, i.e. all strings that match R1 will also always match R2, but not necessarily the other way around;

- whether R1 is "equivalent" or "equal" to R2, i.e. all strings that match R1 will also always match R2, and all strings that match R2 will also always match R1.

- whether R1 does not "intersect" R2, i.e. no string can match both R1 and R2 at the same time, a string can match either R1 or R2 but never both.

--
dave



--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]



Reply via email to