Commit | Line | Data |
---|---|---|
a0d0e21e | 1 | =head1 NAME |
d74e8afc | 2 | X<regular expression> X<regex> X<regexp> |
a0d0e21e LW |
3 | |
4 | perlre - Perl regular expressions | |
5 | ||
6 | =head1 DESCRIPTION | |
7 | ||
5d458dd8 | 8 | This page describes the syntax of regular expressions in Perl. |
91e0c79e | 9 | |
cc46d5f2 | 10 | If you haven't used regular expressions before, a quick-start |
91e0c79e MJD |
11 | introduction is available in L<perlrequick>, and a longer tutorial |
12 | introduction is available in L<perlretut>. | |
13 | ||
14 | For reference on how regular expressions are used in matching | |
15 | operations, plus various examples of the same, see discussions of | |
16 | C<m//>, C<s///>, C<qr//> and C<??> in L<perlop/"Regexp Quote-Like | |
17 | Operators">. | |
cb1a09d0 | 18 | |
0d017f4d WL |
19 | |
20 | =head2 Modifiers | |
21 | ||
19799a22 | 22 | Matching operations can have various modifiers. Modifiers |
5a964f20 | 23 | that relate to the interpretation of the regular expression inside |
19799a22 | 24 | are listed below. Modifiers that alter the way a regular expression |
5d458dd8 | 25 | is used by Perl are detailed in L<perlop/"Regexp Quote-Like Operators"> and |
1e66bd83 | 26 | L<perlop/"Gory details of parsing quoted constructs">. |
a0d0e21e | 27 | |
55497cff | 28 | =over 4 |
29 | ||
54310121 | 30 | =item m |
d74e8afc | 31 | X</m> X<regex, multiline> X<regexp, multiline> X<regular expression, multiline> |
55497cff | 32 | |
33 | Treat string as multiple lines. That is, change "^" and "$" from matching | |
14218588 | 34 | the start or end of the string to matching the start or end of any |
7f761169 | 35 | line anywhere within the string. |
55497cff | 36 | |
54310121 | 37 | =item s |
d74e8afc ITB |
38 | X</s> X<regex, single-line> X<regexp, single-line> |
39 | X<regular expression, single-line> | |
55497cff | 40 | |
41 | Treat string as single line. That is, change "." to match any character | |
19799a22 | 42 | whatsoever, even a newline, which normally it would not match. |
55497cff | 43 | |
f02c194e | 44 | Used together, as /ms, they let the "." match any character whatsoever, |
fb55449c | 45 | while still allowing "^" and "$" to match, respectively, just after |
19799a22 | 46 | and just before newlines within the string. |
7b8d334a | 47 | |
87e95b7f YO |
48 | =item i |
49 | X</i> X<regex, case-insensitive> X<regexp, case-insensitive> | |
50 | X<regular expression, case-insensitive> | |
51 | ||
52 | Do case-insensitive pattern matching. | |
53 | ||
54 | If C<use locale> is in effect, the case map is taken from the current | |
55 | locale. See L<perllocale>. | |
56 | ||
54310121 | 57 | =item x |
d74e8afc | 58 | X</x> |
55497cff | 59 | |
60 | Extend your pattern's legibility by permitting whitespace and comments. | |
61 | ||
87e95b7f YO |
62 | =item p |
63 | X</p> X<regex, preserve> X<regexp, preserve> | |
64 | ||
632a1772 | 65 | Preserve the string matched such that ${^PREMATCH}, ${^MATCH}, and |
87e95b7f YO |
66 | ${^POSTMATCH} are available for use after matching. |
67 | ||
e2e6bec7 DN |
68 | =item g and c |
69 | X</g> X</c> | |
70 | ||
71 | Global matching, and keep the Current position after failed matching. | |
72 | Unlike i, m, s and x, these two flags affect the way the regex is used | |
73 | rather than the regex itself. See | |
74 | L<perlretut/"Using regular expressions in Perl"> for further explanation | |
75 | of the g and c modifiers. | |
76 | ||
55497cff | 77 | =back |
a0d0e21e LW |
78 | |
79 | These are usually written as "the C</x> modifier", even though the delimiter | |
14218588 | 80 | in question might not really be a slash. Any of these |
a0d0e21e | 81 | modifiers may also be embedded within the regular expression itself using |
14218588 | 82 | the C<(?...)> construct. See below. |
a0d0e21e | 83 | |
4633a7c4 | 84 | The C</x> modifier itself needs a little more explanation. It tells |
55497cff | 85 | the regular expression parser to ignore whitespace that is neither |
86 | backslashed nor within a character class. You can use this to break up | |
4633a7c4 | 87 | your regular expression into (slightly) more readable parts. The C<#> |
54310121 | 88 | character is also treated as a metacharacter introducing a comment, |
55497cff | 89 | just as in ordinary Perl code. This also means that if you want real |
14218588 | 90 | whitespace or C<#> characters in the pattern (outside a character |
f9a3ff1a RGS |
91 | class, where they are unaffected by C</x>), then you'll either have to |
92 | escape them (using backslashes or C<\Q...\E>) or encode them using octal | |
8933a740 RGS |
93 | or hex escapes. Taken together, these features go a long way towards |
94 | making Perl's regular expressions more readable. Note that you have to | |
95 | be careful not to include the pattern delimiter in the comment--perl has | |
96 | no way of knowing you did not intend to close the pattern early. See | |
97 | the C-comment deletion code in L<perlop>. Also note that anything inside | |
1031e5db | 98 | a C<\Q...\E> stays unaffected by C</x>. |
d74e8afc | 99 | X</x> |
a0d0e21e LW |
100 | |
101 | =head2 Regular Expressions | |
102 | ||
04838cea RGS |
103 | =head3 Metacharacters |
104 | ||
384f06ae | 105 | The patterns used in Perl pattern matching evolved from those supplied in |
14218588 | 106 | the Version 8 regex routines. (The routines are derived |
19799a22 GS |
107 | (distantly) from Henry Spencer's freely redistributable reimplementation |
108 | of the V8 routines.) See L<Version 8 Regular Expressions> for | |
109 | details. | |
a0d0e21e LW |
110 | |
111 | In particular the following metacharacters have their standard I<egrep>-ish | |
112 | meanings: | |
d74e8afc ITB |
113 | X<metacharacter> |
114 | X<\> X<^> X<.> X<$> X<|> X<(> X<()> X<[> X<[]> | |
115 | ||
a0d0e21e | 116 | |
54310121 | 117 | \ Quote the next metacharacter |
a0d0e21e LW |
118 | ^ Match the beginning of the line |
119 | . Match any character (except newline) | |
c07a80fd | 120 | $ Match the end of the line (or before newline at the end) |
a0d0e21e LW |
121 | | Alternation |
122 | () Grouping | |
123 | [] Character class | |
124 | ||
14218588 GS |
125 | By default, the "^" character is guaranteed to match only the |
126 | beginning of the string, the "$" character only the end (or before the | |
127 | newline at the end), and Perl does certain optimizations with the | |
a0d0e21e LW |
128 | assumption that the string contains only one line. Embedded newlines |
129 | will not be matched by "^" or "$". You may, however, wish to treat a | |
4a6725af | 130 | string as a multi-line buffer, such that the "^" will match after any |
0d520e8e YO |
131 | newline within the string (except if the newline is the last character in |
132 | the string), and "$" will match before any newline. At the | |
a0d0e21e LW |
133 | cost of a little more overhead, you can do this by using the /m modifier |
134 | on the pattern match operator. (Older programs did this by setting C<$*>, | |
f02c194e | 135 | but this practice has been removed in perl 5.9.) |
d74e8afc | 136 | X<^> X<$> X</m> |
a0d0e21e | 137 | |
14218588 | 138 | To simplify multi-line substitutions, the "." character never matches a |
55497cff | 139 | newline unless you use the C</s> modifier, which in effect tells Perl to pretend |
f02c194e | 140 | the string is a single line--even if it isn't. |
d74e8afc | 141 | X<.> X</s> |
a0d0e21e | 142 | |
04838cea RGS |
143 | =head3 Quantifiers |
144 | ||
a0d0e21e | 145 | The following standard quantifiers are recognized: |
d74e8afc | 146 | X<metacharacter> X<quantifier> X<*> X<+> X<?> X<{n}> X<{n,}> X<{n,m}> |
a0d0e21e LW |
147 | |
148 | * Match 0 or more times | |
149 | + Match 1 or more times | |
150 | ? Match 1 or 0 times | |
151 | {n} Match exactly n times | |
152 | {n,} Match at least n times | |
153 | {n,m} Match at least n but not more than m times | |
154 | ||
155 | (If a curly bracket occurs in any other context, it is treated | |
b975c076 | 156 | as a regular character. In particular, the lower bound |
527e91da BB |
157 | is not optional.) The "*" quantifier is equivalent to C<{0,}>, the "+" |
158 | quantifier to C<{1,}>, and the "?" quantifier to C<{0,1}>. n and m are limited | |
9c79236d GS |
159 | to integral values less than a preset limit defined when perl is built. |
160 | This is usually 32766 on the most common platforms. The actual limit can | |
161 | be seen in the error message generated by code such as this: | |
162 | ||
820475bd | 163 | $_ **= $_ , / {$_} / for 2 .. 42; |
a0d0e21e | 164 | |
54310121 | 165 | By default, a quantified subpattern is "greedy", that is, it will match as |
166 | many times as possible (given a particular starting location) while still | |
167 | allowing the rest of the pattern to match. If you want it to match the | |
168 | minimum number of times possible, follow the quantifier with a "?". Note | |
169 | that the meanings don't change, just the "greediness": | |
0d017f4d | 170 | X<metacharacter> X<greedy> X<greediness> |
d74e8afc | 171 | X<?> X<*?> X<+?> X<??> X<{n}?> X<{n,}?> X<{n,m}?> |
a0d0e21e | 172 | |
0d017f4d WL |
173 | *? Match 0 or more times, not greedily |
174 | +? Match 1 or more times, not greedily | |
175 | ?? Match 0 or 1 time, not greedily | |
176 | {n}? Match exactly n times, not greedily | |
177 | {n,}? Match at least n times, not greedily | |
178 | {n,m}? Match at least n but not more than m times, not greedily | |
a0d0e21e | 179 | |
b9b4dddf YO |
180 | By default, when a quantified subpattern does not allow the rest of the |
181 | overall pattern to match, Perl will backtrack. However, this behaviour is | |
0d017f4d | 182 | sometimes undesirable. Thus Perl provides the "possessive" quantifier form |
b9b4dddf YO |
183 | as well. |
184 | ||
0d017f4d WL |
185 | *+ Match 0 or more times and give nothing back |
186 | ++ Match 1 or more times and give nothing back | |
187 | ?+ Match 0 or 1 time and give nothing back | |
b9b4dddf | 188 | {n}+ Match exactly n times and give nothing back (redundant) |
04838cea RGS |
189 | {n,}+ Match at least n times and give nothing back |
190 | {n,m}+ Match at least n but not more than m times and give nothing back | |
b9b4dddf YO |
191 | |
192 | For instance, | |
193 | ||
194 | 'aaaa' =~ /a++a/ | |
195 | ||
196 | will never match, as the C<a++> will gobble up all the C<a>'s in the | |
197 | string and won't leave any for the remaining part of the pattern. This | |
198 | feature can be extremely useful to give perl hints about where it | |
199 | shouldn't backtrack. For instance, the typical "match a double-quoted | |
200 | string" problem can be most efficiently performed when written as: | |
201 | ||
202 | /"(?:[^"\\]++|\\.)*+"/ | |
203 | ||
0d017f4d | 204 | as we know that if the final quote does not match, backtracking will not |
b9b4dddf YO |
205 | help. See the independent subexpression C<< (?>...) >> for more details; |
206 | possessive quantifiers are just syntactic sugar for that construct. For | |
207 | instance the above example could also be written as follows: | |
208 | ||
209 | /"(?>(?:(?>[^"\\]+)|\\.)*)"/ | |
210 | ||
04838cea RGS |
211 | =head3 Escape sequences |
212 | ||
5f05dabc | 213 | Because patterns are processed as double quoted strings, the following |
a0d0e21e | 214 | also work: |
0d017f4d | 215 | X<\t> X<\n> X<\r> X<\f> X<\e> X<\a> X<\l> X<\u> X<\L> X<\U> X<\E> X<\Q> |
d74e8afc | 216 | X<\0> X<\c> X<\N> X<\x> |
a0d0e21e | 217 | |
0f36ee90 | 218 | \t tab (HT, TAB) |
219 | \n newline (LF, NL) | |
220 | \r return (CR) | |
221 | \f form feed (FF) | |
222 | \a alarm (bell) (BEL) | |
223 | \e escape (think troff) (ESC) | |
0d017f4d WL |
224 | \033 octal char (example: ESC) |
225 | \x1B hex char (example: ESC) | |
196ac2fc | 226 | \x{263a} long hex char (example: Unicode SMILEY) |
0d017f4d | 227 | \cK control char (example: VT) |
196ac2fc | 228 | \N{name} named Unicode character |
e526e8bb | 229 | \N{U+263D} Unicode character (example: FIRST QUARTER MOON) |
cb1a09d0 AD |
230 | \l lowercase next char (think vi) |
231 | \u uppercase next char (think vi) | |
232 | \L lowercase till \E (think vi) | |
233 | \U uppercase till \E (think vi) | |
234 | \E end case modification (think vi) | |
5a964f20 | 235 | \Q quote (disable) pattern metacharacters till \E |
a0d0e21e | 236 | |
a034a98d | 237 | If C<use locale> is in effect, the case map used by C<\l>, C<\L>, C<\u> |
423cee85 | 238 | and C<\U> is taken from the current locale. See L<perllocale>. For |
4a2d328f | 239 | documentation of C<\N{name}>, see L<charnames>. |
a034a98d | 240 | |
1d2dff63 GS |
241 | You cannot include a literal C<$> or C<@> within a C<\Q> sequence. |
242 | An unescaped C<$> or C<@> interpolates the corresponding variable, | |
243 | while escaping will cause the literal string C<\$> to be matched. | |
244 | You'll need to write something like C<m/\Quser\E\@\Qhost/>. | |
245 | ||
e1d1eefb | 246 | =head3 Character Classes and other Special Escapes |
04838cea | 247 | |
a0d0e21e | 248 | In addition, Perl defines the following: |
d74e8afc | 249 | X<\w> X<\W> X<\s> X<\S> X<\d> X<\D> X<\X> X<\p> X<\P> X<\C> |
f7819f85 | 250 | X<\g> X<\k> X<\N> X<\K> X<\v> X<\V> X<\h> X<\H> |
0d017f4d | 251 | X<word> X<whitespace> X<character class> X<backreference> |
a0d0e21e | 252 | |
81714fb9 YO |
253 | \w Match a "word" character (alphanumeric plus "_") |
254 | \W Match a non-"word" character | |
255 | \s Match a whitespace character | |
256 | \S Match a non-whitespace character | |
257 | \d Match a digit character | |
258 | \D Match a non-digit character | |
259 | \pP Match P, named property. Use \p{Prop} for longer names. | |
260 | \PP Match non-P | |
0111a78f | 261 | \X Match Unicode "eXtended grapheme cluster" |
81714fb9 YO |
262 | \C Match a single C char (octet) even under Unicode. |
263 | NOTE: breaks up characters into their UTF-8 bytes, | |
264 | so you may end up with malformed pieces of UTF-8. | |
265 | Unsupported in lookbehind. | |
5d458dd8 | 266 | \1 Backreference to a specific group. |
c74340f9 | 267 | '1' may actually be any positive integer. |
2bf803e2 YO |
268 | \g1 Backreference to a specific or previous group, |
269 | \g{-1} number may be negative indicating a previous buffer and may | |
270 | optionally be wrapped in curly brackets for safer parsing. | |
1f1031fe | 271 | \g{name} Named backreference |
81714fb9 | 272 | \k<name> Named backreference |
ee9b8eae | 273 | \K Keep the stuff left of the \K, don't include it in $& |
c741660a | 274 | \N Any character but \n |
e1d1eefb YO |
275 | \v Vertical whitespace |
276 | \V Not vertical whitespace | |
277 | \h Horizontal whitespace | |
278 | \H Not horizontal whitespace | |
2ddf2931 | 279 | \R Linebreak |
a0d0e21e | 280 | |
08ce8fc6 JH |
281 | A C<\w> matches a single alphanumeric character (an alphabetic |
282 | character, or a decimal digit) or C<_>, not a whole word. Use C<\w+> | |
283 | to match a string of Perl-identifier characters (which isn't the same | |
284 | as matching an English word). If C<use locale> is in effect, the list | |
285 | of alphabetic characters generated by C<\w> is taken from the current | |
286 | locale. See L<perllocale>. You may use C<\w>, C<\W>, C<\s>, C<\S>, | |
0d017f4d WL |
287 | C<\d>, and C<\D> within character classes, but they aren't usable |
288 | as either end of a range. If any of them precedes or follows a "-", | |
289 | the "-" is understood literally. If Unicode is in effect, C<\s> matches | |
c62285ac | 290 | also "\x{85}", "\x{2028}", and "\x{2029}". See L<perlunicode> for more |
0d017f4d WL |
291 | details about C<\pP>, C<\PP>, C<\X> and the possibility of defining |
292 | your own C<\p> and C<\P> properties, and L<perluniintro> about Unicode | |
293 | in general. | |
d74e8afc | 294 | X<\w> X<\W> X<word> |
a0d0e21e | 295 | |
e1d1eefb | 296 | C<\R> will atomically match a linebreak, including the network line-ending |
e2cb52ee | 297 | "\x0D\x0A". Specifically, X<\R> is exactly equivalent to |
e1d1eefb YO |
298 | |
299 | (?>\x0D\x0A?|[\x0A-\x0C\x85\x{2028}\x{2029}]) | |
300 | ||
301 | B<Note:> C<\R> has no special meaning inside of a character class; | |
302 | use C<\v> instead (vertical whitespace). | |
303 | X<\R> | |
304 | ||
df225385 | 305 | Note that C<\N> has two meanings. When of the form C<\N{NAME}>, it matches the |
e526e8bb KW |
306 | character whose name is C<NAME>; and similarly when of the form |
307 | C<\N{U+I<wide hex char>}>, it matches the character whose Unicode ordinal is | |
308 | I<wide hex char>. Otherwise it matches any character but C<\n>. | |
df225385 | 309 | |
b8c5462f | 310 | The POSIX character class syntax |
d74e8afc | 311 | X<character class> |
b8c5462f | 312 | |
820475bd | 313 | [:class:] |
b8c5462f | 314 | |
0d017f4d | 315 | is also available. Note that the C<[> and C<]> brackets are I<literal>; |
5496314a SP |
316 | they must always be used within a character class expression. |
317 | ||
318 | # this is correct: | |
319 | $string =~ /[[:alpha:]]/; | |
320 | ||
321 | # this is not, and will generate a warning: | |
322 | $string =~ /[:alpha:]/; | |
323 | ||
6fa80ea2 YO |
324 | The following table shows the mapping of POSIX character class |
325 | names, common escapes, literal escape sequences and their equivalent | |
326 | Unicode style property names. | |
327 | X<character class> X<\p> X<\p{}> | |
d74e8afc ITB |
328 | X<alpha> X<alnum> X<ascii> X<blank> X<cntrl> X<digit> X<graph> |
329 | X<lower> X<print> X<punct> X<space> X<upper> X<word> X<xdigit> | |
b8c5462f | 330 | |
6fa80ea2 YO |
331 | B<Note:> up to Perl 5.10 the property names used were shared with |
332 | standard Unicode properties, this was changed in Perl 5.11, see | |
333 | L<perl5110delta> for details. | |
334 | ||
335 | POSIX Esc Class Property Note | |
336 | -------------------------------------------------------- | |
337 | alnum [0-9A-Za-z] IsPosixAlnum | |
338 | alpha [A-Za-z] IsPosixAlpha | |
339 | ascii [\000-\177] IsASCII | |
340 | blank [\011 ] IsPosixBlank [1] | |
341 | cntrl [\0-\37\177] IsPosixCntrl | |
342 | digit \d [0-9] IsPosixDigit | |
343 | graph [!-~] IsPosixGraph | |
344 | lower [a-z] IsPosixLower | |
345 | print [ -~] IsPosixPrint | |
346 | punct [!-/:-@[-`{-~] IsPosixPunct | |
347 | space [\11-\15 ] IsPosixSpace [2] | |
348 | \s [\11\12\14\15 ] IsPerlSpace [2] | |
349 | upper [A-Z] IsPosixUpper | |
350 | word \w [0-9A-Z_a-z] IsPerlWord [3] | |
351 | xdigit [0-9A-Fa-f] IsXDigit | |
b8c5462f | 352 | |
07698885 RGS |
353 | =over |
354 | ||
355 | =item [1] | |
356 | ||
b432a672 | 357 | A GNU extension equivalent to C<[ \t]>, "all horizontal whitespace". |
07698885 RGS |
358 | |
359 | =item [2] | |
360 | ||
6fa80ea2 YO |
361 | Note that C<\s> and C<[[:space:]]> are B<not> equivalent as C<[[:space:]]> |
362 | includes also the (very rare) "vertical tabulator", "\cK" or chr(11) in | |
363 | ASCII. | |
07698885 RGS |
364 | |
365 | =item [3] | |
366 | ||
08ce8fc6 | 367 | A Perl extension, see above. |
07698885 RGS |
368 | |
369 | =back | |
aaa51d5e | 370 | |
26b44a0a | 371 | For example use C<[:upper:]> to match all the uppercase characters. |
aaa51d5e JF |
372 | Note that the C<[]> are part of the C<[::]> construct, not part of the |
373 | whole character class. For example: | |
b8c5462f | 374 | |
820475bd | 375 | [01[:alpha:]%] |
b8c5462f | 376 | |
0d017f4d | 377 | matches zero, one, any alphabetic character, and the percent sign. |
b8c5462f | 378 | |
353c6505 | 379 | The other named classes are: |
b8c5462f JH |
380 | |
381 | =over 4 | |
382 | ||
383 | =item cntrl | |
d74e8afc | 384 | X<cntrl> |
b8c5462f | 385 | |
820475bd GS |
386 | Any control character. Usually characters that don't produce output as |
387 | such but instead control the terminal somehow: for example newline and | |
388 | backspace are control characters. All characters with ord() less than | |
0d017f4d | 389 | 32 are usually classified as control characters (assuming ASCII, |
7be5a6cf JF |
390 | the ISO Latin character sets, and Unicode), as is the character with |
391 | the ord() value of 127 (C<DEL>). | |
b8c5462f JH |
392 | |
393 | =item graph | |
d74e8afc | 394 | X<graph> |
b8c5462f | 395 | |
f1cbbd6e | 396 | Any alphanumeric or punctuation (special) character. |
b8c5462f JH |
397 | |
398 | =item print | |
d74e8afc | 399 | X<print> |
b8c5462f | 400 | |
f79b3095 | 401 | Any alphanumeric or punctuation (special) character or the space character. |
b8c5462f JH |
402 | |
403 | =item punct | |
d74e8afc | 404 | X<punct> |
b8c5462f | 405 | |
f1cbbd6e | 406 | Any punctuation (special) character. |
b8c5462f JH |
407 | |
408 | =item xdigit | |
d74e8afc | 409 | X<xdigit> |
b8c5462f | 410 | |
593df60c | 411 | Any hexadecimal digit. Though this may feel silly ([0-9A-Fa-f] would |
820475bd | 412 | work just fine) it is included for completeness. |
b8c5462f | 413 | |
b8c5462f JH |
414 | =back |
415 | ||
416 | You can negate the [::] character classes by prefixing the class name | |
417 | with a '^'. This is a Perl extension. For example: | |
d74e8afc | 418 | X<character class, negation> |
b8c5462f | 419 | |
5496314a | 420 | POSIX traditional Unicode |
93733859 | 421 | |
6fa80ea2 YO |
422 | [[:^digit:]] \D \P{IsPosixDigit} |
423 | [[:^space:]] \S \P{IsPosixSpace} | |
424 | [[:^word:]] \W \P{IsPerlWord} | |
b8c5462f | 425 | |
54c18d04 MK |
426 | Perl respects the POSIX standard in that POSIX character classes are |
427 | only supported within a character class. The POSIX character classes | |
428 | [.cc.] and [=cc=] are recognized but B<not> supported and trying to | |
429 | use them will cause an error. | |
b8c5462f | 430 | |
04838cea RGS |
431 | =head3 Assertions |
432 | ||
a0d0e21e | 433 | Perl defines the following zero-width assertions: |
d74e8afc ITB |
434 | X<zero-width assertion> X<assertion> X<regex, zero-width assertion> |
435 | X<regexp, zero-width assertion> | |
436 | X<regular expression, zero-width assertion> | |
437 | X<\b> X<\B> X<\A> X<\Z> X<\z> X<\G> | |
a0d0e21e LW |
438 | |
439 | \b Match a word boundary | |
0d017f4d | 440 | \B Match except at a word boundary |
b85d18e9 IZ |
441 | \A Match only at beginning of string |
442 | \Z Match only at end of string, or before newline at the end | |
443 | \z Match only at end of string | |
9da458fc IZ |
444 | \G Match only at pos() (e.g. at the end-of-match position |
445 | of prior m//g) | |
a0d0e21e | 446 | |
14218588 | 447 | A word boundary (C<\b>) is a spot between two characters |
19799a22 GS |
448 | that has a C<\w> on one side of it and a C<\W> on the other side |
449 | of it (in either order), counting the imaginary characters off the | |
450 | beginning and end of the string as matching a C<\W>. (Within | |
451 | character classes C<\b> represents backspace rather than a word | |
452 | boundary, just as it normally does in any double-quoted string.) | |
453 | The C<\A> and C<\Z> are just like "^" and "$", except that they | |
454 | won't match multiple times when the C</m> modifier is used, while | |
455 | "^" and "$" will match at every internal line boundary. To match | |
456 | the actual end of the string and not ignore an optional trailing | |
457 | newline, use C<\z>. | |
d74e8afc | 458 | X<\b> X<\A> X<\Z> X<\z> X</m> |
19799a22 GS |
459 | |
460 | The C<\G> assertion can be used to chain global matches (using | |
461 | C<m//g>), as described in L<perlop/"Regexp Quote-Like Operators">. | |
462 | It is also useful when writing C<lex>-like scanners, when you have | |
463 | several patterns that you want to match against consequent substrings | |
464 | of your string, see the previous reference. The actual location | |
465 | where C<\G> will match can also be influenced by using C<pos()> as | |
58e23c8d YO |
466 | an lvalue: see L<perlfunc/pos>. Note that the rule for zero-length |
467 | matches is modified somewhat, in that contents to the left of C<\G> is | |
468 | not counted when determining the length of the match. Thus the following | |
469 | will not match forever: | |
d74e8afc | 470 | X<\G> |
c47ff5f1 | 471 | |
58e23c8d YO |
472 | $str = 'ABC'; |
473 | pos($str) = 1; | |
474 | while (/.\G/g) { | |
475 | print $&; | |
476 | } | |
477 | ||
478 | It will print 'A' and then terminate, as it considers the match to | |
479 | be zero-width, and thus will not match at the same position twice in a | |
480 | row. | |
481 | ||
482 | It is worth noting that C<\G> improperly used can result in an infinite | |
483 | loop. Take care when using patterns that include C<\G> in an alternation. | |
484 | ||
04838cea RGS |
485 | =head3 Capture buffers |
486 | ||
0d017f4d WL |
487 | The bracketing construct C<( ... )> creates capture buffers. To refer |
488 | to the current contents of a buffer later on, within the same pattern, | |
489 | use \1 for the first, \2 for the second, and so on. | |
490 | Outside the match use "$" instead of "\". (The | |
81714fb9 | 491 | \<digit> notation works in certain circumstances outside |
14218588 GS |
492 | the match. See the warning below about \1 vs $1 for details.) |
493 | Referring back to another part of the match is called a | |
494 | I<backreference>. | |
d74e8afc ITB |
495 | X<regex, capture buffer> X<regexp, capture buffer> |
496 | X<regular expression, capture buffer> X<backreference> | |
14218588 GS |
497 | |
498 | There is no limit to the number of captured substrings that you may | |
499 | use. However Perl also uses \10, \11, etc. as aliases for \010, | |
fb55449c JH |
500 | \011, etc. (Recall that 0 means octal, so \011 is the character at |
501 | number 9 in your coded character set; which would be the 10th character, | |
81714fb9 YO |
502 | a horizontal tab under ASCII.) Perl resolves this |
503 | ambiguity by interpreting \10 as a backreference only if at least 10 | |
504 | left parentheses have opened before it. Likewise \11 is a | |
505 | backreference only if at least 11 left parentheses have opened | |
506 | before it. And so on. \1 through \9 are always interpreted as | |
5624f11d | 507 | backreferences. |
40863337 ML |
508 | If the bracketing group did not match, the associated backreference won't |
509 | match either. (This can happen if the bracketing group is optional, or | |
510 | in a different branch of an alternation.) | |
511 | ||
1f1031fe | 512 | X<\g{1}> X<\g{-1}> X<\g{name}> X<relative backreference> X<named backreference> |
2bf803e2 | 513 | In order to provide a safer and easier way to construct patterns using |
99d59c4d RGS |
514 | backreferences, Perl provides the C<\g{N}> notation (starting with perl |
515 | 5.10.0). The curly brackets are optional, however omitting them is less | |
516 | safe as the meaning of the pattern can be changed by text (such as digits) | |
517 | following it. When N is a positive integer the C<\g{N}> notation is | |
518 | exactly equivalent to using normal backreferences. When N is a negative | |
519 | integer then it is a relative backreference referring to the previous N'th | |
520 | capturing group. When the bracket form is used and N is not an integer, it | |
521 | is treated as a reference to a named buffer. | |
2bf803e2 YO |
522 | |
523 | Thus C<\g{-1}> refers to the last buffer, C<\g{-2}> refers to the | |
524 | buffer before that. For example: | |
5624f11d YO |
525 | |
526 | / | |
527 | (Y) # buffer 1 | |
528 | ( # buffer 2 | |
529 | (X) # buffer 3 | |
2bf803e2 YO |
530 | \g{-1} # backref to buffer 3 |
531 | \g{-3} # backref to buffer 1 | |
5624f11d YO |
532 | ) |
533 | /x | |
534 | ||
2bf803e2 | 535 | and would match the same as C</(Y) ( (X) \3 \1 )/x>. |
14218588 | 536 | |
99d59c4d | 537 | Additionally, as of Perl 5.10.0 you may use named capture buffers and named |
1f1031fe | 538 | backreferences. The notation is C<< (?<name>...) >> to declare and C<< \k<name> >> |
0d017f4d WL |
539 | to reference. You may also use apostrophes instead of angle brackets to delimit the |
540 | name; and you may use the bracketed C<< \g{name} >> backreference syntax. | |
541 | It's possible to refer to a named capture buffer by absolute and relative number as well. | |
542 | Outside the pattern, a named capture buffer is available via the C<%+> hash. | |
543 | When different buffers within the same pattern have the same name, C<$+{name}> | |
544 | and C<< \k<name> >> refer to the leftmost defined group. (Thus it's possible | |
545 | to do things with named capture buffers that would otherwise require C<(??{})> | |
546 | code to accomplish.) | |
547 | X<named capture buffer> X<regular expression, named capture buffer> | |
64c5a566 | 548 | X<%+> X<$+{name}> X<< \k<name> >> |
81714fb9 | 549 | |
14218588 | 550 | Examples: |
a0d0e21e LW |
551 | |
552 | s/^([^ ]*) *([^ ]*)/$2 $1/; # swap first two words | |
553 | ||
81714fb9 YO |
554 | /(.)\1/ # find first doubled char |
555 | and print "'$1' is the first doubled character\n"; | |
556 | ||
557 | /(?<char>.)\k<char>/ # ... a different way | |
558 | and print "'$+{char}' is the first doubled character\n"; | |
559 | ||
0d017f4d | 560 | /(?'char'.)\1/ # ... mix and match |
81714fb9 | 561 | and print "'$1' is the first doubled character\n"; |
c47ff5f1 | 562 | |
14218588 | 563 | if (/Time: (..):(..):(..)/) { # parse out values |
a0d0e21e LW |
564 | $hours = $1; |
565 | $minutes = $2; | |
566 | $seconds = $3; | |
567 | } | |
c47ff5f1 | 568 | |
14218588 GS |
569 | Several special variables also refer back to portions of the previous |
570 | match. C<$+> returns whatever the last bracket match matched. | |
571 | C<$&> returns the entire matched string. (At one point C<$0> did | |
572 | also, but now it returns the name of the program.) C<$`> returns | |
77ea4f6d JV |
573 | everything before the matched string. C<$'> returns everything |
574 | after the matched string. And C<$^N> contains whatever was matched by | |
575 | the most-recently closed group (submatch). C<$^N> can be used in | |
576 | extended patterns (see below), for example to assign a submatch to a | |
81714fb9 | 577 | variable. |
d74e8afc | 578 | X<$+> X<$^N> X<$&> X<$`> X<$'> |
14218588 | 579 | |
665e98b9 | 580 | The numbered match variables ($1, $2, $3, etc.) and the related punctuation |
77ea4f6d | 581 | set (C<$+>, C<$&>, C<$`>, C<$'>, and C<$^N>) are all dynamically scoped |
14218588 GS |
582 | until the end of the enclosing block or until the next successful |
583 | match, whichever comes first. (See L<perlsyn/"Compound Statements">.) | |
d74e8afc ITB |
584 | X<$+> X<$^N> X<$&> X<$`> X<$'> |
585 | X<$1> X<$2> X<$3> X<$4> X<$5> X<$6> X<$7> X<$8> X<$9> | |
586 | ||
14218588 | 587 | |
0d017f4d | 588 | B<NOTE>: Failed matches in Perl do not reset the match variables, |
5146ce24 | 589 | which makes it easier to write code that tests for a series of more |
665e98b9 JH |
590 | specific cases and remembers the best match. |
591 | ||
14218588 GS |
592 | B<WARNING>: Once Perl sees that you need one of C<$&>, C<$`>, or |
593 | C<$'> anywhere in the program, it has to provide them for every | |
594 | pattern match. This may substantially slow your program. Perl | |
595 | uses the same mechanism to produce $1, $2, etc, so you also pay a | |
596 | price for each pattern that contains capturing parentheses. (To | |
597 | avoid this cost while retaining the grouping behaviour, use the | |
598 | extended regular expression C<(?: ... )> instead.) But if you never | |
599 | use C<$&>, C<$`> or C<$'>, then patterns I<without> capturing | |
600 | parentheses will not be penalized. So avoid C<$&>, C<$'>, and C<$`> | |
601 | if you can, but if you can't (and some algorithms really appreciate | |
602 | them), once you've used them once, use them at will, because you've | |
603 | already paid the price. As of 5.005, C<$&> is not so costly as the | |
604 | other two. | |
d74e8afc | 605 | X<$&> X<$`> X<$'> |
68dc0745 | 606 | |
99d59c4d | 607 | As a workaround for this problem, Perl 5.10.0 introduces C<${^PREMATCH}>, |
cde0cee5 YO |
608 | C<${^MATCH}> and C<${^POSTMATCH}>, which are equivalent to C<$`>, C<$&> |
609 | and C<$'>, B<except> that they are only guaranteed to be defined after a | |
87e95b7f | 610 | successful match that was executed with the C</p> (preserve) modifier. |
cde0cee5 YO |
611 | The use of these variables incurs no global performance penalty, unlike |
612 | their punctuation char equivalents, however at the trade-off that you | |
613 | have to tell perl when you want to use them. | |
87e95b7f | 614 | X</p> X<p modifier> |
cde0cee5 | 615 | |
19799a22 GS |
616 | Backslashed metacharacters in Perl are alphanumeric, such as C<\b>, |
617 | C<\w>, C<\n>. Unlike some other regular expression languages, there | |
618 | are no backslashed symbols that aren't alphanumeric. So anything | |
c47ff5f1 | 619 | that looks like \\, \(, \), \<, \>, \{, or \} is always |
19799a22 GS |
620 | interpreted as a literal character, not a metacharacter. This was |
621 | once used in a common idiom to disable or quote the special meanings | |
622 | of regular expression metacharacters in a string that you want to | |
36bbe248 | 623 | use for a pattern. Simply quote all non-"word" characters: |
a0d0e21e LW |
624 | |
625 | $pattern =~ s/(\W)/\\$1/g; | |
626 | ||
f1cbbd6e | 627 | (If C<use locale> is set, then this depends on the current locale.) |
14218588 GS |
628 | Today it is more common to use the quotemeta() function or the C<\Q> |
629 | metaquoting escape sequence to disable all metacharacters' special | |
630 | meanings like this: | |
a0d0e21e LW |
631 | |
632 | /$unquoted\Q$quoted\E$unquoted/ | |
633 | ||
9da458fc IZ |
634 | Beware that if you put literal backslashes (those not inside |
635 | interpolated variables) between C<\Q> and C<\E>, double-quotish | |
636 | backslash interpolation may lead to confusing results. If you | |
637 | I<need> to use literal backslashes within C<\Q...\E>, | |
638 | consult L<perlop/"Gory details of parsing quoted constructs">. | |
639 | ||
19799a22 GS |
640 | =head2 Extended Patterns |
641 | ||
14218588 GS |
642 | Perl also defines a consistent extension syntax for features not |
643 | found in standard tools like B<awk> and B<lex>. The syntax is a | |
644 | pair of parentheses with a question mark as the first thing within | |
645 | the parentheses. The character after the question mark indicates | |
646 | the extension. | |
19799a22 | 647 | |
14218588 GS |
648 | The stability of these extensions varies widely. Some have been |
649 | part of the core language for many years. Others are experimental | |
650 | and may change without warning or be completely removed. Check | |
651 | the documentation on an individual feature to verify its current | |
652 | status. | |
19799a22 | 653 | |
14218588 GS |
654 | A question mark was chosen for this and for the minimal-matching |
655 | construct because 1) question marks are rare in older regular | |
656 | expressions, and 2) whenever you see one, you should stop and | |
657 | "question" exactly what is going on. That's psychology... | |
a0d0e21e LW |
658 | |
659 | =over 10 | |
660 | ||
cc6b7395 | 661 | =item C<(?#text)> |
d74e8afc | 662 | X<(?#)> |
a0d0e21e | 663 | |
14218588 | 664 | A comment. The text is ignored. If the C</x> modifier enables |
19799a22 | 665 | whitespace formatting, a simple C<#> will suffice. Note that Perl closes |
259138e3 GS |
666 | the comment as soon as it sees a C<)>, so there is no way to put a literal |
667 | C<)> in the comment. | |
a0d0e21e | 668 | |
f7819f85 | 669 | =item C<(?pimsx-imsx)> |
d74e8afc | 670 | X<(?)> |
19799a22 | 671 | |
0b6d1084 JH |
672 | One or more embedded pattern-match modifiers, to be turned on (or |
673 | turned off, if preceded by C<->) for the remainder of the pattern or | |
674 | the remainder of the enclosing pattern group (if any). This is | |
675 | particularly useful for dynamic patterns, such as those read in from a | |
0d017f4d WL |
676 | configuration file, taken from an argument, or specified in a table |
677 | somewhere. Consider the case where some patterns want to be case | |
678 | sensitive and some do not: The case insensitive ones merely need to | |
679 | include C<(?i)> at the front of the pattern. For example: | |
19799a22 GS |
680 | |
681 | $pattern = "foobar"; | |
5d458dd8 | 682 | if ( /$pattern/i ) { } |
19799a22 GS |
683 | |
684 | # more flexible: | |
685 | ||
686 | $pattern = "(?i)foobar"; | |
5d458dd8 | 687 | if ( /$pattern/ ) { } |
19799a22 | 688 | |
0b6d1084 | 689 | These modifiers are restored at the end of the enclosing group. For example, |
19799a22 GS |
690 | |
691 | ( (?i) blah ) \s+ \1 | |
692 | ||
0d017f4d WL |
693 | will match C<blah> in any case, some spaces, and an exact (I<including the case>!) |
694 | repetition of the previous word, assuming the C</x> modifier, and no C</i> | |
695 | modifier outside this group. | |
19799a22 | 696 | |
8eb5594e DR |
697 | These modifiers do not carry over into named subpatterns called in the |
698 | enclosing group. In other words, a pattern such as C<((?i)(&NAME))> does not | |
699 | change the case-sensitivity of the "NAME" pattern. | |
700 | ||
5530442b | 701 | Note that the C<p> modifier is special in that it can only be enabled, |
cde0cee5 | 702 | not disabled, and that its presence anywhere in a pattern has a global |
5530442b | 703 | effect. Thus C<(?-p)> and C<(?-p:...)> are meaningless and will warn |
cde0cee5 YO |
704 | when executed under C<use warnings>. |
705 | ||
5a964f20 | 706 | =item C<(?:pattern)> |
d74e8afc | 707 | X<(?:)> |
a0d0e21e | 708 | |
ca9dfc88 IZ |
709 | =item C<(?imsx-imsx:pattern)> |
710 | ||
5a964f20 TC |
711 | This is for clustering, not capturing; it groups subexpressions like |
712 | "()", but doesn't make backreferences as "()" does. So | |
a0d0e21e | 713 | |
5a964f20 | 714 | @fields = split(/\b(?:a|b|c)\b/) |
a0d0e21e LW |
715 | |
716 | is like | |
717 | ||
5a964f20 | 718 | @fields = split(/\b(a|b|c)\b/) |
a0d0e21e | 719 | |
19799a22 GS |
720 | but doesn't spit out extra fields. It's also cheaper not to capture |
721 | characters if you don't need to. | |
a0d0e21e | 722 | |
19799a22 | 723 | Any letters between C<?> and C<:> act as flags modifiers as with |
5d458dd8 | 724 | C<(?imsx-imsx)>. For example, |
ca9dfc88 IZ |
725 | |
726 | /(?s-i:more.*than).*million/i | |
727 | ||
14218588 | 728 | is equivalent to the more verbose |
ca9dfc88 IZ |
729 | |
730 | /(?:(?s-i)more.*than).*million/i | |
731 | ||
594d7033 YO |
732 | =item C<(?|pattern)> |
733 | X<(?|)> X<Branch reset> | |
734 | ||
735 | This is the "branch reset" pattern, which has the special property | |
736 | that the capture buffers are numbered from the same starting point | |
99d59c4d | 737 | in each alternation branch. It is available starting from perl 5.10.0. |
4deaaa80 | 738 | |
693596a8 RGS |
739 | Capture buffers are numbered from left to right, but inside this |
740 | construct the numbering is restarted for each branch. | |
4deaaa80 PJ |
741 | |
742 | The numbering within each branch will be as normal, and any buffers | |
743 | following this construct will be numbered as though the construct | |
744 | contained only one branch, that being the one with the most capture | |
745 | buffers in it. | |
746 | ||
747 | This construct will be useful when you want to capture one of a | |
748 | number of alternative matches. | |
749 | ||
750 | Consider the following pattern. The numbers underneath show in | |
751 | which buffer the captured content will be stored. | |
594d7033 YO |
752 | |
753 | ||
754 | # before ---------------branch-reset----------- after | |
755 | / ( a ) (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x | |
756 | # 1 2 2 3 2 3 4 | |
757 | ||
ab106183 A |
758 | Be careful when using the branch reset pattern in combination with |
759 | named captures. Named captures are implemented as being aliases to | |
760 | numbered buffers holding the captures, and that interferes with the | |
761 | implementation of the branch reset pattern. If you are using named | |
762 | captures in a branch reset pattern, it's best to use the same names, | |
763 | in the same order, in each of the alternations: | |
764 | ||
765 | /(?| (?<a> x ) (?<b> y ) | |
766 | | (?<a> z ) (?<b> w )) /x | |
767 | ||
768 | Not doing so may lead to surprises: | |
769 | ||
770 | "12" =~ /(?| (?<a> \d+ ) | (?<b> \D+))/x; | |
771 | say $+ {a}; # Prints '12' | |
772 | say $+ {b}; # *Also* prints '12'. | |
773 | ||
774 | The problem here is that both the buffer named C<< a >> and the buffer | |
775 | named C<< b >> are aliases for the buffer belonging to C<< $1 >>. | |
90a18110 | 776 | |
ee9b8eae YO |
777 | =item Look-Around Assertions |
778 | X<look-around assertion> X<lookaround assertion> X<look-around> X<lookaround> | |
779 | ||
780 | Look-around assertions are zero width patterns which match a specific | |
781 | pattern without including it in C<$&>. Positive assertions match when | |
782 | their subpattern matches, negative assertions match when their subpattern | |
783 | fails. Look-behind matches text up to the current match position, | |
784 | look-ahead matches text following the current match position. | |
785 | ||
786 | =over 4 | |
787 | ||
5a964f20 | 788 | =item C<(?=pattern)> |
d74e8afc | 789 | X<(?=)> X<look-ahead, positive> X<lookahead, positive> |
a0d0e21e | 790 | |
19799a22 | 791 | A zero-width positive look-ahead assertion. For example, C</\w+(?=\t)/> |
a0d0e21e LW |
792 | matches a word followed by a tab, without including the tab in C<$&>. |
793 | ||
5a964f20 | 794 | =item C<(?!pattern)> |
d74e8afc | 795 | X<(?!)> X<look-ahead, negative> X<lookahead, negative> |
a0d0e21e | 796 | |
19799a22 | 797 | A zero-width negative look-ahead assertion. For example C</foo(?!bar)/> |
a0d0e21e | 798 | matches any occurrence of "foo" that isn't followed by "bar". Note |
19799a22 GS |
799 | however that look-ahead and look-behind are NOT the same thing. You cannot |
800 | use this for look-behind. | |
7b8d334a | 801 | |
5a964f20 | 802 | If you are looking for a "bar" that isn't preceded by a "foo", C</(?!foo)bar/> |
7b8d334a GS |
803 | will not do what you want. That's because the C<(?!foo)> is just saying that |
804 | the next thing cannot be "foo"--and it's not, it's a "bar", so "foobar" will | |
805 | match. You would have to do something like C</(?!foo)...bar/> for that. We | |
806 | say "like" because there's the case of your "bar" not having three characters | |
807 | before it. You could cover that this way: C</(?:(?!foo)...|^.{0,2})bar/>. | |
808 | Sometimes it's still easier just to say: | |
a0d0e21e | 809 | |
a3cb178b | 810 | if (/bar/ && $` !~ /foo$/) |
a0d0e21e | 811 | |
19799a22 | 812 | For look-behind see below. |
c277df42 | 813 | |
ee9b8eae YO |
814 | =item C<(?<=pattern)> C<\K> |
815 | X<(?<=)> X<look-behind, positive> X<lookbehind, positive> X<\K> | |
c277df42 | 816 | |
c47ff5f1 | 817 | A zero-width positive look-behind assertion. For example, C</(?<=\t)\w+/> |
19799a22 GS |
818 | matches a word that follows a tab, without including the tab in C<$&>. |
819 | Works only for fixed-width look-behind. | |
c277df42 | 820 | |
ee9b8eae YO |
821 | There is a special form of this construct, called C<\K>, which causes the |
822 | regex engine to "keep" everything it had matched prior to the C<\K> and | |
823 | not include it in C<$&>. This effectively provides variable length | |
824 | look-behind. The use of C<\K> inside of another look-around assertion | |
825 | is allowed, but the behaviour is currently not well defined. | |
826 | ||
c62285ac | 827 | For various reasons C<\K> may be significantly more efficient than the |
ee9b8eae YO |
828 | equivalent C<< (?<=...) >> construct, and it is especially useful in |
829 | situations where you want to efficiently remove something following | |
830 | something else in a string. For instance | |
831 | ||
832 | s/(foo)bar/$1/g; | |
833 | ||
834 | can be rewritten as the much more efficient | |
835 | ||
836 | s/foo\Kbar//g; | |
837 | ||
5a964f20 | 838 | =item C<(?<!pattern)> |
d74e8afc | 839 | X<(?<!)> X<look-behind, negative> X<lookbehind, negative> |
c277df42 | 840 | |
19799a22 GS |
841 | A zero-width negative look-behind assertion. For example C</(?<!bar)foo/> |
842 | matches any occurrence of "foo" that does not follow "bar". Works | |
843 | only for fixed-width look-behind. | |
c277df42 | 844 | |
ee9b8eae YO |
845 | =back |
846 | ||
81714fb9 YO |
847 | =item C<(?'NAME'pattern)> |
848 | ||
849 | =item C<< (?<NAME>pattern) >> | |
850 | X<< (?<NAME>) >> X<(?'NAME')> X<named capture> X<capture> | |
851 | ||
852 | A named capture buffer. Identical in every respect to normal capturing | |
90a18110 RGS |
853 | parentheses C<()> but for the additional fact that C<%+> or C<%-> may be |
854 | used after a successful match to refer to a named buffer. See C<perlvar> | |
855 | for more details on the C<%+> and C<%-> hashes. | |
81714fb9 YO |
856 | |
857 | If multiple distinct capture buffers have the same name then the | |
858 | $+{NAME} will refer to the leftmost defined buffer in the match. | |
859 | ||
0d017f4d | 860 | The forms C<(?'NAME'pattern)> and C<< (?<NAME>pattern) >> are equivalent. |
81714fb9 YO |
861 | |
862 | B<NOTE:> While the notation of this construct is the same as the similar | |
0d017f4d | 863 | function in .NET regexes, the behavior is not. In Perl the buffers are |
81714fb9 YO |
864 | numbered sequentially regardless of being named or not. Thus in the |
865 | pattern | |
866 | ||
867 | /(x)(?<foo>y)(z)/ | |
868 | ||
869 | $+{foo} will be the same as $2, and $3 will contain 'z' instead of | |
870 | the opposite which is what a .NET regex hacker might expect. | |
871 | ||
1f1031fe YO |
872 | Currently NAME is restricted to simple identifiers only. |
873 | In other words, it must match C</^[_A-Za-z][_A-Za-z0-9]*\z/> or | |
874 | its Unicode extension (see L<utf8>), | |
875 | though it isn't extended by the locale (see L<perllocale>). | |
81714fb9 | 876 | |
1f1031fe | 877 | B<NOTE:> In order to make things easier for programmers with experience |
ae5648b3 | 878 | with the Python or PCRE regex engines, the pattern C<< (?PE<lt>NAMEE<gt>pattern) >> |
0d017f4d | 879 | may be used instead of C<< (?<NAME>pattern) >>; however this form does not |
64c5a566 | 880 | support the use of single quotes as a delimiter for the name. |
81714fb9 | 881 | |
1f1031fe YO |
882 | =item C<< \k<NAME> >> |
883 | ||
884 | =item C<< \k'NAME' >> | |
81714fb9 YO |
885 | |
886 | Named backreference. Similar to numeric backreferences, except that | |
887 | the group is designated by name and not number. If multiple groups | |
888 | have the same name then it refers to the leftmost defined group in | |
889 | the current match. | |
890 | ||
0d017f4d | 891 | It is an error to refer to a name not defined by a C<< (?<NAME>) >> |
81714fb9 YO |
892 | earlier in the pattern. |
893 | ||
894 | Both forms are equivalent. | |
895 | ||
1f1031fe | 896 | B<NOTE:> In order to make things easier for programmers with experience |
0d017f4d | 897 | with the Python or PCRE regex engines, the pattern C<< (?P=NAME) >> |
64c5a566 | 898 | may be used instead of C<< \k<NAME> >>. |
1f1031fe | 899 | |
cc6b7395 | 900 | =item C<(?{ code })> |
d74e8afc | 901 | X<(?{})> X<regex, code in> X<regexp, code in> X<regular expression, code in> |
c277df42 | 902 | |
19799a22 | 903 | B<WARNING>: This extended regular expression feature is considered |
b9b4dddf YO |
904 | experimental, and may be changed without notice. Code executed that |
905 | has side effects may not perform identically from version to version | |
906 | due to the effect of future optimisations in the regex engine. | |
c277df42 | 907 | |
cc46d5f2 | 908 | This zero-width assertion evaluates any embedded Perl code. It |
19799a22 GS |
909 | always succeeds, and its C<code> is not interpolated. Currently, |
910 | the rules to determine where the C<code> ends are somewhat convoluted. | |
911 | ||
77ea4f6d JV |
912 | This feature can be used together with the special variable C<$^N> to |
913 | capture the results of submatches in variables without having to keep | |
914 | track of the number of nested parentheses. For example: | |
915 | ||
916 | $_ = "The brown fox jumps over the lazy dog"; | |
917 | /the (\S+)(?{ $color = $^N }) (\S+)(?{ $animal = $^N })/i; | |
918 | print "color = $color, animal = $animal\n"; | |
919 | ||
754091cb RGS |
920 | Inside the C<(?{...})> block, C<$_> refers to the string the regular |
921 | expression is matching against. You can also use C<pos()> to know what is | |
fa11829f | 922 | the current position of matching within this string. |
754091cb | 923 | |
19799a22 GS |
924 | The C<code> is properly scoped in the following sense: If the assertion |
925 | is backtracked (compare L<"Backtracking">), all changes introduced after | |
926 | C<local>ization are undone, so that | |
b9ac3b5b GS |
927 | |
928 | $_ = 'a' x 8; | |
5d458dd8 | 929 | m< |
b9ac3b5b GS |
930 | (?{ $cnt = 0 }) # Initialize $cnt. |
931 | ( | |
5d458dd8 | 932 | a |
b9ac3b5b GS |
933 | (?{ |
934 | local $cnt = $cnt + 1; # Update $cnt, backtracking-safe. | |
935 | }) | |
5d458dd8 | 936 | )* |
b9ac3b5b GS |
937 | aaaa |
938 | (?{ $res = $cnt }) # On success copy to non-localized | |
939 | # location. | |
940 | >x; | |
941 | ||
0d017f4d | 942 | will set C<$res = 4>. Note that after the match, C<$cnt> returns to the globally |
14218588 | 943 | introduced value, because the scopes that restrict C<local> operators |
b9ac3b5b GS |
944 | are unwound. |
945 | ||
19799a22 GS |
946 | This assertion may be used as a C<(?(condition)yes-pattern|no-pattern)> |
947 | switch. If I<not> used in this way, the result of evaluation of | |
948 | C<code> is put into the special variable C<$^R>. This happens | |
949 | immediately, so C<$^R> can be used from other C<(?{ code })> assertions | |
950 | inside the same regular expression. | |
b9ac3b5b | 951 | |
19799a22 GS |
952 | The assignment to C<$^R> above is properly localized, so the old |
953 | value of C<$^R> is restored if the assertion is backtracked; compare | |
954 | L<"Backtracking">. | |
b9ac3b5b | 955 | |
19799a22 GS |
956 | For reasons of security, this construct is forbidden if the regular |
957 | expression involves run-time interpolation of variables, unless the | |
958 | perilous C<use re 'eval'> pragma has been used (see L<re>), or the | |
959 | variables contain results of C<qr//> operator (see | |
5d458dd8 | 960 | L<perlop/"qr/STRING/imosx">). |
871b0233 | 961 | |
0d017f4d | 962 | This restriction is due to the wide-spread and remarkably convenient |
19799a22 | 963 | custom of using run-time determined strings as patterns. For example: |
871b0233 IZ |
964 | |
965 | $re = <>; | |
966 | chomp $re; | |
967 | $string =~ /$re/; | |
968 | ||
14218588 GS |
969 | Before Perl knew how to execute interpolated code within a pattern, |
970 | this operation was completely safe from a security point of view, | |
971 | although it could raise an exception from an illegal pattern. If | |
972 | you turn on the C<use re 'eval'>, though, it is no longer secure, | |
973 | so you should only do so if you are also using taint checking. | |
974 | Better yet, use the carefully constrained evaluation within a Safe | |
cc46d5f2 | 975 | compartment. See L<perlsec> for details about both these mechanisms. |
871b0233 | 976 | |
e95d7314 GG |
977 | B<WARNING>: Use of lexical (C<my>) variables in these blocks is |
978 | broken. The result is unpredictable and will make perl unstable. The | |
979 | workaround is to use global (C<our>) variables. | |
980 | ||
981 | B<WARNING>: Because Perl's regex engine is currently not re-entrant, | |
982 | interpolated code may not invoke the regex engine either directly with | |
983 | C<m//> or C<s///>), or indirectly with functions such as | |
984 | C<split>. Invoking the regex engine in these blocks will make perl | |
985 | unstable. | |
8988a1bb | 986 | |
14455d6c | 987 | =item C<(??{ code })> |
d74e8afc ITB |
988 | X<(??{})> |
989 | X<regex, postponed> X<regexp, postponed> X<regular expression, postponed> | |
0f5d15d6 | 990 | |
19799a22 | 991 | B<WARNING>: This extended regular expression feature is considered |
b9b4dddf YO |
992 | experimental, and may be changed without notice. Code executed that |
993 | has side effects may not perform identically from version to version | |
994 | due to the effect of future optimisations in the regex engine. | |
0f5d15d6 | 995 | |
19799a22 GS |
996 | This is a "postponed" regular subexpression. The C<code> is evaluated |
997 | at run time, at the moment this subexpression may match. The result | |
998 | of evaluation is considered as a regular expression and matched as | |
61528107 | 999 | if it were inserted instead of this construct. Note that this means |
6bda09f9 YO |
1000 | that the contents of capture buffers defined inside an eval'ed pattern |
1001 | are not available outside of the pattern, and vice versa, there is no | |
1002 | way for the inner pattern to refer to a capture buffer defined outside. | |
1003 | Thus, | |
1004 | ||
1005 | ('a' x 100)=~/(??{'(.)' x 100})/ | |
1006 | ||
81714fb9 | 1007 | B<will> match, it will B<not> set $1. |
0f5d15d6 | 1008 | |
428594d9 | 1009 | The C<code> is not interpolated. As before, the rules to determine |
19799a22 GS |
1010 | where the C<code> ends are currently somewhat convoluted. |
1011 | ||
1012 | The following pattern matches a parenthesized group: | |
0f5d15d6 IZ |
1013 | |
1014 | $re = qr{ | |
1015 | \( | |
1016 | (?: | |
1017 | (?> [^()]+ ) # Non-parens without backtracking | |
1018 | | | |
14455d6c | 1019 | (??{ $re }) # Group with matching parens |
0f5d15d6 IZ |
1020 | )* |
1021 | \) | |
1022 | }x; | |
1023 | ||
6bda09f9 YO |
1024 | See also C<(?PARNO)> for a different, more efficient way to accomplish |
1025 | the same task. | |
1026 | ||
0b370c0a A |
1027 | For reasons of security, this construct is forbidden if the regular |
1028 | expression involves run-time interpolation of variables, unless the | |
1029 | perilous C<use re 'eval'> pragma has been used (see L<re>), or the | |
1030 | variables contain results of C<qr//> operator (see | |
1031 | L<perlop/"qr/STRING/imosx">). | |
1032 | ||
5d458dd8 | 1033 | Because perl's regex engine is not currently re-entrant, delayed |
8988a1bb DD |
1034 | code may not invoke the regex engine either directly with C<m//> or C<s///>), |
1035 | or indirectly with functions such as C<split>. | |
1036 | ||
5d458dd8 YO |
1037 | Recursing deeper than 50 times without consuming any input string will |
1038 | result in a fatal error. The maximum depth is compiled into perl, so | |
6bda09f9 YO |
1039 | changing it requires a custom build. |
1040 | ||
542fa716 YO |
1041 | =item C<(?PARNO)> C<(?-PARNO)> C<(?+PARNO)> C<(?R)> C<(?0)> |
1042 | X<(?PARNO)> X<(?1)> X<(?R)> X<(?0)> X<(?-1)> X<(?+1)> X<(?-PARNO)> X<(?+PARNO)> | |
6bda09f9 | 1043 | X<regex, recursive> X<regexp, recursive> X<regular expression, recursive> |
542fa716 | 1044 | X<regex, relative recursion> |
6bda09f9 | 1045 | |
81714fb9 YO |
1046 | Similar to C<(??{ code })> except it does not involve compiling any code, |
1047 | instead it treats the contents of a capture buffer as an independent | |
61528107 | 1048 | pattern that must match at the current position. Capture buffers |
81714fb9 | 1049 | contained by the pattern will have the value as determined by the |
6bda09f9 YO |
1050 | outermost recursion. |
1051 | ||
894be9b7 YO |
1052 | PARNO is a sequence of digits (not starting with 0) whose value reflects |
1053 | the paren-number of the capture buffer to recurse to. C<(?R)> recurses to | |
1054 | the beginning of the whole pattern. C<(?0)> is an alternate syntax for | |
542fa716 YO |
1055 | C<(?R)>. If PARNO is preceded by a plus or minus sign then it is assumed |
1056 | to be relative, with negative numbers indicating preceding capture buffers | |
1057 | and positive ones following. Thus C<(?-1)> refers to the most recently | |
1058 | declared buffer, and C<(?+1)> indicates the next buffer to be declared. | |
c74340f9 YO |
1059 | Note that the counting for relative recursion differs from that of |
1060 | relative backreferences, in that with recursion unclosed buffers B<are> | |
1061 | included. | |
6bda09f9 | 1062 | |
81714fb9 | 1063 | The following pattern matches a function foo() which may contain |
f145b7e9 | 1064 | balanced parentheses as the argument. |
6bda09f9 YO |
1065 | |
1066 | $re = qr{ ( # paren group 1 (full function) | |
81714fb9 | 1067 | foo |
6bda09f9 YO |
1068 | ( # paren group 2 (parens) |
1069 | \( | |
1070 | ( # paren group 3 (contents of parens) | |
1071 | (?: | |
1072 | (?> [^()]+ ) # Non-parens without backtracking | |
1073 | | | |
1074 | (?2) # Recurse to start of paren group 2 | |
1075 | )* | |
1076 | ) | |
1077 | \) | |
1078 | ) | |
1079 | ) | |
1080 | }x; | |
1081 | ||
1082 | If the pattern was used as follows | |
1083 | ||
1084 | 'foo(bar(baz)+baz(bop))'=~/$re/ | |
1085 | and print "\$1 = $1\n", | |
1086 | "\$2 = $2\n", | |
1087 | "\$3 = $3\n"; | |
1088 | ||
1089 | the output produced should be the following: | |
1090 | ||
1091 | $1 = foo(bar(baz)+baz(bop)) | |
1092 | $2 = (bar(baz)+baz(bop)) | |
81714fb9 | 1093 | $3 = bar(baz)+baz(bop) |
6bda09f9 | 1094 | |
81714fb9 | 1095 | If there is no corresponding capture buffer defined, then it is a |
61528107 | 1096 | fatal error. Recursing deeper than 50 times without consuming any input |
81714fb9 | 1097 | string will also result in a fatal error. The maximum depth is compiled |
6bda09f9 YO |
1098 | into perl, so changing it requires a custom build. |
1099 | ||
542fa716 YO |
1100 | The following shows how using negative indexing can make it |
1101 | easier to embed recursive patterns inside of a C<qr//> construct | |
1102 | for later use: | |
1103 | ||
1104 | my $parens = qr/(\((?:[^()]++|(?-1))*+\))/; | |
1105 | if (/foo $parens \s+ + \s+ bar $parens/x) { | |
1106 | # do something here... | |
1107 | } | |
1108 | ||
81714fb9 | 1109 | B<Note> that this pattern does not behave the same way as the equivalent |
0d017f4d | 1110 | PCRE or Python construct of the same form. In Perl you can backtrack into |
6bda09f9 | 1111 | a recursed group, in PCRE and Python the recursed into group is treated |
542fa716 YO |
1112 | as atomic. Also, modifiers are resolved at compile time, so constructs |
1113 | like (?i:(?1)) or (?:(?i)(?1)) do not affect how the sub-pattern will | |
1114 | be processed. | |
6bda09f9 | 1115 | |
894be9b7 YO |
1116 | =item C<(?&NAME)> |
1117 | X<(?&NAME)> | |
1118 | ||
0d017f4d WL |
1119 | Recurse to a named subpattern. Identical to C<(?PARNO)> except that the |
1120 | parenthesis to recurse to is determined by name. If multiple parentheses have | |
894be9b7 YO |
1121 | the same name, then it recurses to the leftmost. |
1122 | ||
1123 | It is an error to refer to a name that is not declared somewhere in the | |
1124 | pattern. | |
1125 | ||
1f1031fe YO |
1126 | B<NOTE:> In order to make things easier for programmers with experience |
1127 | with the Python or PCRE regex engines the pattern C<< (?P>NAME) >> | |
64c5a566 | 1128 | may be used instead of C<< (?&NAME) >>. |
1f1031fe | 1129 | |
e2e6a0f1 YO |
1130 | =item C<(?(condition)yes-pattern|no-pattern)> |
1131 | X<(?()> | |
286f584a | 1132 | |
e2e6a0f1 | 1133 | =item C<(?(condition)yes-pattern)> |
286f584a | 1134 | |
e2e6a0f1 YO |
1135 | Conditional expression. C<(condition)> should be either an integer in |
1136 | parentheses (which is valid if the corresponding pair of parentheses | |
1137 | matched), a look-ahead/look-behind/evaluate zero-width assertion, a | |
1138 | name in angle brackets or single quotes (which is valid if a buffer | |
1139 | with the given name matched), or the special symbol (R) (true when | |
1140 | evaluated inside of recursion or eval). Additionally the R may be | |
1141 | followed by a number, (which will be true when evaluated when recursing | |
1142 | inside of the appropriate group), or by C<&NAME>, in which case it will | |
1143 | be true only when evaluated during recursion in the named group. | |
1144 | ||
1145 | Here's a summary of the possible predicates: | |
1146 | ||
1147 | =over 4 | |
1148 | ||
1149 | =item (1) (2) ... | |
1150 | ||
1151 | Checks if the numbered capturing buffer has matched something. | |
1152 | ||
1153 | =item (<NAME>) ('NAME') | |
1154 | ||
1155 | Checks if a buffer with the given name has matched something. | |
1156 | ||
1157 | =item (?{ CODE }) | |
1158 | ||
1159 | Treats the code block as the condition. | |
1160 | ||
1161 | =item (R) | |
1162 | ||
1163 | Checks if the expression has been evaluated inside of recursion. | |
1164 | ||
1165 | =item (R1) (R2) ... | |
1166 | ||
1167 | Checks if the expression has been evaluated while executing directly | |
1168 | inside of the n-th capture group. This check is the regex equivalent of | |
1169 | ||
1170 | if ((caller(0))[3] eq 'subname') { ... } | |
1171 | ||
1172 | In other words, it does not check the full recursion stack. | |
1173 | ||
1174 | =item (R&NAME) | |
1175 | ||
1176 | Similar to C<(R1)>, this predicate checks to see if we're executing | |
1177 | directly inside of the leftmost group with a given name (this is the same | |
1178 | logic used by C<(?&NAME)> to disambiguate). It does not check the full | |
1179 | stack, but only the name of the innermost active recursion. | |
1180 | ||
1181 | =item (DEFINE) | |
1182 | ||
1183 | In this case, the yes-pattern is never directly executed, and no | |
1184 | no-pattern is allowed. Similar in spirit to C<(?{0})> but more efficient. | |
1185 | See below for details. | |
1186 | ||
1187 | =back | |
1188 | ||
1189 | For example: | |
1190 | ||
1191 | m{ ( \( )? | |
1192 | [^()]+ | |
1193 | (?(1) \) ) | |
1194 | }x | |
1195 | ||
1196 | matches a chunk of non-parentheses, possibly included in parentheses | |
1197 | themselves. | |
1198 | ||
1199 | A special form is the C<(DEFINE)> predicate, which never executes directly | |
1200 | its yes-pattern, and does not allow a no-pattern. This allows to define | |
1201 | subpatterns which will be executed only by using the recursion mechanism. | |
1202 | This way, you can define a set of regular expression rules that can be | |
1203 | bundled into any pattern you choose. | |
1204 | ||
1205 | It is recommended that for this usage you put the DEFINE block at the | |
1206 | end of the pattern, and that you name any subpatterns defined within it. | |
1207 | ||
1208 | Also, it's worth noting that patterns defined this way probably will | |
1209 | not be as efficient, as the optimiser is not very clever about | |
1210 | handling them. | |
1211 | ||
1212 | An example of how this might be used is as follows: | |
1213 | ||
2bf803e2 | 1214 | /(?<NAME>(?&NAME_PAT))(?<ADDR>(?&ADDRESS_PAT)) |
e2e6a0f1 | 1215 | (?(DEFINE) |
2bf803e2 YO |
1216 | (?<NAME_PAT>....) |
1217 | (?<ADRESS_PAT>....) | |
e2e6a0f1 YO |
1218 | )/x |
1219 | ||
1220 | Note that capture buffers matched inside of recursion are not accessible | |
0d017f4d | 1221 | after the recursion returns, so the extra layer of capturing buffers is |
e2e6a0f1 YO |
1222 | necessary. Thus C<$+{NAME_PAT}> would not be defined even though |
1223 | C<$+{NAME}> would be. | |
286f584a | 1224 | |
c47ff5f1 | 1225 | =item C<< (?>pattern) >> |
6bda09f9 | 1226 | X<backtrack> X<backtracking> X<atomic> X<possessive> |
5a964f20 | 1227 | |
19799a22 GS |
1228 | An "independent" subexpression, one which matches the substring |
1229 | that a I<standalone> C<pattern> would match if anchored at the given | |
9da458fc | 1230 | position, and it matches I<nothing other than this substring>. This |
19799a22 GS |
1231 | construct is useful for optimizations of what would otherwise be |
1232 | "eternal" matches, because it will not backtrack (see L<"Backtracking">). | |
9da458fc IZ |
1233 | It may also be useful in places where the "grab all you can, and do not |
1234 | give anything back" semantic is desirable. | |
19799a22 | 1235 | |
c47ff5f1 | 1236 | For example: C<< ^(?>a*)ab >> will never match, since C<< (?>a*) >> |
19799a22 GS |
1237 | (anchored at the beginning of string, as above) will match I<all> |
1238 | characters C<a> at the beginning of string, leaving no C<a> for | |
1239 | C<ab> to match. In contrast, C<a*ab> will match the same as C<a+b>, | |
1240 | since the match of the subgroup C<a*> is influenced by the following | |
1241 | group C<ab> (see L<"Backtracking">). In particular, C<a*> inside | |
1242 | C<a*ab> will match fewer characters than a standalone C<a*>, since | |
1243 | this makes the tail match. | |
1244 | ||
c47ff5f1 | 1245 | An effect similar to C<< (?>pattern) >> may be achieved by writing |
19799a22 GS |
1246 | C<(?=(pattern))\1>. This matches the same substring as a standalone |
1247 | C<a+>, and the following C<\1> eats the matched string; it therefore | |
c47ff5f1 | 1248 | makes a zero-length assertion into an analogue of C<< (?>...) >>. |
19799a22 GS |
1249 | (The difference between these two constructs is that the second one |
1250 | uses a capturing group, thus shifting ordinals of backreferences | |
1251 | in the rest of a regular expression.) | |
1252 | ||
1253 | Consider this pattern: | |
c277df42 | 1254 | |
871b0233 | 1255 | m{ \( |
e2e6a0f1 YO |
1256 | ( |
1257 | [^()]+ # x+ | |
1258 | | | |
871b0233 IZ |
1259 | \( [^()]* \) |
1260 | )+ | |
e2e6a0f1 | 1261 | \) |
871b0233 | 1262 | }x |
5a964f20 | 1263 | |
19799a22 GS |
1264 | That will efficiently match a nonempty group with matching parentheses |
1265 | two levels deep or less. However, if there is no such group, it | |
1266 | will take virtually forever on a long string. That's because there | |
1267 | are so many different ways to split a long string into several | |
1268 | substrings. This is what C<(.+)+> is doing, and C<(.+)+> is similar | |
1269 | to a subpattern of the above pattern. Consider how the pattern | |
1270 | above detects no-match on C<((()aaaaaaaaaaaaaaaaaa> in several | |
1271 | seconds, but that each extra letter doubles this time. This | |
1272 | exponential performance will make it appear that your program has | |
14218588 | 1273 | hung. However, a tiny change to this pattern |
5a964f20 | 1274 | |
e2e6a0f1 YO |
1275 | m{ \( |
1276 | ( | |
1277 | (?> [^()]+ ) # change x+ above to (?> x+ ) | |
1278 | | | |
871b0233 IZ |
1279 | \( [^()]* \) |
1280 | )+ | |
e2e6a0f1 | 1281 | \) |
871b0233 | 1282 | }x |
c277df42 | 1283 | |
c47ff5f1 | 1284 | which uses C<< (?>...) >> matches exactly when the one above does (verifying |
5a964f20 TC |
1285 | this yourself would be a productive exercise), but finishes in a fourth |
1286 | the time when used on a similar string with 1000000 C<a>s. Be aware, | |
1287 | however, that this pattern currently triggers a warning message under | |
9f1b1f2d | 1288 | the C<use warnings> pragma or B<-w> switch saying it |
6bab786b | 1289 | C<"matches null string many times in regex">. |
c277df42 | 1290 | |
c47ff5f1 | 1291 | On simple groups, such as the pattern C<< (?> [^()]+ ) >>, a comparable |
19799a22 | 1292 | effect may be achieved by negative look-ahead, as in C<[^()]+ (?! [^()] )>. |
c277df42 IZ |
1293 | This was only 4 times slower on a string with 1000000 C<a>s. |
1294 | ||
9da458fc IZ |
1295 | The "grab all you can, and do not give anything back" semantic is desirable |
1296 | in many situations where on the first sight a simple C<()*> looks like | |
1297 | the correct solution. Suppose we parse text with comments being delimited | |
1298 | by C<#> followed by some optional (horizontal) whitespace. Contrary to | |
4375e838 | 1299 | its appearance, C<#[ \t]*> I<is not> the correct subexpression to match |
9da458fc IZ |
1300 | the comment delimiter, because it may "give up" some whitespace if |
1301 | the remainder of the pattern can be made to match that way. The correct | |
1302 | answer is either one of these: | |
1303 | ||
1304 | (?>#[ \t]*) | |
1305 | #[ \t]*(?![ \t]) | |
1306 | ||
1307 | For example, to grab non-empty comments into $1, one should use either | |
1308 | one of these: | |
1309 | ||
1310 | / (?> \# [ \t]* ) ( .+ ) /x; | |
1311 | / \# [ \t]* ( [^ \t] .* ) /x; | |
1312 | ||
1313 | Which one you pick depends on which of these expressions better reflects | |
1314 | the above specification of comments. | |
1315 | ||
6bda09f9 YO |
1316 | In some literature this construct is called "atomic matching" or |
1317 | "possessive matching". | |
1318 | ||
b9b4dddf YO |
1319 | Possessive quantifiers are equivalent to putting the item they are applied |
1320 | to inside of one of these constructs. The following equivalences apply: | |
1321 | ||
1322 | Quantifier Form Bracketing Form | |
1323 | --------------- --------------- | |
1324 | PAT*+ (?>PAT*) | |
1325 | PAT++ (?>PAT+) | |
1326 | PAT?+ (?>PAT?) | |
1327 | PAT{min,max}+ (?>PAT{min,max}) | |
1328 | ||
e2e6a0f1 YO |
1329 | =back |
1330 | ||
1331 | =head2 Special Backtracking Control Verbs | |
1332 | ||
1333 | B<WARNING:> These patterns are experimental and subject to change or | |
0d017f4d | 1334 | removal in a future version of Perl. Their usage in production code should |
e2e6a0f1 YO |
1335 | be noted to avoid problems during upgrades. |
1336 | ||
1337 | These special patterns are generally of the form C<(*VERB:ARG)>. Unless | |
1338 | otherwise stated the ARG argument is optional; in some cases, it is | |
1339 | forbidden. | |
1340 | ||
1341 | Any pattern containing a special backtracking verb that allows an argument | |
e1020413 | 1342 | has the special behaviour that when executed it sets the current package's |
5d458dd8 YO |
1343 | C<$REGERROR> and C<$REGMARK> variables. When doing so the following |
1344 | rules apply: | |
e2e6a0f1 | 1345 | |
5d458dd8 YO |
1346 | On failure, the C<$REGERROR> variable will be set to the ARG value of the |
1347 | verb pattern, if the verb was involved in the failure of the match. If the | |
1348 | ARG part of the pattern was omitted, then C<$REGERROR> will be set to the | |
1349 | name of the last C<(*MARK:NAME)> pattern executed, or to TRUE if there was | |
1350 | none. Also, the C<$REGMARK> variable will be set to FALSE. | |
e2e6a0f1 | 1351 | |
5d458dd8 YO |
1352 | On a successful match, the C<$REGERROR> variable will be set to FALSE, and |
1353 | the C<$REGMARK> variable will be set to the name of the last | |
1354 | C<(*MARK:NAME)> pattern executed. See the explanation for the | |
1355 | C<(*MARK:NAME)> verb below for more details. | |
e2e6a0f1 | 1356 | |
5d458dd8 YO |
1357 | B<NOTE:> C<$REGERROR> and C<$REGMARK> are not magic variables like C<$1> |
1358 | and most other regex related variables. They are not local to a scope, nor | |
1359 | readonly, but instead are volatile package variables similar to C<$AUTOLOAD>. | |
1360 | Use C<local> to localize changes to them to a specific scope if necessary. | |
e2e6a0f1 YO |
1361 | |
1362 | If a pattern does not contain a special backtracking verb that allows an | |
5d458dd8 | 1363 | argument, then C<$REGERROR> and C<$REGMARK> are not touched at all. |
e2e6a0f1 YO |
1364 | |
1365 | =over 4 | |
1366 | ||
1367 | =item Verbs that take an argument | |
1368 | ||
1369 | =over 4 | |
1370 | ||
5d458dd8 | 1371 | =item C<(*PRUNE)> C<(*PRUNE:NAME)> |
f7819f85 | 1372 | X<(*PRUNE)> X<(*PRUNE:NAME)> |
54612592 | 1373 | |
5d458dd8 YO |
1374 | This zero-width pattern prunes the backtracking tree at the current point |
1375 | when backtracked into on failure. Consider the pattern C<A (*PRUNE) B>, | |
1376 | where A and B are complex patterns. Until the C<(*PRUNE)> verb is reached, | |
1377 | A may backtrack as necessary to match. Once it is reached, matching | |
1378 | continues in B, which may also backtrack as necessary; however, should B | |
1379 | not match, then no further backtracking will take place, and the pattern | |
1380 | will fail outright at the current starting position. | |
54612592 YO |
1381 | |
1382 | The following example counts all the possible matching strings in a | |
1383 | pattern (without actually matching any of them). | |
1384 | ||
e2e6a0f1 | 1385 | 'aaab' =~ /a+b?(?{print "$&\n"; $count++})(*FAIL)/; |
54612592 YO |
1386 | print "Count=$count\n"; |
1387 | ||
1388 | which produces: | |
1389 | ||
1390 | aaab | |
1391 | aaa | |
1392 | aa | |
1393 | a | |
1394 | aab | |
1395 | aa | |
1396 | a | |
1397 | ab | |
1398 | a | |
1399 | Count=9 | |
1400 | ||
5d458dd8 | 1401 | If we add a C<(*PRUNE)> before the count like the following |
54612592 | 1402 | |
5d458dd8 | 1403 | 'aaab' =~ /a+b?(*PRUNE)(?{print "$&\n"; $count++})(*FAIL)/; |
54612592 YO |
1404 | print "Count=$count\n"; |
1405 | ||
1406 | we prevent backtracking and find the count of the longest matching | |
353c6505 | 1407 | at each matching starting point like so: |
54612592 YO |
1408 | |
1409 | aaab | |
1410 | aab | |
1411 | ab | |
1412 | Count=3 | |
1413 | ||
5d458dd8 | 1414 | Any number of C<(*PRUNE)> assertions may be used in a pattern. |
54612592 | 1415 | |
5d458dd8 YO |
1416 | See also C<< (?>pattern) >> and possessive quantifiers for other ways to |
1417 | control backtracking. In some cases, the use of C<(*PRUNE)> can be | |
1418 | replaced with a C<< (?>pattern) >> with no functional difference; however, | |
1419 | C<(*PRUNE)> can be used to handle cases that cannot be expressed using a | |
1420 | C<< (?>pattern) >> alone. | |
54612592 | 1421 | |
e2e6a0f1 | 1422 | |
5d458dd8 YO |
1423 | =item C<(*SKIP)> C<(*SKIP:NAME)> |
1424 | X<(*SKIP)> | |
e2e6a0f1 | 1425 | |
5d458dd8 | 1426 | This zero-width pattern is similar to C<(*PRUNE)>, except that on |
e2e6a0f1 | 1427 | failure it also signifies that whatever text that was matched leading up |
5d458dd8 YO |
1428 | to the C<(*SKIP)> pattern being executed cannot be part of I<any> match |
1429 | of this pattern. This effectively means that the regex engine "skips" forward | |
1430 | to this position on failure and tries to match again, (assuming that | |
1431 | there is sufficient room to match). | |
1432 | ||
1433 | The name of the C<(*SKIP:NAME)> pattern has special significance. If a | |
1434 | C<(*MARK:NAME)> was encountered while matching, then it is that position | |
1435 | which is used as the "skip point". If no C<(*MARK)> of that name was | |
1436 | encountered, then the C<(*SKIP)> operator has no effect. When used | |
1437 | without a name the "skip point" is where the match point was when | |
1438 | executing the (*SKIP) pattern. | |
1439 | ||
1440 | Compare the following to the examples in C<(*PRUNE)>, note the string | |
24b23f37 YO |
1441 | is twice as long: |
1442 | ||
5d458dd8 | 1443 | 'aaabaaab' =~ /a+b?(*SKIP)(?{print "$&\n"; $count++})(*FAIL)/; |
24b23f37 YO |
1444 | print "Count=$count\n"; |
1445 | ||
1446 | outputs | |
1447 | ||
1448 | aaab | |
1449 | aaab | |
1450 | Count=2 | |
1451 | ||
5d458dd8 | 1452 | Once the 'aaab' at the start of the string has matched, and the C<(*SKIP)> |
353c6505 | 1453 | executed, the next starting point will be where the cursor was when the |
5d458dd8 YO |
1454 | C<(*SKIP)> was executed. |
1455 | ||
5d458dd8 YO |
1456 | =item C<(*MARK:NAME)> C<(*:NAME)> |
1457 | X<(*MARK)> C<(*MARK:NAME)> C<(*:NAME)> | |
1458 | ||
1459 | This zero-width pattern can be used to mark the point reached in a string | |
1460 | when a certain part of the pattern has been successfully matched. This | |
1461 | mark may be given a name. A later C<(*SKIP)> pattern will then skip | |
1462 | forward to that point if backtracked into on failure. Any number of | |
b4222fa9 | 1463 | C<(*MARK)> patterns are allowed, and the NAME portion may be duplicated. |
5d458dd8 YO |
1464 | |
1465 | In addition to interacting with the C<(*SKIP)> pattern, C<(*MARK:NAME)> | |
1466 | can be used to "label" a pattern branch, so that after matching, the | |
1467 | program can determine which branches of the pattern were involved in the | |
1468 | match. | |
1469 | ||
1470 | When a match is successful, the C<$REGMARK> variable will be set to the | |
1471 | name of the most recently executed C<(*MARK:NAME)> that was involved | |
1472 | in the match. | |
1473 | ||
1474 | This can be used to determine which branch of a pattern was matched | |
c62285ac | 1475 | without using a separate capture buffer for each branch, which in turn |
5d458dd8 YO |
1476 | can result in a performance improvement, as perl cannot optimize |
1477 | C</(?:(x)|(y)|(z))/> as efficiently as something like | |
1478 | C</(?:x(*MARK:x)|y(*MARK:y)|z(*MARK:z))/>. | |
1479 | ||
1480 | When a match has failed, and unless another verb has been involved in | |
1481 | failing the match and has provided its own name to use, the C<$REGERROR> | |
1482 | variable will be set to the name of the most recently executed | |
1483 | C<(*MARK:NAME)>. | |
1484 | ||
1485 | See C<(*SKIP)> for more details. | |
1486 | ||
b62d2d15 YO |
1487 | As a shortcut C<(*MARK:NAME)> can be written C<(*:NAME)>. |
1488 | ||
5d458dd8 YO |
1489 | =item C<(*THEN)> C<(*THEN:NAME)> |
1490 | ||
241e7389 | 1491 | This is similar to the "cut group" operator C<::> from Perl 6. Like |
5d458dd8 YO |
1492 | C<(*PRUNE)>, this verb always matches, and when backtracked into on |
1493 | failure, it causes the regex engine to try the next alternation in the | |
1494 | innermost enclosing group (capturing or otherwise). | |
1495 | ||
1496 | Its name comes from the observation that this operation combined with the | |
1497 | alternation operator (C<|>) can be used to create what is essentially a | |
1498 | pattern-based if/then/else block: | |
1499 | ||
1500 | ( COND (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ ) | |
1501 | ||
1502 | Note that if this operator is used and NOT inside of an alternation then | |
1503 | it acts exactly like the C<(*PRUNE)> operator. | |
1504 | ||
1505 | / A (*PRUNE) B / | |
1506 | ||
1507 | is the same as | |
1508 | ||
1509 | / A (*THEN) B / | |
1510 | ||
1511 | but | |
1512 | ||
1513 | / ( A (*THEN) B | C (*THEN) D ) / | |
1514 | ||
1515 | is not the same as | |
1516 | ||
1517 | / ( A (*PRUNE) B | C (*PRUNE) D ) / | |
1518 | ||
1519 | as after matching the A but failing on the B the C<(*THEN)> verb will | |
1520 | backtrack and try C; but the C<(*PRUNE)> verb will simply fail. | |
24b23f37 | 1521 | |
e2e6a0f1 YO |
1522 | =item C<(*COMMIT)> |
1523 | X<(*COMMIT)> | |
24b23f37 | 1524 | |
241e7389 | 1525 | This is the Perl 6 "commit pattern" C<< <commit> >> or C<:::>. It's a |
5d458dd8 YO |
1526 | zero-width pattern similar to C<(*SKIP)>, except that when backtracked |
1527 | into on failure it causes the match to fail outright. No further attempts | |
1528 | to find a valid match by advancing the start pointer will occur again. | |
1529 | For example, | |
24b23f37 | 1530 | |
e2e6a0f1 | 1531 | 'aaabaaab' =~ /a+b?(*COMMIT)(?{print "$&\n"; $count++})(*FAIL)/; |
24b23f37 YO |
1532 | print "Count=$count\n"; |
1533 | ||
1534 | outputs | |
1535 | ||
1536 | aaab | |
1537 | Count=1 | |
1538 | ||
e2e6a0f1 YO |
1539 | In other words, once the C<(*COMMIT)> has been entered, and if the pattern |
1540 | does not match, the regex engine will not try any further matching on the | |
1541 | rest of the string. | |
c277df42 | 1542 | |
e2e6a0f1 | 1543 | =back |
9af228c6 | 1544 | |
e2e6a0f1 | 1545 | =item Verbs without an argument |
9af228c6 YO |
1546 | |
1547 | =over 4 | |
1548 | ||
e2e6a0f1 YO |
1549 | =item C<(*FAIL)> C<(*F)> |
1550 | X<(*FAIL)> X<(*F)> | |
9af228c6 | 1551 | |
e2e6a0f1 YO |
1552 | This pattern matches nothing and always fails. It can be used to force the |
1553 | engine to backtrack. It is equivalent to C<(?!)>, but easier to read. In | |
1554 | fact, C<(?!)> gets optimised into C<(*FAIL)> internally. | |
9af228c6 | 1555 | |
e2e6a0f1 | 1556 | It is probably useful only when combined with C<(?{})> or C<(??{})>. |
9af228c6 | 1557 | |
e2e6a0f1 YO |
1558 | =item C<(*ACCEPT)> |
1559 | X<(*ACCEPT)> | |
9af228c6 | 1560 | |
e2e6a0f1 YO |
1561 | B<WARNING:> This feature is highly experimental. It is not recommended |
1562 | for production code. | |
9af228c6 | 1563 | |
e2e6a0f1 YO |
1564 | This pattern matches nothing and causes the end of successful matching at |
1565 | the point at which the C<(*ACCEPT)> pattern was encountered, regardless of | |
1566 | whether there is actually more to match in the string. When inside of a | |
0d017f4d | 1567 | nested pattern, such as recursion, or in a subpattern dynamically generated |
e2e6a0f1 | 1568 | via C<(??{})>, only the innermost pattern is ended immediately. |
9af228c6 | 1569 | |
e2e6a0f1 YO |
1570 | If the C<(*ACCEPT)> is inside of capturing buffers then the buffers are |
1571 | marked as ended at the point at which the C<(*ACCEPT)> was encountered. | |
1572 | For instance: | |
9af228c6 | 1573 | |
e2e6a0f1 | 1574 | 'AB' =~ /(A (A|B(*ACCEPT)|C) D)(E)/x; |
9af228c6 | 1575 | |
e2e6a0f1 | 1576 | will match, and C<$1> will be C<AB> and C<$2> will be C<B>, C<$3> will not |
0d017f4d | 1577 | be set. If another branch in the inner parentheses were matched, such as in the |
e2e6a0f1 | 1578 | string 'ACDE', then the C<D> and C<E> would have to be matched as well. |
9af228c6 YO |
1579 | |
1580 | =back | |
c277df42 | 1581 | |
a0d0e21e LW |
1582 | =back |
1583 | ||
c07a80fd | 1584 | =head2 Backtracking |
d74e8afc | 1585 | X<backtrack> X<backtracking> |
c07a80fd | 1586 | |
35a734be IZ |
1587 | NOTE: This section presents an abstract approximation of regular |
1588 | expression behavior. For a more rigorous (and complicated) view of | |
1589 | the rules involved in selecting a match among possible alternatives, | |
0d017f4d | 1590 | see L<Combining RE Pieces>. |
35a734be | 1591 | |
c277df42 | 1592 | A fundamental feature of regular expression matching involves the |
5a964f20 | 1593 | notion called I<backtracking>, which is currently used (when needed) |
0d017f4d | 1594 | by all regular non-possessive expression quantifiers, namely C<*>, C<*?>, C<+>, |
9da458fc IZ |
1595 | C<+?>, C<{n,m}>, and C<{n,m}?>. Backtracking is often optimized |
1596 | internally, but the general principle outlined here is valid. | |
c07a80fd | 1597 | |
1598 | For a regular expression to match, the I<entire> regular expression must | |
1599 | match, not just part of it. So if the beginning of a pattern containing a | |
1600 | quantifier succeeds in a way that causes later parts in the pattern to | |
1601 | fail, the matching engine backs up and recalculates the beginning | |
1602 | part--that's why it's called backtracking. | |
1603 | ||
1604 | Here is an example of backtracking: Let's say you want to find the | |
1605 | word following "foo" in the string "Food is on the foo table.": | |
1606 | ||
1607 | $_ = "Food is on the foo table."; | |
1608 | if ( /\b(foo)\s+(\w+)/i ) { | |
1609 | print "$2 follows $1.\n"; | |
1610 | } | |
1611 | ||
1612 | When the match runs, the first part of the regular expression (C<\b(foo)>) | |
1613 | finds a possible match right at the beginning of the string, and loads up | |
1614 | $1 with "Foo". However, as soon as the matching engine sees that there's | |
1615 | no whitespace following the "Foo" that it had saved in $1, it realizes its | |
68dc0745 | 1616 | mistake and starts over again one character after where it had the |
c07a80fd | 1617 | tentative match. This time it goes all the way until the next occurrence |
1618 | of "foo". The complete regular expression matches this time, and you get | |
1619 | the expected output of "table follows foo." | |
1620 | ||
1621 | Sometimes minimal matching can help a lot. Imagine you'd like to match | |
1622 | everything between "foo" and "bar". Initially, you write something | |
1623 | like this: | |
1624 | ||
1625 | $_ = "The food is under the bar in the barn."; | |
1626 | if ( /foo(.*)bar/ ) { | |
1627 | print "got <$1>\n"; | |
1628 | } | |
1629 | ||
1630 | Which perhaps unexpectedly yields: | |
1631 | ||
1632 | got <d is under the bar in the > | |
1633 | ||
1634 | That's because C<.*> was greedy, so you get everything between the | |
14218588 | 1635 | I<first> "foo" and the I<last> "bar". Here it's more effective |
c07a80fd | 1636 | to use minimal matching to make sure you get the text between a "foo" |
1637 | and the first "bar" thereafter. | |
1638 | ||
1639 | if ( /foo(.*?)bar/ ) { print "got <$1>\n" } | |
1640 | got <d is under the > | |
1641 | ||
0d017f4d | 1642 | Here's another example. Let's say you'd like to match a number at the end |
b6e13d97 | 1643 | of a string, and you also want to keep the preceding part of the match. |
c07a80fd | 1644 | So you write this: |
1645 | ||
1646 | $_ = "I have 2 numbers: 53147"; | |
1647 | if ( /(.*)(\d*)/ ) { # Wrong! | |
1648 | print "Beginning is <$1>, number is <$2>.\n"; | |
1649 | } | |
1650 | ||
1651 | That won't work at all, because C<.*> was greedy and gobbled up the | |
1652 | whole string. As C<\d*> can match on an empty string the complete | |
1653 | regular expression matched successfully. | |
1654 | ||
8e1088bc | 1655 | Beginning is <I have 2 numbers: 53147>, number is <>. |
c07a80fd | 1656 | |
1657 | Here are some variants, most of which don't work: | |
1658 | ||
1659 | $_ = "I have 2 numbers: 53147"; | |
1660 | @pats = qw{ | |
1661 | (.*)(\d*) | |
1662 | (.*)(\d+) | |
1663 | (.*?)(\d*) | |
1664 | (.*?)(\d+) | |
1665 | (.*)(\d+)$ | |
1666 | (.*?)(\d+)$ | |
1667 | (.*)\b(\d+)$ | |
1668 | (.*\D)(\d+)$ | |
1669 | }; | |
1670 | ||
1671 | for $pat (@pats) { | |
1672 | printf "%-12s ", $pat; | |
1673 | if ( /$pat/ ) { | |
1674 | print "<$1> <$2>\n"; | |
1675 | } else { | |
1676 | print "FAIL\n"; | |
1677 | } | |
1678 | } | |
1679 | ||
1680 | That will print out: | |
1681 | ||
1682 | (.*)(\d*) <I have 2 numbers: 53147> <> | |
1683 | (.*)(\d+) <I have 2 numbers: 5314> <7> | |
1684 | (.*?)(\d*) <> <> | |
1685 | (.*?)(\d+) <I have > <2> | |
1686 | (.*)(\d+)$ <I have 2 numbers: 5314> <7> | |
1687 | (.*?)(\d+)$ <I have 2 numbers: > <53147> | |
1688 | (.*)\b(\d+)$ <I have 2 numbers: > <53147> | |
1689 | (.*\D)(\d+)$ <I have 2 numbers: > <53147> | |
1690 | ||
1691 | As you see, this can be a bit tricky. It's important to realize that a | |
1692 | regular expression is merely a set of assertions that gives a definition | |
1693 | of success. There may be 0, 1, or several different ways that the | |
1694 | definition might succeed against a particular string. And if there are | |
5a964f20 TC |
1695 | multiple ways it might succeed, you need to understand backtracking to |
1696 | know which variety of success you will achieve. | |
c07a80fd | 1697 | |
19799a22 | 1698 | When using look-ahead assertions and negations, this can all get even |
8b19b778 | 1699 | trickier. Imagine you'd like to find a sequence of non-digits not |
c07a80fd | 1700 | followed by "123". You might try to write that as |
1701 | ||
871b0233 IZ |
1702 | $_ = "ABC123"; |
1703 | if ( /^\D*(?!123)/ ) { # Wrong! | |
1704 | print "Yup, no 123 in $_\n"; | |
1705 | } | |
c07a80fd | 1706 | |
1707 | But that isn't going to match; at least, not the way you're hoping. It | |
1708 | claims that there is no 123 in the string. Here's a clearer picture of | |
9b9391b2 | 1709 | why that pattern matches, contrary to popular expectations: |
c07a80fd | 1710 | |
4358a253 SS |
1711 | $x = 'ABC123'; |
1712 | $y = 'ABC445'; | |
c07a80fd | 1713 | |
4358a253 SS |
1714 | print "1: got $1\n" if $x =~ /^(ABC)(?!123)/; |
1715 | print "2: got $1\n" if $y =~ /^(ABC)(?!123)/; | |
c07a80fd | 1716 | |
4358a253 SS |
1717 | print "3: got $1\n" if $x =~ /^(\D*)(?!123)/; |
1718 | print "4: got $1\n" if $y =~ /^(\D*)(?!123)/; | |
c07a80fd | 1719 | |
1720 | This prints | |
1721 | ||
1722 | 2: got ABC | |
1723 | 3: got AB | |
1724 | 4: got ABC | |
1725 | ||
5f05dabc | 1726 | You might have expected test 3 to fail because it seems to a more |
c07a80fd | 1727 | general purpose version of test 1. The important difference between |
1728 | them is that test 3 contains a quantifier (C<\D*>) and so can use | |
1729 | backtracking, whereas test 1 will not. What's happening is | |
1730 | that you've asked "Is it true that at the start of $x, following 0 or more | |
5f05dabc | 1731 | non-digits, you have something that's not 123?" If the pattern matcher had |
c07a80fd | 1732 | let C<\D*> expand to "ABC", this would have caused the whole pattern to |
54310121 | 1733 | fail. |
14218588 | 1734 | |
c07a80fd | 1735 | The search engine will initially match C<\D*> with "ABC". Then it will |
14218588 | 1736 | try to match C<(?!123> with "123", which fails. But because |
c07a80fd | 1737 | a quantifier (C<\D*>) has been used in the regular expression, the |
1738 | search engine can backtrack and retry the match differently | |
54310121 | 1739 | in the hope of matching the complete regular expression. |
c07a80fd | 1740 | |
5a964f20 TC |
1741 | The pattern really, I<really> wants to succeed, so it uses the |
1742 | standard pattern back-off-and-retry and lets C<\D*> expand to just "AB" this | |
c07a80fd | 1743 | time. Now there's indeed something following "AB" that is not |
14218588 | 1744 | "123". It's "C123", which suffices. |
c07a80fd | 1745 | |
14218588 GS |
1746 | We can deal with this by using both an assertion and a negation. |
1747 | We'll say that the first part in $1 must be followed both by a digit | |
1748 | and by something that's not "123". Remember that the look-aheads | |
1749 | are zero-width expressions--they only look, but don't consume any | |
1750 | of the string in their match. So rewriting this way produces what | |
c07a80fd | 1751 | you'd expect; that is, case 5 will fail, but case 6 succeeds: |
1752 | ||
4358a253 SS |
1753 | print "5: got $1\n" if $x =~ /^(\D*)(?=\d)(?!123)/; |
1754 | print "6: got $1\n" if $y =~ /^(\D*)(?=\d)(?!123)/; | |
c07a80fd | 1755 | |
1756 | 6: got ABC | |
1757 | ||
5a964f20 | 1758 | In other words, the two zero-width assertions next to each other work as though |
19799a22 | 1759 | they're ANDed together, just as you'd use any built-in assertions: C</^$/> |
c07a80fd | 1760 | matches only if you're at the beginning of the line AND the end of the |
1761 | line simultaneously. The deeper underlying truth is that juxtaposition in | |
1762 | regular expressions always means AND, except when you write an explicit OR | |
1763 | using the vertical bar. C</ab/> means match "a" AND (then) match "b", | |
1764 | although the attempted matches are made at different positions because "a" | |
1765 | is not a zero-width assertion, but a one-width assertion. | |
1766 | ||
0d017f4d | 1767 | B<WARNING>: Particularly complicated regular expressions can take |
14218588 | 1768 | exponential time to solve because of the immense number of possible |
0d017f4d | 1769 | ways they can use backtracking to try for a match. For example, without |
9da458fc IZ |
1770 | internal optimizations done by the regular expression engine, this will |
1771 | take a painfully long time to run: | |
c07a80fd | 1772 | |
e1901655 IZ |
1773 | 'aaaaaaaaaaaa' =~ /((a{0,5}){0,5})*[c]/ |
1774 | ||
1775 | And if you used C<*>'s in the internal groups instead of limiting them | |
1776 | to 0 through 5 matches, then it would take forever--or until you ran | |
1777 | out of stack space. Moreover, these internal optimizations are not | |
1778 | always applicable. For example, if you put C<{0,5}> instead of C<*> | |
1779 | on the external group, no current optimization is applicable, and the | |
1780 | match takes a long time to finish. | |
c07a80fd | 1781 | |
9da458fc IZ |
1782 | A powerful tool for optimizing such beasts is what is known as an |
1783 | "independent group", | |
c47ff5f1 | 1784 | which does not backtrack (see L<C<< (?>pattern) >>>). Note also that |
9da458fc | 1785 | zero-length look-ahead/look-behind assertions will not backtrack to make |
5d458dd8 | 1786 | the tail match, since they are in "logical" context: only |
14218588 | 1787 | whether they match is considered relevant. For an example |
9da458fc | 1788 | where side-effects of look-ahead I<might> have influenced the |
c47ff5f1 | 1789 | following match, see L<C<< (?>pattern) >>>. |
c277df42 | 1790 | |
a0d0e21e | 1791 | =head2 Version 8 Regular Expressions |
d74e8afc | 1792 | X<regular expression, version 8> X<regex, version 8> X<regexp, version 8> |
a0d0e21e | 1793 | |
5a964f20 | 1794 | In case you're not familiar with the "regular" Version 8 regex |
a0d0e21e LW |
1795 | routines, here are the pattern-matching rules not described above. |
1796 | ||
54310121 | 1797 | Any single character matches itself, unless it is a I<metacharacter> |
a0d0e21e | 1798 | with a special meaning described here or above. You can cause |
5a964f20 | 1799 | characters that normally function as metacharacters to be interpreted |
5f05dabc | 1800 | literally by prefixing them with a "\" (e.g., "\." matches a ".", not any |
0d017f4d WL |
1801 | character; "\\" matches a "\"). This escape mechanism is also required |
1802 | for the character used as the pattern delimiter. | |
1803 | ||
1804 | A series of characters matches that series of characters in the target | |
1805 | string, so the pattern C<blurfl> would match "blurfl" in the target | |
1806 | string. | |
a0d0e21e LW |
1807 | |
1808 | You can specify a character class, by enclosing a list of characters | |
5d458dd8 | 1809 | in C<[]>, which will match any character from the list. If the |
a0d0e21e | 1810 | first character after the "[" is "^", the class matches any character not |
14218588 | 1811 | in the list. Within a list, the "-" character specifies a |
5a964f20 | 1812 | range, so that C<a-z> represents all characters between "a" and "z", |
8a4f6ac2 GS |
1813 | inclusive. If you want either "-" or "]" itself to be a member of a |
1814 | class, put it at the start of the list (possibly after a "^"), or | |
1815 | escape it with a backslash. "-" is also taken literally when it is | |
1816 | at the end of the list, just before the closing "]". (The | |
84850974 DD |
1817 | following all specify the same class of three characters: C<[-az]>, |
1818 | C<[az-]>, and C<[a\-z]>. All are different from C<[a-z]>, which | |
5d458dd8 YO |
1819 | specifies a class containing twenty-six characters, even on EBCDIC-based |
1820 | character sets.) Also, if you try to use the character | |
1821 | classes C<\w>, C<\W>, C<\s>, C<\S>, C<\d>, or C<\D> as endpoints of | |
1822 | a range, the "-" is understood literally. | |
a0d0e21e | 1823 | |
8ada0baa JH |
1824 | Note also that the whole range idea is rather unportable between |
1825 | character sets--and even within character sets they may cause results | |
1826 | you probably didn't expect. A sound principle is to use only ranges | |
0d017f4d | 1827 | that begin from and end at either alphabetics of equal case ([a-e], |
8ada0baa JH |
1828 | [A-E]), or digits ([0-9]). Anything else is unsafe. If in doubt, |
1829 | spell out the character sets in full. | |
1830 | ||
54310121 | 1831 | Characters may be specified using a metacharacter syntax much like that |
a0d0e21e LW |
1832 | used in C: "\n" matches a newline, "\t" a tab, "\r" a carriage return, |
1833 | "\f" a form feed, etc. More generally, \I<nnn>, where I<nnn> is a string | |
5d458dd8 YO |
1834 | of octal digits, matches the character whose coded character set value |
1835 | is I<nnn>. Similarly, \xI<nn>, where I<nn> are hexadecimal digits, | |
1836 | matches the character whose numeric value is I<nn>. The expression \cI<x> | |
1837 | matches the character control-I<x>. Finally, the "." metacharacter | |
fb55449c | 1838 | matches any character except "\n" (unless you use C</s>). |
a0d0e21e LW |
1839 | |
1840 | You can specify a series of alternatives for a pattern using "|" to | |
1841 | separate them, so that C<fee|fie|foe> will match any of "fee", "fie", | |
5a964f20 | 1842 | or "foe" in the target string (as would C<f(e|i|o)e>). The |
a0d0e21e LW |
1843 | first alternative includes everything from the last pattern delimiter |
1844 | ("(", "[", or the beginning of the pattern) up to the first "|", and | |
1845 | the last alternative contains everything from the last "|" to the next | |
14218588 GS |
1846 | pattern delimiter. That's why it's common practice to include |
1847 | alternatives in parentheses: to minimize confusion about where they | |
a3cb178b GS |
1848 | start and end. |
1849 | ||
5a964f20 | 1850 | Alternatives are tried from left to right, so the first |
a3cb178b GS |
1851 | alternative found for which the entire expression matches, is the one that |
1852 | is chosen. This means that alternatives are not necessarily greedy. For | |
628afcb5 | 1853 | example: when matching C<foo|foot> against "barefoot", only the "foo" |
a3cb178b GS |
1854 | part will match, as that is the first alternative tried, and it successfully |
1855 | matches the target string. (This might not seem important, but it is | |
1856 | important when you are capturing matched text using parentheses.) | |
1857 | ||
5a964f20 | 1858 | Also remember that "|" is interpreted as a literal within square brackets, |
a3cb178b | 1859 | so if you write C<[fee|fie|foe]> you're really only matching C<[feio|]>. |
a0d0e21e | 1860 | |
14218588 GS |
1861 | Within a pattern, you may designate subpatterns for later reference |
1862 | by enclosing them in parentheses, and you may refer back to the | |
1863 | I<n>th subpattern later in the pattern using the metacharacter | |
1864 | \I<n>. Subpatterns are numbered based on the left to right order | |
1865 | of their opening parenthesis. A backreference matches whatever | |
1866 | actually matched the subpattern in the string being examined, not | |
1867 | the rules for that subpattern. Therefore, C<(0|0x)\d*\s\1\d*> will | |
1868 | match "0x1234 0x4321", but not "0x1234 01234", because subpattern | |
1869 | 1 matched "0x", even though the rule C<0|0x> could potentially match | |
1870 | the leading 0 in the second number. | |
cb1a09d0 | 1871 | |
0d017f4d | 1872 | =head2 Warning on \1 Instead of $1 |
cb1a09d0 | 1873 | |
5a964f20 | 1874 | Some people get too used to writing things like: |
cb1a09d0 AD |
1875 | |
1876 | $pattern =~ s/(\W)/\\\1/g; | |
1877 | ||
1878 | This is grandfathered for the RHS of a substitute to avoid shocking the | |
1879 | B<sed> addicts, but it's a dirty habit to get into. That's because in | |
d1be9408 | 1880 | PerlThink, the righthand side of an C<s///> is a double-quoted string. C<\1> in |
cb1a09d0 AD |
1881 | the usual double-quoted string means a control-A. The customary Unix |
1882 | meaning of C<\1> is kludged in for C<s///>. However, if you get into the habit | |
1883 | of doing that, you get yourself into trouble if you then add an C</e> | |
1884 | modifier. | |
1885 | ||
5a964f20 | 1886 | s/(\d+)/ \1 + 1 /eg; # causes warning under -w |
cb1a09d0 AD |
1887 | |
1888 | Or if you try to do | |
1889 | ||
1890 | s/(\d+)/\1000/; | |
1891 | ||
1892 | You can't disambiguate that by saying C<\{1}000>, whereas you can fix it with | |
14218588 | 1893 | C<${1}000>. The operation of interpolation should not be confused |
cb1a09d0 AD |
1894 | with the operation of matching a backreference. Certainly they mean two |
1895 | different things on the I<left> side of the C<s///>. | |
9fa51da4 | 1896 | |
0d017f4d | 1897 | =head2 Repeated Patterns Matching a Zero-length Substring |
c84d73f1 | 1898 | |
19799a22 | 1899 | B<WARNING>: Difficult material (and prose) ahead. This section needs a rewrite. |
c84d73f1 IZ |
1900 | |
1901 | Regular expressions provide a terse and powerful programming language. As | |
1902 | with most other power tools, power comes together with the ability | |
1903 | to wreak havoc. | |
1904 | ||
1905 | A common abuse of this power stems from the ability to make infinite | |
628afcb5 | 1906 | loops using regular expressions, with something as innocuous as: |
c84d73f1 IZ |
1907 | |
1908 | 'foo' =~ m{ ( o? )* }x; | |
1909 | ||
0d017f4d | 1910 | The C<o?> matches at the beginning of C<'foo'>, and since the position |
c84d73f1 | 1911 | in the string is not moved by the match, C<o?> would match again and again |
527e91da | 1912 | because of the C<*> quantifier. Another common way to create a similar cycle |
c84d73f1 IZ |
1913 | is with the looping modifier C<//g>: |
1914 | ||
1915 | @matches = ( 'foo' =~ m{ o? }xg ); | |
1916 | ||
1917 | or | |
1918 | ||
1919 | print "match: <$&>\n" while 'foo' =~ m{ o? }xg; | |
1920 | ||
1921 | or the loop implied by split(). | |
1922 | ||
1923 | However, long experience has shown that many programming tasks may | |
14218588 GS |
1924 | be significantly simplified by using repeated subexpressions that |
1925 | may match zero-length substrings. Here's a simple example being: | |
c84d73f1 IZ |
1926 | |
1927 | @chars = split //, $string; # // is not magic in split | |
1928 | ($whitewashed = $string) =~ s/()/ /g; # parens avoid magic s// / | |
1929 | ||
9da458fc | 1930 | Thus Perl allows such constructs, by I<forcefully breaking |
c84d73f1 | 1931 | the infinite loop>. The rules for this are different for lower-level |
527e91da | 1932 | loops given by the greedy quantifiers C<*+{}>, and for higher-level |
c84d73f1 IZ |
1933 | ones like the C</g> modifier or split() operator. |
1934 | ||
19799a22 GS |
1935 | The lower-level loops are I<interrupted> (that is, the loop is |
1936 | broken) when Perl detects that a repeated expression matched a | |
1937 | zero-length substring. Thus | |
c84d73f1 IZ |
1938 | |
1939 | m{ (?: NON_ZERO_LENGTH | ZERO_LENGTH )* }x; | |
1940 | ||
5d458dd8 | 1941 | is made equivalent to |
c84d73f1 | 1942 | |
5d458dd8 YO |
1943 | m{ (?: NON_ZERO_LENGTH )* |
1944 | | | |
1945 | (?: ZERO_LENGTH )? | |
c84d73f1 IZ |
1946 | }x; |
1947 | ||
1948 | The higher level-loops preserve an additional state between iterations: | |
5d458dd8 | 1949 | whether the last match was zero-length. To break the loop, the following |
c84d73f1 | 1950 | match after a zero-length match is prohibited to have a length of zero. |
5d458dd8 | 1951 | This prohibition interacts with backtracking (see L<"Backtracking">), |
c84d73f1 IZ |
1952 | and so the I<second best> match is chosen if the I<best> match is of |
1953 | zero length. | |
1954 | ||
19799a22 | 1955 | For example: |
c84d73f1 IZ |
1956 | |
1957 | $_ = 'bar'; | |
1958 | s/\w??/<$&>/g; | |
1959 | ||
20fb949f | 1960 | results in C<< <><b><><a><><r><> >>. At each position of the string the best |
5d458dd8 | 1961 | match given by non-greedy C<??> is the zero-length match, and the I<second |
c84d73f1 IZ |
1962 | best> match is what is matched by C<\w>. Thus zero-length matches |
1963 | alternate with one-character-long matches. | |
1964 | ||
5d458dd8 | 1965 | Similarly, for repeated C<m/()/g> the second-best match is the match at the |
c84d73f1 IZ |
1966 | position one notch further in the string. |
1967 | ||
19799a22 | 1968 | The additional state of being I<matched with zero-length> is associated with |
c84d73f1 | 1969 | the matched string, and is reset by each assignment to pos(). |
9da458fc IZ |
1970 | Zero-length matches at the end of the previous match are ignored |
1971 | during C<split>. | |
c84d73f1 | 1972 | |
0d017f4d | 1973 | =head2 Combining RE Pieces |
35a734be IZ |
1974 | |
1975 | Each of the elementary pieces of regular expressions which were described | |
1976 | before (such as C<ab> or C<\Z>) could match at most one substring | |
1977 | at the given position of the input string. However, in a typical regular | |
1978 | expression these elementary pieces are combined into more complicated | |
1979 | patterns using combining operators C<ST>, C<S|T>, C<S*> etc | |
1980 | (in these examples C<S> and C<T> are regular subexpressions). | |
1981 | ||
1982 | Such combinations can include alternatives, leading to a problem of choice: | |
1983 | if we match a regular expression C<a|ab> against C<"abc">, will it match | |
1984 | substring C<"a"> or C<"ab">? One way to describe which substring is | |
1985 | actually matched is the concept of backtracking (see L<"Backtracking">). | |
1986 | However, this description is too low-level and makes you think | |
1987 | in terms of a particular implementation. | |
1988 | ||
1989 | Another description starts with notions of "better"/"worse". All the | |
1990 | substrings which may be matched by the given regular expression can be | |
1991 | sorted from the "best" match to the "worst" match, and it is the "best" | |
1992 | match which is chosen. This substitutes the question of "what is chosen?" | |
1993 | by the question of "which matches are better, and which are worse?". | |
1994 | ||
1995 | Again, for elementary pieces there is no such question, since at most | |
1996 | one match at a given position is possible. This section describes the | |
1997 | notion of better/worse for combining operators. In the description | |
1998 | below C<S> and C<T> are regular subexpressions. | |
1999 | ||
13a2d996 | 2000 | =over 4 |
35a734be IZ |
2001 | |
2002 | =item C<ST> | |
2003 | ||
2004 | Consider two possible matches, C<AB> and C<A'B'>, C<A> and C<A'> are | |
2005 | substrings which can be matched by C<S>, C<B> and C<B'> are substrings | |
5d458dd8 | 2006 | which can be matched by C<T>. |
35a734be IZ |
2007 | |
2008 | If C<A> is better match for C<S> than C<A'>, C<AB> is a better | |
2009 | match than C<A'B'>. | |
2010 | ||
2011 | If C<A> and C<A'> coincide: C<AB> is a better match than C<AB'> if | |
2012 | C<B> is better match for C<T> than C<B'>. | |
2013 | ||
2014 | =item C<S|T> | |
2015 | ||
2016 | When C<S> can match, it is a better match than when only C<T> can match. | |
2017 | ||
2018 | Ordering of two matches for C<S> is the same as for C<S>. Similar for | |
2019 | two matches for C<T>. | |
2020 | ||
2021 | =item C<S{REPEAT_COUNT}> | |
2022 | ||
2023 | Matches as C<SSS...S> (repeated as many times as necessary). | |
2024 | ||
2025 | =item C<S{min,max}> | |
2026 | ||
2027 | Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>. | |
2028 | ||
2029 | =item C<S{min,max}?> | |
2030 | ||
2031 | Matches as C<S{min}|S{min+1}|...|S{max-1}|S{max}>. | |
2032 | ||
2033 | =item C<S?>, C<S*>, C<S+> | |
2034 | ||
2035 | Same as C<S{0,1}>, C<S{0,BIG_NUMBER}>, C<S{1,BIG_NUMBER}> respectively. | |
2036 | ||
2037 | =item C<S??>, C<S*?>, C<S+?> | |
2038 | ||
2039 | Same as C<S{0,1}?>, C<S{0,BIG_NUMBER}?>, C<S{1,BIG_NUMBER}?> respectively. | |
2040 | ||
c47ff5f1 | 2041 | =item C<< (?>S) >> |
35a734be IZ |
2042 | |
2043 | Matches the best match for C<S> and only that. | |
2044 | ||
2045 | =item C<(?=S)>, C<(?<=S)> | |
2046 | ||
2047 | Only the best match for C<S> is considered. (This is important only if | |
2048 | C<S> has capturing parentheses, and backreferences are used somewhere | |
2049 | else in the whole regular expression.) | |
2050 | ||
2051 | =item C<(?!S)>, C<(?<!S)> | |
2052 | ||
2053 | For this grouping operator there is no need to describe the ordering, since | |
2054 | only whether or not C<S> can match is important. | |
2055 | ||
6bda09f9 | 2056 | =item C<(??{ EXPR })>, C<(?PARNO)> |
35a734be IZ |
2057 | |
2058 | The ordering is the same as for the regular expression which is | |
6bda09f9 | 2059 | the result of EXPR, or the pattern contained by capture buffer PARNO. |
35a734be IZ |
2060 | |
2061 | =item C<(?(condition)yes-pattern|no-pattern)> | |
2062 | ||
2063 | Recall that which of C<yes-pattern> or C<no-pattern> actually matches is | |
2064 | already determined. The ordering of the matches is the same as for the | |
2065 | chosen subexpression. | |
2066 | ||
2067 | =back | |
2068 | ||
2069 | The above recipes describe the ordering of matches I<at a given position>. | |
2070 | One more rule is needed to understand how a match is determined for the | |
2071 | whole regular expression: a match at an earlier position is always better | |
2072 | than a match at a later position. | |
2073 | ||
0d017f4d | 2074 | =head2 Creating Custom RE Engines |
c84d73f1 IZ |
2075 | |
2076 | Overloaded constants (see L<overload>) provide a simple way to extend | |
2077 | the functionality of the RE engine. | |
2078 | ||
2079 | Suppose that we want to enable a new RE escape-sequence C<\Y|> which | |
0d017f4d | 2080 | matches at a boundary between whitespace characters and non-whitespace |
c84d73f1 IZ |
2081 | characters. Note that C<(?=\S)(?<!\S)|(?!\S)(?<=\S)> matches exactly |
2082 | at these positions, so we want to have each C<\Y|> in the place of the | |
2083 | more complicated version. We can create a module C<customre> to do | |
2084 | this: | |
2085 | ||
2086 | package customre; | |
2087 | use overload; | |
2088 | ||
2089 | sub import { | |
2090 | shift; | |
2091 | die "No argument to customre::import allowed" if @_; | |
2092 | overload::constant 'qr' => \&convert; | |
2093 | } | |
2094 | ||
2095 | sub invalid { die "/$_[0]/: invalid escape '\\$_[1]'"} | |
2096 | ||
580a9fe1 RGS |
2097 | # We must also take care of not escaping the legitimate \\Y| |
2098 | # sequence, hence the presence of '\\' in the conversion rules. | |
5d458dd8 | 2099 | my %rules = ( '\\' => '\\\\', |
c84d73f1 IZ |
2100 | 'Y|' => qr/(?=\S)(?<!\S)|(?!\S)(?<=\S)/ ); |
2101 | sub convert { | |
2102 | my $re = shift; | |
5d458dd8 | 2103 | $re =~ s{ |
c84d73f1 IZ |
2104 | \\ ( \\ | Y . ) |
2105 | } | |
5d458dd8 | 2106 | { $rules{$1} or invalid($re,$1) }sgex; |
c84d73f1 IZ |
2107 | return $re; |
2108 | } | |
2109 | ||
2110 | Now C<use customre> enables the new escape in constant regular | |
2111 | expressions, i.e., those without any runtime variable interpolations. | |
2112 | As documented in L<overload>, this conversion will work only over | |
2113 | literal parts of regular expressions. For C<\Y|$re\Y|> the variable | |
2114 | part of this regular expression needs to be converted explicitly | |
2115 | (but only if the special meaning of C<\Y|> should be enabled inside $re): | |
2116 | ||
2117 | use customre; | |
2118 | $re = <>; | |
2119 | chomp $re; | |
2120 | $re = customre::convert $re; | |
2121 | /\Y|$re\Y|/; | |
2122 | ||
1f1031fe YO |
2123 | =head1 PCRE/Python Support |
2124 | ||
99d59c4d | 2125 | As of Perl 5.10.0, Perl supports several Python/PCRE specific extensions |
1f1031fe | 2126 | to the regex syntax. While Perl programmers are encouraged to use the |
99d59c4d | 2127 | Perl specific syntax, the following are also accepted: |
1f1031fe YO |
2128 | |
2129 | =over 4 | |
2130 | ||
ae5648b3 | 2131 | =item C<< (?PE<lt>NAMEE<gt>pattern) >> |
1f1031fe YO |
2132 | |
2133 | Define a named capture buffer. Equivalent to C<< (?<NAME>pattern) >>. | |
2134 | ||
2135 | =item C<< (?P=NAME) >> | |
2136 | ||
2137 | Backreference to a named capture buffer. Equivalent to C<< \g{NAME} >>. | |
2138 | ||
2139 | =item C<< (?P>NAME) >> | |
2140 | ||
2141 | Subroutine call to a named capture buffer. Equivalent to C<< (?&NAME) >>. | |
2142 | ||
ee9b8eae | 2143 | =back |
1f1031fe | 2144 | |
19799a22 GS |
2145 | =head1 BUGS |
2146 | ||
9da458fc IZ |
2147 | This document varies from difficult to understand to completely |
2148 | and utterly opaque. The wandering prose riddled with jargon is | |
2149 | hard to fathom in several places. | |
2150 | ||
2151 | This document needs a rewrite that separates the tutorial content | |
2152 | from the reference content. | |
19799a22 GS |
2153 | |
2154 | =head1 SEE ALSO | |
9fa51da4 | 2155 | |
91e0c79e MJD |
2156 | L<perlrequick>. |
2157 | ||
2158 | L<perlretut>. | |
2159 | ||
9b599b2a GS |
2160 | L<perlop/"Regexp Quote-Like Operators">. |
2161 | ||
1e66bd83 PP |
2162 | L<perlop/"Gory details of parsing quoted constructs">. |
2163 | ||
14218588 GS |
2164 | L<perlfaq6>. |
2165 | ||
9b599b2a GS |
2166 | L<perlfunc/pos>. |
2167 | ||
2168 | L<perllocale>. | |
2169 | ||
fb55449c JH |
2170 | L<perlebcdic>. |
2171 | ||
14218588 GS |
2172 | I<Mastering Regular Expressions> by Jeffrey Friedl, published |
2173 | by O'Reilly and Associates. |