Hey Chris, Thanks for the reply. It makes more sense now after reading Sutcki's explanation. I have since come across a great Regular Expression Wiki (http://www.wlug.org.nz/RegularExpression) which is hosted by Waikato LinuxUsersGroup (WLUG - http://www.wlug.org.nz/) in New Zealand. Check it out when you don't have a minute to spare. ;)
--Larry > -----Original Message----- > From: Chris Santerre [mailto:[EMAIL PROTECTED] > Sent: Friday, October 10, 2003 5:15 PM > To: 'Larry Gilson'; 'Spamassassin-Talk (E-mail)' > Subject: RE: [SAtalk] Popcorn, Backhair, and Weeds > > > :) > > This is what Jen sent me, I'm not sure what Doc she got it out of: > > > > ************* > > > By default, a quantified subpattern is greedy . In other words > > > it matches as many times as possible without causing the rest > > > of the pattern not to match. To change the quantifiers to match > > > the minimum number of times possible, without causing the rest > > > of the pattern not to > > > match, you may use a "?" right after the quantifier. > > > > > > *? Match 0 or more times > > > +? Match 1 or more times > > > ?? Match 0 or 1 time > > > {n}? Match exactly n times > > > {n,}? Match at least n times > > > {n,m}? Match at least n but not more than m times > > > ************************************************* > > That made sense to me. Maybe {n} is plain regex and {n}? Is > extended? ------------------------------------------------------- This SF.net email is sponsored by: SF.net Giveback Program. SourceForge.net hosts over 70,000 Open Source Projects. See the people who have HELPED US provide better services: Click here: http://sourceforge.net/supporters.php _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
