RE: MS-FO-LC1-048: shortest vs longest match.

Michael:

The text says...
"The effect of these quantifiers is that the regular expression matches
the shortest possible substring consistent with the match as a whole
succeeding. In the absence of these quantifiers, the regular expression
matches the longest possible substring."

I'm not sure which example in fn:tokenize you think is wrong.  If can be
more specific, I'll take a look.

All the best, Ashok
> -----Original Message-----
> From: public-qt-comments-request@w3.org [mailto:public-qt-comments-
> request@w3.org] On Behalf Of Michael Rys
> Sent: Monday, June 30, 2003 7:03 PM
> To: public-qt-comments@w3.org
> Subject: MS-FO-LC1-048: shortest vs longest match.
> 
> 
> Class: Editorial/Technical
> 
> Do only reluctant or all quantifiers match shortest? If only
reluctant,
> then example in 7.5.4 is wrong.
>