Thanks Mike, for further help ...
Because of personal interest, I'll keep on trying to implement the XML
well-formedness application by making best use of JDK regex.
When I am convinced, it's not possible to program further with regex,
I'll give up ...
On Feb 4, 2008 1:23 PM, Michael Kay <> wrote:
> "+" is a greedy quantifier, it matches the longest string it can. To match
> the shortest string, use [^/]+? or you could try [^/<]+
>
> But as Amy points out, we're not helping you. We're just taking you one step
> further to demonstrating what is already known as a theoretical result -
> this problem can't be solved using regular expressions.
>
>
> Michael Kay
> http://www.saxonica.com/
--
Regards,
Mukul Gandhi
