Re^2: Reverse engineering regular expressions

But what has that gotten you? At best, a contrived minimal slice of an infinite set. Where, for example, is "asdf;laksjfd;alksjaewraefsdtest134qwefalskdfjaeraf;" (another minimal slice of infinity).

Dave

Comment on Re^2: Reverse engineering regular expressions

Replies are listed 'Best First'.
Re^3: Reverse engineering regular expressions by bsb (Priest) on Aug 02, 2005 at 01:55 UTC
I didn't have time to wait for that one. :) You are right, of course. However, sometimes a slice of an infinite set is enough, say for testing or debugging. Also, regexes with only small characater classes and finite quantifiers do produce useful and complete results. Dominus' book gives you an infinite stream of the matching strings, ordered by length. Still quite a wait in your case.	[reply]