Ah! Of course! Thank you. But no, you're right, it doesn't work on the
find-the-longest problem. (Result is a recursion overrun; hm.)
"We are working on some minor configuration/security issues which may
result in odd behavior over the next 24-48 hours." -- notice on a BBS
On Jan 18, 2005, at 5
On Tue, Jan 18, 2005 at 04:40:54PM -0500, Charles Hartman wrote:
> find 'abca' in string 'abcabca'
>
> Every *single* RE I can think of misses the second instance (beginning
> in position 3) in the first example, because it's eaten the beginning
> of it in finding the first instance.
Look
Sorry, I know this isn't CompSci 101, but if any can help I'll
appreciate it.
My question about regular expressions (any language, I suppose) has to
do with finding *overlapping* and (relatedly) *longest* matches. Two
examples:
find 'abca' in string 'abcabca'
find longest '(a[a
