Determining the parts that match a regex in perl - regex

Question

I'm looking for the accumulation of possibly overlapping matches of a regex (the final goal being to do further searches in the resulting substrings).
I want to skip the matches that have already been "accumulated", while avoiding to make copies with substr (I might be wrong about avoiding substr), but the condition that I wrote for it with pos($...) = ... and a next if $... =~ /.../ doesn't work:
#!/usr/bin/env perl
# user inputs
$regexp = "abc|cba|b";
$string = "_abcbabc_bacba";
$length = length($string);
$result = "0" x $length;
while ( pos($string) < $length and $string =~ /$regexp/go ) {
pos($string) = $-[0] + 1;
next unless ($len = $+[0] - $-[0]);
# The failing condition is here:
# pos($result) = $-[0];
# next if $result =~ /1{$len}/;
substr($result, $-[0], $len) = "1" x $len;
printf "%s\n", $string;
printf "%".$-[0]."s%s\n", "", "^" x $len;
}
printf "%s\n", $result;
By commenting those lines I can get the desired result which is 01111111010111:
_abcbabc_bacba
^^^
_abcbabc_bacba
^
_abcbabc_bacba
^^^
_abcbabc_bacba
^
_abcbabc_bacba
^^^
_abcbabc_bacba
^
_abcbabc_bacba
^
_abcbabc_bacba
^^^
_abcbabc_bacba
^
01111111010111
But my expected output (with a working condition) would be:
_abcbabc_bacba
^^^
_abcbabc_bacba
^^^
_abcbabc_bacba
^^^
_abcbabc_bacba
^
_abcbabc_bacba
^^^
01111111010111
notes:
for each iteration I print the original string; the ^ just below show the characters that have been matched in the current iteration.
the 0 & 1 at the end represent the overall result. The characters that have been matched at least once during the process are set to 1.
My commented condition is meant to skip the current match when its corresponding characters are already set to 1 in the result.

Answer 1

I think you really want to find the longest overlapping sub match. If you can guarantee that the alternation will have the substrings in the order that you prefer them, that approach might work, but it also requires to know a lot about what is happening besides the match, and in future matches. That is, you don't know if you can output anything until you've the future matches that might overlap, and you can't tell how far into the future you need to look.
You can mess around with pos, but I think I'd just match each substring separately, remember the starting positions, then compare later. Decompose the problem into separate tasks for finding the matching positions and for deciding which ones you want.
Even if I wrote the same code you presented, it's unlikely that I'd remember everything that must happen just right to make it all work out if I had to see it again after a long absence (even if I did highlight #- and #+ in the first chapter of Mastering Perl ;)
use v5.10;
use strict;
my $target = "_abcbabc_bacba";
my #looking_for = qw( abc cba b );
my #found;
foreach my $want ( #looking_for ) {
my $pos = 0;
while( my $found_at = index $target, $want, $pos ) {
last if $found_at == -1;
push #found, $found_at;
$pos = $found_at + 1;
}
}
my #found = sort { $a->[1] <=> $b->[1] } #found;
use Data::Dumper;
say Dumper( \#found );
Now you have a data structure that you can massage any way that you like instead of thinking about all this stuff while in regex land. How you decide to do that is left as an exercise for the reader.
$VAR1 = [
[
'abc',
1
],
[
'b',
2
],
[
'cba',
3
],
[
'b',
4
],
[
'abc',
5
],
[
'b',
6
],
[
'b',
9
],
[
'cba',
11
],
[
'b',
12
]
];
Part of this may be inline. You can build up this data structure to the point where you know that everything you have so far can produce output (i.e. the thing you just matched does not overlap with the prior thing).