Help for this page
# We're hunting the (properly bracketed)
$str =~ # 'm \d+' occurrences. They must be
(?:m \s \d+ \s)* # Any number of m \d+ groups.
bar)/xg; # Finally terminated with bar (though not
# necessarily the end of string.)
- starts at the current 'beginning' of the string
- matches the 'm \d+' at the current position
- matches (aft) all the remaining 'm \d+' and the final bar
- and THROWS AWAY the fore and aft matches (they're non-capturi
By rote learning.
Via Genetic memory.
It's provided by my firmware.
I just remember them.
Thirty days hath September
My computer gets it right, usually.
I just ask someone else.
Someone punches me on the first of the month.
Results (133 votes),