Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^2: Arbitrary number of captures in a regular expression

by throop (Chaplain)
on Sep 24, 2007 at 04:44 UTC ( #640658=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download

  1. or download this
                    # 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.)
  2. or download this
      - 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