From: Raul Miller rauldmil...@gmail.com
On Thu, Jan 14, 2010 at 6:39 PM, Oleg Kobchenko wrote:
Does it behave differently in Perl?
Perl finds non-overlapping matches by default, but
lets you restart the match at any given position so
you can easily implement the overlapping matches
I don't have one for overlapped matches but do have
one for non-overlapped matches, which may shed some
light on the former.
http://www.jsoftware.com/jwiki/Essays/Non-Overlapping_Substrings
- Original Message -
From: Oleg Kobchenko oleg...@yahoo.com
Date: Friday, January 15, 2010 13:28
On Fri, Jan 15, 2010 at 4:27 PM, Oleg Kobchenko oleg...@yahoo.com wrote:
Note: in regex
(ab)|(cd)
the parens are redundant (unless you want to signal
which alternative triggered).
I want to determine which substring matched.
I can probably get by with i...@e.l:0 but I
will need to think
I alluded to this in a panel discussion at APL'91 on parallelism in APL. I
was making the argument that parallelism raises the level of complexity by
introducing possibilities of interaction absent from serial processing. The
example I gave was doing a search and replace on
AA by B when the
I am not sure, but an overlapping rxmatches could be achieved
by skipping to the next char from the start of last match,
as opposed to the end.
However, looking at the code of rxmatches, we see that in order
to proceed to the remainder of the input, it uses }. Drop
over and over. I don't know if
