Re^2: greedy subexpression between two nongreedy ones

Although this may be perfectly acceptable, $1 will be undefined if it is not present in the string being searched:

c:\@Work\Perl\monks>perl -wMstrict -le
"for my $s (',abcdefg,pqrstuv', ',abefg,pqrstuv', @ARGV) {
   my $t = $s;
   print qq{'$t'};
   $t =~ s/,(?:.*?(cd))?.*?,/=$1=/;
   print qq{'$t' \n};
   }
"
',abcdefg,pqrstuv'
'=cd=pqrstuv'

',abefg,pqrstuv'
Use of uninitialized value $1 in concatenation (.) or string at -e lin
+e 1.
'==pqrstuv'
[download]

Give a man a fish: <%-(-(-(-<

Comment on Re^2: greedy subexpression between two nongreedy ones Select or Download Code

Replies are listed 'Best First'.
Re^3: greedy subexpression between two nongreedy ones by Anonymous Monk on Jun 02, 2015 at 10:10 UTC
`s/,(?:.(cd))?.,/$1 ? "=$1=" : "=="/e` [download]	[reply] [d/l]
Re^4: greedy subexpression between two nongreedy ones by raygun (Scribe) on Jun 02, 2015 at 19:26 UTC
I see now my problem statement was a little sloppy: I failed to use the same sample text in my first two examples. Namely, I inadvertently omitted the trailing comma in the first example. And sure enough, the answer above (or rather, the three variations on the answer) works on the incorrect example, but still fails on the correct one. `$ echo ,abcdefg,abcdefg \| perl -pe 's/,(?:.?(cd))?.?,/=$1=/' =cd=abcdefg $ echo ,abcdefg,abcdefg, \| perl -pe 's/,(?:.?(cd))?.?,/=$1=/' =cd=abcdefg,` [download] works either way when the "cd" appears between the first two anchors, but if it doesn't: `$ echo ,abcefg,abcdefg \| perl -pe 's/,(?:.?(cd))?.?,/=$1=/' ==abcdefg $ echo ,abcefg,abcdefg, \| perl -pe 's/,(?:.?(cd))?.?,/=$1=/' =cd=` [download] it gives me what I'm looking for only when the final "," is missing. With it, the expression goes back to running past the anchor and stealing from the next blob of text. I need to study the answer below to see if it does what I need, but I had high hopes for the ones above, because I like their simplicity. :-)	[reply] [d/l] [select]
Re^5: greedy subexpression between two nongreedy ones by Anonymous Monk on Jun 02, 2015 at 20:43 UTC
Phony problems lead to phony solutions... Please show the exact problem.	[reply]
Re^6: greedy subexpression between two nongreedy ones by raygun (Scribe) on Jun 03, 2015 at 01:26 UTC
Re^5: greedy subexpression between two nongreedy ones by Anonymous Monk on Jun 02, 2015 at 21:10 UTC
`s#,(?:(?:(?!,).)(cd))?(?:(?!,).),#=@{[$1 // '']}=#` [download] Are there any more requirements you're not telling us?	[reply] [d/l]