[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Sorting substitution instructions by max. length o
> Can you think of an example input "ababaaaaaaaaa' regex: a+ba+ so the longest match has length 11 (the last 11 characters) but the algorithms as posted report length 3 (matching the first three characters) because that first match eats the second a thus preventing any further matches. If this is really a problem I think you have to go back to stepping through by hand, but this time eating one character at a time rather than removing everything up to the last match. David ________________________________________________________________________ The Numerical Algorithms Group Ltd is a company registered in England and Wales with company number 1249803. The registered office is: Wilkinson House, Jordan Hill Road, Oxford OX2 8DR, United Kingdom. This e-mail has been scanned for all viruses by Star. The service is powered by MessageLabs. ________________________________________________________________________
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|