W3C home > Mailing lists > Public > public-qt-comments@w3.org > July 2003

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

From: Kay, Michael <Michael.Kay@softwareag.com>
Date: Tue, 1 Jul 2003 22:44:02 +0200
Message-ID: <DFF2AC9E3583D511A21F0008C7E62106073DCFA2@daemsg02.software-ag.de>
To: Michael Rys <mrys@microsoft.com>, public-qt-comments@w3.org

I believe the intent is that reluctant quantifiers match the shortest
string, other quantifiers match the longest. I can't work out which example
you think is wrong.

Michael Kay


> -----Original Message-----
> From: Michael Rys [mailto:mrys@microsoft.com] 
> Sent: 01 July 2003 03:03
> 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.
> 
Received on Tuesday, 1 July 2003 16:44:11 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:45:13 UTC