This one time, at band camp, Alexander Samad wrote: >looking for 1 regex statement and perlre is the standard I think, the >sort of thing I was thinking of but really ugly was (where [:1:] - set >of chars that meets rule 1 above) > > ([:1:]+[:2:]+[:3:]+|[:1:]+[:2:]+[:4:]+|...) rather long and painful
So you'd need each of the permutations for the 3 of 4 matches, (4P3, I think: 24 permutations) though you can compress each permutation into a single regex match with [[:upper:][:lower:][:digit:]]. That still ends up being (about 25 characters above, plus a bit of padding for extra grouping symbols) a regex of 600 characters or more, with the advantage that the structure of the regex gives no hints that it performs the above computation. Have fun! -- [EMAIL PROTECTED] http://spacepants.org/jaq.gpg -- SLUG - Sydney Linux User's Group Mailing List - http://slug.org.au/ Subscription info and FAQs: http://slug.org.au/faq/mailinglists.html
