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 | |
1e4aa4a5 AP |
34 | the start or end of line only at the left and right ends of the string to |
35 | matching them 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 | |
34d67d80 | 44 | Used together, as C</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 | ||
5027a30b KW |
54 | If locale matching rules are in effect, the case map is taken from the |
55 | current | |
17580e7a | 56 | locale for code points less than 255, and from Unicode rules for larger |
ed7efc79 KW |
57 | code points. However, matches that would cross the Unicode |
58 | rules/non-Unicode rules boundary (ords 255/256) will not succeed. See | |
59 | L<perllocale>. | |
60 | ||
61 | There are a number of Unicode characters that match multiple characters | |
62 | under C</i>. For example, C<LATIN SMALL LIGATURE FI> | |
63 | should match the sequence C<fi>. Perl is not | |
64 | currently able to do this when the multiple characters are in the pattern and | |
65 | are split between groupings, or when one or more are quantified. Thus | |
66 | ||
67 | "\N{LATIN SMALL LIGATURE FI}" =~ /fi/i; # Matches | |
68 | "\N{LATIN SMALL LIGATURE FI}" =~ /[fi][fi]/i; # Doesn't match! | |
69 | "\N{LATIN SMALL LIGATURE FI}" =~ /fi*/i; # Doesn't match! | |
70 | ||
71 | # The below doesn't match, and it isn't clear what $1 and $2 would | |
72 | # be even if it did!! | |
73 | "\N{LATIN SMALL LIGATURE FI}" =~ /(f)(i)/i; # Doesn't match! | |
74 | ||
9d53c457 KW |
75 | Perl doesn't match multiple characters in a bracketed |
76 | character class unless the character that maps to them is explicitly | |
77 | mentioned, and it doesn't match them at all if the character class is | |
78 | inverted, which otherwise could be highly confusing. See | |
79 | L<perlrecharclass/Bracketed Character Classes>, and | |
1f59b283 KW |
80 | L<perlrecharclass/Negation>. |
81 | ||
54310121 | 82 | =item x |
d74e8afc | 83 | X</x> |
55497cff | 84 | |
85 | Extend your pattern's legibility by permitting whitespace and comments. | |
ed7efc79 | 86 | Details in L</"/x"> |
55497cff | 87 | |
87e95b7f YO |
88 | =item p |
89 | X</p> X<regex, preserve> X<regexp, preserve> | |
90 | ||
632a1772 | 91 | Preserve the string matched such that ${^PREMATCH}, ${^MATCH}, and |
87e95b7f YO |
92 | ${^POSTMATCH} are available for use after matching. |
93 | ||
13b0f67d DM |
94 | In Perl 5.20 and higher this is ignored. Due to a new copy-on-write |
95 | mechanism, ${^PREMATCH}, ${^MATCH}, and ${^POSTMATCH} will be available | |
96 | after the match regardless of the modifier. | |
97 | ||
e2e6bec7 DN |
98 | =item g and c |
99 | X</g> X</c> | |
100 | ||
101 | Global matching, and keep the Current position after failed matching. | |
102 | Unlike i, m, s and x, these two flags affect the way the regex is used | |
103 | rather than the regex itself. See | |
104 | L<perlretut/"Using regular expressions in Perl"> for further explanation | |
105 | of the g and c modifiers. | |
106 | ||
b6fa137b FC |
107 | =item a, d, l and u |
108 | X</a> X</d> X</l> X</u> | |
109 | ||
516074bb KW |
110 | These modifiers, all new in 5.14, affect which character-set semantics |
111 | (Unicode, etc.) are used, as described below in | |
ed7efc79 | 112 | L</Character set modifiers>. |
b6fa137b | 113 | |
55497cff | 114 | =back |
a0d0e21e | 115 | |
516074bb KW |
116 | Regular expression modifiers are usually written in documentation |
117 | as e.g., "the C</x> modifier", even though the delimiter | |
b6fa137b | 118 | in question might not really be a slash. The modifiers C</imsxadlup> |
ab7bb42d | 119 | may also be embedded within the regular expression itself using |
ed7efc79 | 120 | the C<(?...)> construct, see L</Extended Patterns> below. |
b6fa137b | 121 | |
ed7efc79 KW |
122 | =head3 /x |
123 | ||
b6fa137b | 124 | C</x> tells |
7b059540 | 125 | the regular expression parser to ignore most whitespace that is neither |
55497cff | 126 | backslashed nor within a character class. You can use this to break up |
4633a7c4 | 127 | your regular expression into (slightly) more readable parts. The C<#> |
54310121 | 128 | character is also treated as a metacharacter introducing a comment, |
55497cff | 129 | just as in ordinary Perl code. This also means that if you want real |
14218588 | 130 | whitespace or C<#> characters in the pattern (outside a character |
f9a3ff1a | 131 | class, where they are unaffected by C</x>), then you'll either have to |
7b059540 KW |
132 | escape them (using backslashes or C<\Q...\E>) or encode them using octal, |
133 | hex, or C<\N{}> escapes. Taken together, these features go a long way towards | |
8933a740 RGS |
134 | making Perl's regular expressions more readable. Note that you have to |
135 | be careful not to include the pattern delimiter in the comment--perl has | |
136 | no way of knowing you did not intend to close the pattern early. See | |
137 | the C-comment deletion code in L<perlop>. Also note that anything inside | |
7651b971 | 138 | a C<\Q...\E> stays unaffected by C</x>. And note that C</x> doesn't affect |
0b928c2f | 139 | space interpretation within a single multi-character construct. For |
7651b971 | 140 | example in C<\x{...}>, regardless of the C</x> modifier, there can be no |
9bb1f947 | 141 | spaces. Same for a L<quantifier|/Quantifiers> such as C<{3}> or |
000947ad KW |
142 | C<{5,}>. Similarly, C<(?:...)> can't have a space between the C<(>, |
143 | C<?>, and C<:>. Within any delimiters for such a | |
f9e949fd KW |
144 | construct, allowed spaces are not affected by C</x>, and depend on the |
145 | construct. For example, C<\x{...}> can't have spaces because hexadecimal | |
146 | numbers don't have spaces in them. But, Unicode properties can have spaces, so | |
0b928c2f | 147 | in C<\p{...}> there can be spaces that follow the Unicode rules, for which see |
9bb1f947 | 148 | L<perluniprops/Properties accessible through \p{} and \P{}>. |
d74e8afc | 149 | X</x> |
a0d0e21e | 150 | |
ed7efc79 KW |
151 | =head3 Character set modifiers |
152 | ||
153 | C</d>, C</u>, C</a>, and C</l>, available starting in 5.14, are called | |
154 | the character set modifiers; they affect the character set semantics | |
155 | used for the regular expression. | |
156 | ||
808432af KW |
157 | The C</d>, C</u>, and C</l> modifiers are not likely to be of much use |
158 | to you, and so you need not worry about them very much. They exist for | |
159 | Perl's internal use, so that complex regular expression data structures | |
160 | can be automatically serialized and later exactly reconstituted, | |
161 | including all their nuances. But, since Perl can't keep a secret, and | |
162 | there may be rare instances where they are useful, they are documented | |
163 | here. | |
ed7efc79 | 164 | |
808432af KW |
165 | The C</a> modifier, on the other hand, may be useful. Its purpose is to |
166 | allow code that is to work mostly on ASCII data to not have to concern | |
167 | itself with Unicode. | |
ca9560b2 | 168 | |
808432af KW |
169 | Briefly, C</l> sets the character set to that of whatever B<L>ocale is in |
170 | effect at the time of the execution of the pattern match. | |
ca9560b2 | 171 | |
808432af KW |
172 | C</u> sets the character set to B<U>nicode. |
173 | ||
174 | C</a> also sets the character set to Unicode, BUT adds several | |
175 | restrictions for B<A>SCII-safe matching. | |
176 | ||
177 | C</d> is the old, problematic, pre-5.14 B<D>efault character set | |
178 | behavior. Its only use is to force that old behavior. | |
179 | ||
180 | At any given time, exactly one of these modifiers is in effect. Their | |
181 | existence allows Perl to keep the originally compiled behavior of a | |
182 | regular expression, regardless of what rules are in effect when it is | |
183 | actually executed. And if it is interpolated into a larger regex, the | |
184 | original's rules continue to apply to it, and only it. | |
185 | ||
186 | The C</l> and C</u> modifiers are automatically selected for | |
187 | regular expressions compiled within the scope of various pragmas, | |
188 | and we recommend that in general, you use those pragmas instead of | |
189 | specifying these modifiers explicitly. For one thing, the modifiers | |
190 | affect only pattern matching, and do not extend to even any replacement | |
191 | done, whereas using the pragmas give consistent results for all | |
192 | appropriate operations within their scopes. For example, | |
193 | ||
194 | s/foo/\Ubar/il | |
195 | ||
196 | will match "foo" using the locale's rules for case-insensitive matching, | |
197 | but the C</l> does not affect how the C<\U> operates. Most likely you | |
198 | want both of them to use locale rules. To do this, instead compile the | |
199 | regular expression within the scope of C<use locale>. This both | |
200 | implicitly adds the C</l> and applies locale rules to the C<\U>. The | |
201 | lesson is to C<use locale> and not C</l> explicitly. | |
202 | ||
203 | Similarly, it would be better to use C<use feature 'unicode_strings'> | |
204 | instead of, | |
205 | ||
206 | s/foo/\Lbar/iu | |
207 | ||
208 | to get Unicode rules, as the C<\L> in the former (but not necessarily | |
209 | the latter) would also use Unicode rules. | |
210 | ||
211 | More detail on each of the modifiers follows. Most likely you don't | |
212 | need to know this detail for C</l>, C</u>, and C</d>, and can skip ahead | |
213 | to L<E<sol>a|/E<sol>a (and E<sol>aa)>. | |
ca9560b2 | 214 | |
ed7efc79 KW |
215 | =head4 /l |
216 | ||
217 | means to use the current locale's rules (see L<perllocale>) when pattern | |
218 | matching. For example, C<\w> will match the "word" characters of that | |
219 | locale, and C<"/i"> case-insensitive matching will match according to | |
220 | the locale's case folding rules. The locale used will be the one in | |
221 | effect at the time of execution of the pattern match. This may not be | |
222 | the same as the compilation-time locale, and can differ from one match | |
223 | to another if there is an intervening call of the | |
b6fa137b | 224 | L<setlocale() function|perllocale/The setlocale function>. |
ed7efc79 KW |
225 | |
226 | Perl only supports single-byte locales. This means that code points | |
227 | above 255 are treated as Unicode no matter what locale is in effect. | |
228 | Under Unicode rules, there are a few case-insensitive matches that cross | |
229 | the 255/256 boundary. These are disallowed under C</l>. For example, | |
516074bb KW |
230 | 0xFF (on ASCII platforms) does not caselessly match the character at |
231 | 0x178, C<LATIN CAPITAL LETTER Y WITH DIAERESIS>, because 0xFF may not be | |
232 | C<LATIN SMALL LETTER Y WITH DIAERESIS> in the current locale, and Perl | |
233 | has no way of knowing if that character even exists in the locale, much | |
234 | less what code point it is. | |
ed7efc79 KW |
235 | |
236 | This modifier may be specified to be the default by C<use locale>, but | |
237 | see L</Which character set modifier is in effect?>. | |
b6fa137b FC |
238 | X</l> |
239 | ||
ed7efc79 KW |
240 | =head4 /u |
241 | ||
242 | means to use Unicode rules when pattern matching. On ASCII platforms, | |
243 | this means that the code points between 128 and 255 take on their | |
808432af KW |
244 | Latin-1 (ISO-8859-1) meanings (which are the same as Unicode's). |
245 | (Otherwise Perl considers their meanings to be undefined.) Thus, | |
246 | under this modifier, the ASCII platform effectively becomes a Unicode | |
247 | platform; and hence, for example, C<\w> will match any of the more than | |
248 | 100_000 word characters in Unicode. | |
ed7efc79 KW |
249 | |
250 | Unlike most locales, which are specific to a language and country pair, | |
516074bb KW |
251 | Unicode classifies all the characters that are letters I<somewhere> in |
252 | the world as | |
ed7efc79 KW |
253 | C<\w>. For example, your locale might not think that C<LATIN SMALL |
254 | LETTER ETH> is a letter (unless you happen to speak Icelandic), but | |
255 | Unicode does. Similarly, all the characters that are decimal digits | |
256 | somewhere in the world will match C<\d>; this is hundreds, not 10, | |
257 | possible matches. And some of those digits look like some of the 10 | |
258 | ASCII digits, but mean a different number, so a human could easily think | |
259 | a number is a different quantity than it really is. For example, | |
260 | C<BENGALI DIGIT FOUR> (U+09EA) looks very much like an | |
261 | C<ASCII DIGIT EIGHT> (U+0038). And, C<\d+>, may match strings of digits | |
262 | that are a mixture from different writing systems, creating a security | |
67592e11 | 263 | issue. L<Unicode::UCD/num()> can be used to sort |
516074bb KW |
264 | this out. Or the C</a> modifier can be used to force C<\d> to match |
265 | just the ASCII 0 through 9. | |
ed7efc79 | 266 | |
516074bb KW |
267 | Also, under this modifier, case-insensitive matching works on the full |
268 | set of Unicode | |
ed7efc79 KW |
269 | characters. The C<KELVIN SIGN>, for example matches the letters "k" and |
270 | "K"; and C<LATIN SMALL LIGATURE FF> matches the sequence "ff", which, | |
271 | if you're not prepared, might make it look like a hexadecimal constant, | |
272 | presenting another potential security issue. See | |
273 | L<http://unicode.org/reports/tr36> for a detailed discussion of Unicode | |
274 | security issues. | |
275 | ||
ed7efc79 | 276 | This modifier may be specified to be the default by C<use feature |
66cbab2c KW |
277 | 'unicode_strings>, C<use locale ':not_characters'>, or |
278 | C<L<use 5.012|perlfunc/use VERSION>> (or higher), | |
808432af | 279 | but see L</Which character set modifier is in effect?>. |
b6fa137b FC |
280 | X</u> |
281 | ||
ed7efc79 KW |
282 | =head4 /d |
283 | ||
284 | This modifier means to use the "Default" native rules of the platform | |
285 | except when there is cause to use Unicode rules instead, as follows: | |
286 | ||
287 | =over 4 | |
288 | ||
289 | =item 1 | |
290 | ||
291 | the target string is encoded in UTF-8; or | |
292 | ||
293 | =item 2 | |
294 | ||
295 | the pattern is encoded in UTF-8; or | |
296 | ||
297 | =item 3 | |
298 | ||
299 | the pattern explicitly mentions a code point that is above 255 (say by | |
300 | C<\x{100}>); or | |
301 | ||
302 | =item 4 | |
b6fa137b | 303 | |
ed7efc79 KW |
304 | the pattern uses a Unicode name (C<\N{...}>); or |
305 | ||
306 | =item 5 | |
307 | ||
9d1a5160 KW |
308 | the pattern uses a Unicode property (C<\p{...}>); or |
309 | ||
310 | =item 6 | |
311 | ||
312 | the pattern uses L</C<(?[ ])>> | |
ed7efc79 KW |
313 | |
314 | =back | |
315 | ||
316 | Another mnemonic for this modifier is "Depends", as the rules actually | |
317 | used depend on various things, and as a result you can get unexpected | |
808432af KW |
318 | results. See L<perlunicode/The "Unicode Bug">. The Unicode Bug has |
319 | become rather infamous, leading to yet another (printable) name for this | |
320 | modifier, "Dodgy". | |
ed7efc79 | 321 | |
4b9734bf KW |
322 | Unless the pattern or string are encoded in UTF-8, only ASCII characters |
323 | can match positively. | |
ed7efc79 KW |
324 | |
325 | Here are some examples of how that works on an ASCII platform: | |
326 | ||
327 | $str = "\xDF"; # $str is not in UTF-8 format. | |
328 | $str =~ /^\w/; # No match, as $str isn't in UTF-8 format. | |
329 | $str .= "\x{0e0b}"; # Now $str is in UTF-8 format. | |
330 | $str =~ /^\w/; # Match! $str is now in UTF-8 format. | |
331 | chop $str; | |
332 | $str =~ /^\w/; # Still a match! $str remains in UTF-8 format. | |
333 | ||
808432af KW |
334 | This modifier is automatically selected by default when none of the |
335 | others are, so yet another name for it is "Default". | |
336 | ||
337 | Because of the unexpected behaviors associated with this modifier, you | |
338 | probably should only use it to maintain weird backward compatibilities. | |
339 | ||
340 | =head4 /a (and /aa) | |
341 | ||
342 | This modifier stands for ASCII-restrict (or ASCII-safe). This modifier, | |
343 | unlike the others, may be doubled-up to increase its effect. | |
344 | ||
345 | When it appears singly, it causes the sequences C<\d>, C<\s>, C<\w>, and | |
346 | the Posix character classes to match only in the ASCII range. They thus | |
347 | revert to their pre-5.6, pre-Unicode meanings. Under C</a>, C<\d> | |
348 | always means precisely the digits C<"0"> to C<"9">; C<\s> means the five | |
d28d8023 KW |
349 | characters C<[ \f\n\r\t]>, and starting in Perl v5.18, experimentally, |
350 | the vertical tab; C<\w> means the 63 characters | |
808432af KW |
351 | C<[A-Za-z0-9_]>; and likewise, all the Posix classes such as |
352 | C<[[:print:]]> match only the appropriate ASCII-range characters. | |
353 | ||
354 | This modifier is useful for people who only incidentally use Unicode, | |
355 | and who do not wish to be burdened with its complexities and security | |
356 | concerns. | |
357 | ||
358 | With C</a>, one can write C<\d> with confidence that it will only match | |
359 | ASCII characters, and should the need arise to match beyond ASCII, you | |
360 | can instead use C<\p{Digit}> (or C<\p{Word}> for C<\w>). There are | |
361 | similar C<\p{...}> constructs that can match beyond ASCII both white | |
362 | space (see L<perlrecharclass/Whitespace>), and Posix classes (see | |
363 | L<perlrecharclass/POSIX Character Classes>). Thus, this modifier | |
364 | doesn't mean you can't use Unicode, it means that to get Unicode | |
365 | matching you must explicitly use a construct (C<\p{}>, C<\P{}>) that | |
366 | signals Unicode. | |
367 | ||
368 | As you would expect, this modifier causes, for example, C<\D> to mean | |
369 | the same thing as C<[^0-9]>; in fact, all non-ASCII characters match | |
370 | C<\D>, C<\S>, and C<\W>. C<\b> still means to match at the boundary | |
371 | between C<\w> and C<\W>, using the C</a> definitions of them (similarly | |
372 | for C<\B>). | |
373 | ||
374 | Otherwise, C</a> behaves like the C</u> modifier, in that | |
375 | case-insensitive matching uses Unicode semantics; for example, "k" will | |
376 | match the Unicode C<\N{KELVIN SIGN}> under C</i> matching, and code | |
377 | points in the Latin1 range, above ASCII will have Unicode rules when it | |
378 | comes to case-insensitive matching. | |
379 | ||
380 | To forbid ASCII/non-ASCII matches (like "k" with C<\N{KELVIN SIGN}>), | |
381 | specify the "a" twice, for example C</aai> or C</aia>. (The first | |
382 | occurrence of "a" restricts the C<\d>, etc., and the second occurrence | |
383 | adds the C</i> restrictions.) But, note that code points outside the | |
384 | ASCII range will use Unicode rules for C</i> matching, so the modifier | |
385 | doesn't really restrict things to just ASCII; it just forbids the | |
386 | intermixing of ASCII and non-ASCII. | |
387 | ||
388 | To summarize, this modifier provides protection for applications that | |
389 | don't wish to be exposed to all of Unicode. Specifying it twice | |
390 | gives added protection. | |
391 | ||
392 | This modifier may be specified to be the default by C<use re '/a'> | |
393 | or C<use re '/aa'>. If you do so, you may actually have occasion to use | |
31dc26d6 | 394 | the C</u> modifier explicitly if there are a few regular expressions |
808432af KW |
395 | where you do want full Unicode rules (but even here, it's best if |
396 | everything were under feature C<"unicode_strings">, along with the | |
397 | C<use re '/aa'>). Also see L</Which character set modifier is in | |
398 | effect?>. | |
399 | X</a> | |
400 | X</aa> | |
401 | ||
ed7efc79 KW |
402 | =head4 Which character set modifier is in effect? |
403 | ||
404 | Which of these modifiers is in effect at any given point in a regular | |
808432af KW |
405 | expression depends on a fairly complex set of interactions. These have |
406 | been designed so that in general you don't have to worry about it, but | |
407 | this section gives the gory details. As | |
ed7efc79 KW |
408 | explained below in L</Extended Patterns> it is possible to explicitly |
409 | specify modifiers that apply only to portions of a regular expression. | |
410 | The innermost always has priority over any outer ones, and one applying | |
6368643f KW |
411 | to the whole expression has priority over any of the default settings that are |
412 | described in the remainder of this section. | |
ed7efc79 | 413 | |
916cec3f | 414 | The C<L<use re 'E<sol>foo'|re/"'/flags' mode">> pragma can be used to set |
ed7efc79 KW |
415 | default modifiers (including these) for regular expressions compiled |
416 | within its scope. This pragma has precedence over the other pragmas | |
516074bb | 417 | listed below that also change the defaults. |
ed7efc79 KW |
418 | |
419 | Otherwise, C<L<use locale|perllocale>> sets the default modifier to C</l>; | |
66cbab2c | 420 | and C<L<use feature 'unicode_strings|feature>>, or |
ed7efc79 KW |
421 | C<L<use 5.012|perlfunc/use VERSION>> (or higher) set the default to |
422 | C</u> when not in the same scope as either C<L<use locale|perllocale>> | |
66cbab2c KW |
423 | or C<L<use bytes|bytes>>. |
424 | (C<L<use locale ':not_characters'|perllocale/Unicode and UTF-8>> also | |
425 | sets the default to C</u>, overriding any plain C<use locale>.) | |
426 | Unlike the mechanisms mentioned above, these | |
6368643f KW |
427 | affect operations besides regular expressions pattern matching, and so |
428 | give more consistent results with other operators, including using | |
429 | C<\U>, C<\l>, etc. in substitution replacements. | |
ed7efc79 KW |
430 | |
431 | If none of the above apply, for backwards compatibility reasons, the | |
432 | C</d> modifier is the one in effect by default. As this can lead to | |
433 | unexpected results, it is best to specify which other rule set should be | |
434 | used. | |
435 | ||
436 | =head4 Character set modifier behavior prior to Perl 5.14 | |
437 | ||
438 | Prior to 5.14, there were no explicit modifiers, but C</l> was implied | |
439 | for regexes compiled within the scope of C<use locale>, and C</d> was | |
440 | implied otherwise. However, interpolating a regex into a larger regex | |
441 | would ignore the original compilation in favor of whatever was in effect | |
442 | at the time of the second compilation. There were a number of | |
443 | inconsistencies (bugs) with the C</d> modifier, where Unicode rules | |
444 | would be used when inappropriate, and vice versa. C<\p{}> did not imply | |
445 | Unicode rules, and neither did all occurrences of C<\N{}>, until 5.12. | |
b6fa137b | 446 | |
a0d0e21e LW |
447 | =head2 Regular Expressions |
448 | ||
04838cea RGS |
449 | =head3 Metacharacters |
450 | ||
384f06ae | 451 | The patterns used in Perl pattern matching evolved from those supplied in |
14218588 | 452 | the Version 8 regex routines. (The routines are derived |
19799a22 GS |
453 | (distantly) from Henry Spencer's freely redistributable reimplementation |
454 | of the V8 routines.) See L<Version 8 Regular Expressions> for | |
455 | details. | |
a0d0e21e LW |
456 | |
457 | In particular the following metacharacters have their standard I<egrep>-ish | |
458 | meanings: | |
d74e8afc ITB |
459 | X<metacharacter> |
460 | X<\> X<^> X<.> X<$> X<|> X<(> X<()> X<[> X<[]> | |
461 | ||
a0d0e21e | 462 | |
f793d64a KW |
463 | \ Quote the next metacharacter |
464 | ^ Match the beginning of the line | |
465 | . Match any character (except newline) | |
466 | $ Match the end of the line (or before newline at the end) | |
467 | | Alternation | |
468 | () Grouping | |
469 | [] Bracketed Character class | |
a0d0e21e | 470 | |
14218588 GS |
471 | By default, the "^" character is guaranteed to match only the |
472 | beginning of the string, the "$" character only the end (or before the | |
473 | newline at the end), and Perl does certain optimizations with the | |
a0d0e21e LW |
474 | assumption that the string contains only one line. Embedded newlines |
475 | will not be matched by "^" or "$". You may, however, wish to treat a | |
4a6725af | 476 | string as a multi-line buffer, such that the "^" will match after any |
0d520e8e YO |
477 | newline within the string (except if the newline is the last character in |
478 | the string), and "$" will match before any newline. At the | |
a0d0e21e LW |
479 | cost of a little more overhead, you can do this by using the /m modifier |
480 | on the pattern match operator. (Older programs did this by setting C<$*>, | |
db7cd43a | 481 | but this option was removed in perl 5.10.) |
d74e8afc | 482 | X<^> X<$> X</m> |
a0d0e21e | 483 | |
14218588 | 484 | To simplify multi-line substitutions, the "." character never matches a |
55497cff | 485 | newline unless you use the C</s> modifier, which in effect tells Perl to pretend |
f02c194e | 486 | the string is a single line--even if it isn't. |
d74e8afc | 487 | X<.> X</s> |
a0d0e21e | 488 | |
04838cea RGS |
489 | =head3 Quantifiers |
490 | ||
a0d0e21e | 491 | The following standard quantifiers are recognized: |
d74e8afc | 492 | X<metacharacter> X<quantifier> X<*> X<+> X<?> X<{n}> X<{n,}> X<{n,m}> |
a0d0e21e | 493 | |
f793d64a KW |
494 | * Match 0 or more times |
495 | + Match 1 or more times | |
496 | ? Match 1 or 0 times | |
497 | {n} Match exactly n times | |
498 | {n,} Match at least n times | |
499 | {n,m} Match at least n but not more than m times | |
a0d0e21e | 500 | |
0b928c2f | 501 | (If a curly bracket occurs in any other context and does not form part of |
4d68ffa0 KW |
502 | a backslashed sequence like C<\x{...}>, it is treated as a regular |
503 | character. In particular, the lower quantifier bound is not optional, | |
504 | and a typo in a quantifier silently causes it to be treated as the | |
505 | literal characters. For example, | |
9af81bfe KW |
506 | |
507 | /o{4,3}/ | |
508 | ||
509 | looks like a quantifier that matches 0 times, since 4 is greater than 3, | |
510 | but it really means to match the sequence of six characters | |
4d68ffa0 KW |
511 | S<C<"o { 4 , 3 }">>. It is planned to eventually require literal uses |
512 | of curly brackets to be escaped, say by preceding them with a backslash | |
513 | or enclosing them within square brackets, (C<"\{"> or C<"[{]">). This | |
514 | change will allow for future syntax extensions (like making the lower | |
515 | bound of a quantifier optional), and better error checking. In the | |
516 | meantime, you should get in the habit of escaping all instances where | |
517 | you mean a literal "{".) | |
9af81bfe KW |
518 | |
519 | The "*" quantifier is equivalent to C<{0,}>, the "+" | |
527e91da | 520 | quantifier to C<{1,}>, and the "?" quantifier to C<{0,1}>. n and m are limited |
d0b16107 | 521 | to non-negative integral values less than a preset limit defined when perl is built. |
9c79236d GS |
522 | This is usually 32766 on the most common platforms. The actual limit can |
523 | be seen in the error message generated by code such as this: | |
524 | ||
820475bd | 525 | $_ **= $_ , / {$_} / for 2 .. 42; |
a0d0e21e | 526 | |
54310121 | 527 | By default, a quantified subpattern is "greedy", that is, it will match as |
528 | many times as possible (given a particular starting location) while still | |
529 | allowing the rest of the pattern to match. If you want it to match the | |
530 | minimum number of times possible, follow the quantifier with a "?". Note | |
531 | that the meanings don't change, just the "greediness": | |
0d017f4d | 532 | X<metacharacter> X<greedy> X<greediness> |
d74e8afc | 533 | X<?> X<*?> X<+?> X<??> X<{n}?> X<{n,}?> X<{n,m}?> |
a0d0e21e | 534 | |
f793d64a KW |
535 | *? Match 0 or more times, not greedily |
536 | +? Match 1 or more times, not greedily | |
537 | ?? Match 0 or 1 time, not greedily | |
0b928c2f | 538 | {n}? Match exactly n times, not greedily (redundant) |
f793d64a KW |
539 | {n,}? Match at least n times, not greedily |
540 | {n,m}? Match at least n but not more than m times, not greedily | |
a0d0e21e | 541 | |
5f3789aa | 542 | Normally when a quantified subpattern does not allow the rest of the |
b9b4dddf | 543 | overall pattern to match, Perl will backtrack. However, this behaviour is |
0d017f4d | 544 | sometimes undesirable. Thus Perl provides the "possessive" quantifier form |
b9b4dddf YO |
545 | as well. |
546 | ||
f793d64a KW |
547 | *+ Match 0 or more times and give nothing back |
548 | ++ Match 1 or more times and give nothing back | |
549 | ?+ Match 0 or 1 time and give nothing back | |
550 | {n}+ Match exactly n times and give nothing back (redundant) | |
551 | {n,}+ Match at least n times and give nothing back | |
552 | {n,m}+ Match at least n but not more than m times and give nothing back | |
b9b4dddf YO |
553 | |
554 | For instance, | |
555 | ||
556 | 'aaaa' =~ /a++a/ | |
557 | ||
558 | will never match, as the C<a++> will gobble up all the C<a>'s in the | |
559 | string and won't leave any for the remaining part of the pattern. This | |
560 | feature can be extremely useful to give perl hints about where it | |
561 | shouldn't backtrack. For instance, the typical "match a double-quoted | |
562 | string" problem can be most efficiently performed when written as: | |
563 | ||
564 | /"(?:[^"\\]++|\\.)*+"/ | |
565 | ||
0d017f4d | 566 | as we know that if the final quote does not match, backtracking will not |
0b928c2f FC |
567 | help. See the independent subexpression |
568 | L</C<< (?>pattern) >>> for more details; | |
b9b4dddf YO |
569 | possessive quantifiers are just syntactic sugar for that construct. For |
570 | instance the above example could also be written as follows: | |
571 | ||
572 | /"(?>(?:(?>[^"\\]+)|\\.)*)"/ | |
573 | ||
5f3789aa YO |
574 | Note that the possessive quantifier modifier can not be be combined |
575 | with the non-greedy modifier. This is because it would make no sense. | |
576 | Consider the follow equivalency table: | |
577 | ||
578 | Illegal Legal | |
579 | ------------ ------ | |
580 | X??+ X{0} | |
581 | X+?+ X{1} | |
582 | X{min,max}?+ X{min} | |
583 | ||
04838cea RGS |
584 | =head3 Escape sequences |
585 | ||
0b928c2f | 586 | Because patterns are processed as double-quoted strings, the following |
a0d0e21e LW |
587 | also work: |
588 | ||
f793d64a KW |
589 | \t tab (HT, TAB) |
590 | \n newline (LF, NL) | |
591 | \r return (CR) | |
592 | \f form feed (FF) | |
593 | \a alarm (bell) (BEL) | |
594 | \e escape (think troff) (ESC) | |
f793d64a | 595 | \cK control char (example: VT) |
dc0d9c48 | 596 | \x{}, \x00 character whose ordinal is the given hexadecimal number |
fb121860 | 597 | \N{name} named Unicode character or character sequence |
f793d64a | 598 | \N{U+263D} Unicode character (example: FIRST QUARTER MOON) |
f0a2b745 | 599 | \o{}, \000 character whose ordinal is the given octal number |
f793d64a KW |
600 | \l lowercase next char (think vi) |
601 | \u uppercase next char (think vi) | |
602 | \L lowercase till \E (think vi) | |
603 | \U uppercase till \E (think vi) | |
604 | \Q quote (disable) pattern metacharacters till \E | |
605 | \E end either case modification or quoted section, think vi | |
a0d0e21e | 606 | |
9bb1f947 | 607 | Details are in L<perlop/Quote and Quote-like Operators>. |
1d2dff63 | 608 | |
e1d1eefb | 609 | =head3 Character Classes and other Special Escapes |
04838cea | 610 | |
a0d0e21e | 611 | In addition, Perl defines the following: |
d0b16107 | 612 | X<\g> X<\k> X<\K> X<backreference> |
a0d0e21e | 613 | |
f793d64a KW |
614 | Sequence Note Description |
615 | [...] [1] Match a character according to the rules of the | |
616 | bracketed character class defined by the "...". | |
617 | Example: [a-z] matches "a" or "b" or "c" ... or "z" | |
618 | [[:...:]] [2] Match a character according to the rules of the POSIX | |
619 | character class "..." within the outer bracketed | |
620 | character class. Example: [[:upper:]] matches any | |
621 | uppercase character. | |
572224ce | 622 | (?[...]) [8] Extended bracketed character class |
d35dd6c6 KW |
623 | \w [3] Match a "word" character (alphanumeric plus "_", plus |
624 | other connector punctuation chars plus Unicode | |
0b928c2f | 625 | marks) |
f793d64a KW |
626 | \W [3] Match a non-"word" character |
627 | \s [3] Match a whitespace character | |
628 | \S [3] Match a non-whitespace character | |
629 | \d [3] Match a decimal digit character | |
630 | \D [3] Match a non-digit character | |
631 | \pP [3] Match P, named property. Use \p{Prop} for longer names | |
632 | \PP [3] Match non-P | |
633 | \X [4] Match Unicode "eXtended grapheme cluster" | |
634 | \C Match a single C-language char (octet) even if that is | |
635 | part of a larger UTF-8 character. Thus it breaks up | |
636 | characters into their UTF-8 bytes, so you may end up | |
637 | with malformed pieces of UTF-8. Unsupported in | |
638 | lookbehind. | |
c27a5cfe | 639 | \1 [5] Backreference to a specific capture group or buffer. |
f793d64a KW |
640 | '1' may actually be any positive integer. |
641 | \g1 [5] Backreference to a specific or previous group, | |
642 | \g{-1} [5] The number may be negative indicating a relative | |
c27a5cfe | 643 | previous group and may optionally be wrapped in |
f793d64a KW |
644 | curly brackets for safer parsing. |
645 | \g{name} [5] Named backreference | |
646 | \k<name> [5] Named backreference | |
647 | \K [6] Keep the stuff left of the \K, don't include it in $& | |
2171640d | 648 | \N [7] Any character but \n. Not affected by /s modifier |
f793d64a KW |
649 | \v [3] Vertical whitespace |
650 | \V [3] Not vertical whitespace | |
651 | \h [3] Horizontal whitespace | |
652 | \H [3] Not horizontal whitespace | |
653 | \R [4] Linebreak | |
e1d1eefb | 654 | |
9bb1f947 KW |
655 | =over 4 |
656 | ||
657 | =item [1] | |
658 | ||
659 | See L<perlrecharclass/Bracketed Character Classes> for details. | |
df225385 | 660 | |
9bb1f947 | 661 | =item [2] |
b8c5462f | 662 | |
9bb1f947 | 663 | See L<perlrecharclass/POSIX Character Classes> for details. |
b8c5462f | 664 | |
9bb1f947 | 665 | =item [3] |
5496314a | 666 | |
9bb1f947 | 667 | See L<perlrecharclass/Backslash sequences> for details. |
5496314a | 668 | |
9bb1f947 | 669 | =item [4] |
5496314a | 670 | |
9bb1f947 | 671 | See L<perlrebackslash/Misc> for details. |
d0b16107 | 672 | |
9bb1f947 | 673 | =item [5] |
b8c5462f | 674 | |
c27a5cfe | 675 | See L</Capture groups> below for details. |
93733859 | 676 | |
9bb1f947 | 677 | =item [6] |
b8c5462f | 678 | |
9bb1f947 KW |
679 | See L</Extended Patterns> below for details. |
680 | ||
681 | =item [7] | |
682 | ||
683 | Note that C<\N> has two meanings. When of the form C<\N{NAME}>, it matches the | |
fb121860 KW |
684 | character or character sequence whose name is C<NAME>; and similarly |
685 | when of the form C<\N{U+I<hex>}>, it matches the character whose Unicode | |
686 | code point is I<hex>. Otherwise it matches any character but C<\n>. | |
9bb1f947 | 687 | |
572224ce KW |
688 | =item [8] |
689 | ||
690 | See L<perlrecharclass/Extended Bracketed Character Classes> for details. | |
691 | ||
9bb1f947 | 692 | =back |
d0b16107 | 693 | |
04838cea RGS |
694 | =head3 Assertions |
695 | ||
a0d0e21e | 696 | Perl defines the following zero-width assertions: |
d74e8afc ITB |
697 | X<zero-width assertion> X<assertion> X<regex, zero-width assertion> |
698 | X<regexp, zero-width assertion> | |
699 | X<regular expression, zero-width assertion> | |
700 | X<\b> X<\B> X<\A> X<\Z> X<\z> X<\G> | |
a0d0e21e | 701 | |
9bb1f947 KW |
702 | \b Match a word boundary |
703 | \B Match except at a word boundary | |
704 | \A Match only at beginning of string | |
705 | \Z Match only at end of string, or before newline at the end | |
706 | \z Match only at end of string | |
707 | \G Match only at pos() (e.g. at the end-of-match position | |
9da458fc | 708 | of prior m//g) |
a0d0e21e | 709 | |
14218588 | 710 | A word boundary (C<\b>) is a spot between two characters |
19799a22 GS |
711 | that has a C<\w> on one side of it and a C<\W> on the other side |
712 | of it (in either order), counting the imaginary characters off the | |
713 | beginning and end of the string as matching a C<\W>. (Within | |
714 | character classes C<\b> represents backspace rather than a word | |
715 | boundary, just as it normally does in any double-quoted string.) | |
716 | The C<\A> and C<\Z> are just like "^" and "$", except that they | |
717 | won't match multiple times when the C</m> modifier is used, while | |
718 | "^" and "$" will match at every internal line boundary. To match | |
719 | the actual end of the string and not ignore an optional trailing | |
720 | newline, use C<\z>. | |
d74e8afc | 721 | X<\b> X<\A> X<\Z> X<\z> X</m> |
19799a22 GS |
722 | |
723 | The C<\G> assertion can be used to chain global matches (using | |
724 | C<m//g>), as described in L<perlop/"Regexp Quote-Like Operators">. | |
725 | It is also useful when writing C<lex>-like scanners, when you have | |
726 | several patterns that you want to match against consequent substrings | |
0b928c2f | 727 | of your string; see the previous reference. The actual location |
19799a22 | 728 | where C<\G> will match can also be influenced by using C<pos()> as |
58e23c8d | 729 | an lvalue: see L<perlfunc/pos>. Note that the rule for zero-length |
0b928c2f FC |
730 | matches (see L</"Repeated Patterns Matching a Zero-length Substring">) |
731 | is modified somewhat, in that contents to the left of C<\G> are | |
58e23c8d YO |
732 | not counted when determining the length of the match. Thus the following |
733 | will not match forever: | |
d74e8afc | 734 | X<\G> |
c47ff5f1 | 735 | |
e761bb84 CO |
736 | my $string = 'ABC'; |
737 | pos($string) = 1; | |
738 | while ($string =~ /(.\G)/g) { | |
739 | print $1; | |
740 | } | |
58e23c8d YO |
741 | |
742 | It will print 'A' and then terminate, as it considers the match to | |
743 | be zero-width, and thus will not match at the same position twice in a | |
744 | row. | |
745 | ||
746 | It is worth noting that C<\G> improperly used can result in an infinite | |
747 | loop. Take care when using patterns that include C<\G> in an alternation. | |
748 | ||
c27a5cfe | 749 | =head3 Capture groups |
04838cea | 750 | |
c27a5cfe KW |
751 | The bracketing construct C<( ... )> creates capture groups (also referred to as |
752 | capture buffers). To refer to the current contents of a group later on, within | |
d8b950dc KW |
753 | the same pattern, use C<\g1> (or C<\g{1}>) for the first, C<\g2> (or C<\g{2}>) |
754 | for the second, and so on. | |
755 | This is called a I<backreference>. | |
d74e8afc | 756 | X<regex, capture buffer> X<regexp, capture buffer> |
c27a5cfe | 757 | X<regex, capture group> X<regexp, capture group> |
d74e8afc | 758 | X<regular expression, capture buffer> X<backreference> |
c27a5cfe | 759 | X<regular expression, capture group> X<backreference> |
1f1031fe | 760 | X<\g{1}> X<\g{-1}> X<\g{name}> X<relative backreference> X<named backreference> |
d8b950dc KW |
761 | X<named capture buffer> X<regular expression, named capture buffer> |
762 | X<named capture group> X<regular expression, named capture group> | |
763 | X<%+> X<$+{name}> X<< \k<name> >> | |
764 | There is no limit to the number of captured substrings that you may use. | |
765 | Groups are numbered with the leftmost open parenthesis being number 1, etc. If | |
766 | a group did not match, the associated backreference won't match either. (This | |
767 | can happen if the group is optional, or in a different branch of an | |
768 | alternation.) | |
769 | You can omit the C<"g">, and write C<"\1">, etc, but there are some issues with | |
770 | this form, described below. | |
771 | ||
772 | You can also refer to capture groups relatively, by using a negative number, so | |
773 | that C<\g-1> and C<\g{-1}> both refer to the immediately preceding capture | |
774 | group, and C<\g-2> and C<\g{-2}> both refer to the group before it. For | |
775 | example: | |
5624f11d YO |
776 | |
777 | / | |
c27a5cfe KW |
778 | (Y) # group 1 |
779 | ( # group 2 | |
780 | (X) # group 3 | |
781 | \g{-1} # backref to group 3 | |
782 | \g{-3} # backref to group 1 | |
5624f11d YO |
783 | ) |
784 | /x | |
785 | ||
d8b950dc KW |
786 | would match the same as C</(Y) ( (X) \g3 \g1 )/x>. This allows you to |
787 | interpolate regexes into larger regexes and not have to worry about the | |
788 | capture groups being renumbered. | |
789 | ||
790 | You can dispense with numbers altogether and create named capture groups. | |
791 | The notation is C<(?E<lt>I<name>E<gt>...)> to declare and C<\g{I<name>}> to | |
792 | reference. (To be compatible with .Net regular expressions, C<\g{I<name>}> may | |
793 | also be written as C<\k{I<name>}>, C<\kE<lt>I<name>E<gt>> or C<\k'I<name>'>.) | |
794 | I<name> must not begin with a number, nor contain hyphens. | |
795 | When different groups within the same pattern have the same name, any reference | |
796 | to that name assumes the leftmost defined group. Named groups count in | |
797 | absolute and relative numbering, and so can also be referred to by those | |
798 | numbers. | |
799 | (It's possible to do things with named capture groups that would otherwise | |
800 | require C<(??{})>.) | |
801 | ||
802 | Capture group contents are dynamically scoped and available to you outside the | |
803 | pattern until the end of the enclosing block or until the next successful | |
804 | match, whichever comes first. (See L<perlsyn/"Compound Statements">.) | |
805 | You can refer to them by absolute number (using C<"$1"> instead of C<"\g1">, | |
806 | etc); or by name via the C<%+> hash, using C<"$+{I<name>}">. | |
807 | ||
808 | Braces are required in referring to named capture groups, but are optional for | |
809 | absolute or relative numbered ones. Braces are safer when creating a regex by | |
810 | concatenating smaller strings. For example if you have C<qr/$a$b/>, and C<$a> | |
811 | contained C<"\g1">, and C<$b> contained C<"37">, you would get C</\g137/> which | |
812 | is probably not what you intended. | |
813 | ||
814 | The C<\g> and C<\k> notations were introduced in Perl 5.10.0. Prior to that | |
815 | there were no named nor relative numbered capture groups. Absolute numbered | |
0b928c2f FC |
816 | groups were referred to using C<\1>, |
817 | C<\2>, etc., and this notation is still | |
d8b950dc KW |
818 | accepted (and likely always will be). But it leads to some ambiguities if |
819 | there are more than 9 capture groups, as C<\10> could mean either the tenth | |
820 | capture group, or the character whose ordinal in octal is 010 (a backspace in | |
821 | ASCII). Perl resolves this ambiguity by interpreting C<\10> as a backreference | |
822 | only if at least 10 left parentheses have opened before it. Likewise C<\11> is | |
823 | a backreference only if at least 11 left parentheses have opened before it. | |
e1f120a9 KW |
824 | And so on. C<\1> through C<\9> are always interpreted as backreferences. |
825 | There are several examples below that illustrate these perils. You can avoid | |
826 | the ambiguity by always using C<\g{}> or C<\g> if you mean capturing groups; | |
827 | and for octal constants always using C<\o{}>, or for C<\077> and below, using 3 | |
828 | digits padded with leading zeros, since a leading zero implies an octal | |
829 | constant. | |
d8b950dc KW |
830 | |
831 | The C<\I<digit>> notation also works in certain circumstances outside | |
ed7efc79 | 832 | the pattern. See L</Warning on \1 Instead of $1> below for details. |
81714fb9 | 833 | |
14218588 | 834 | Examples: |
a0d0e21e LW |
835 | |
836 | s/^([^ ]*) *([^ ]*)/$2 $1/; # swap first two words | |
837 | ||
d8b950dc | 838 | /(.)\g1/ # find first doubled char |
81714fb9 YO |
839 | and print "'$1' is the first doubled character\n"; |
840 | ||
841 | /(?<char>.)\k<char>/ # ... a different way | |
842 | and print "'$+{char}' is the first doubled character\n"; | |
843 | ||
d8b950dc | 844 | /(?'char'.)\g1/ # ... mix and match |
81714fb9 | 845 | and print "'$1' is the first doubled character\n"; |
c47ff5f1 | 846 | |
14218588 | 847 | if (/Time: (..):(..):(..)/) { # parse out values |
f793d64a KW |
848 | $hours = $1; |
849 | $minutes = $2; | |
850 | $seconds = $3; | |
a0d0e21e | 851 | } |
c47ff5f1 | 852 | |
9d860678 KW |
853 | /(.)(.)(.)(.)(.)(.)(.)(.)(.)\g10/ # \g10 is a backreference |
854 | /(.)(.)(.)(.)(.)(.)(.)(.)(.)\10/ # \10 is octal | |
855 | /((.)(.)(.)(.)(.)(.)(.)(.)(.))\10/ # \10 is a backreference | |
856 | /((.)(.)(.)(.)(.)(.)(.)(.)(.))\010/ # \010 is octal | |
857 | ||
858 | $a = '(.)\1'; # Creates problems when concatenated. | |
859 | $b = '(.)\g{1}'; # Avoids the problems. | |
860 | "aa" =~ /${a}/; # True | |
861 | "aa" =~ /${b}/; # True | |
862 | "aa0" =~ /${a}0/; # False! | |
863 | "aa0" =~ /${b}0/; # True | |
dc0d9c48 KW |
864 | "aa\x08" =~ /${a}0/; # True! |
865 | "aa\x08" =~ /${b}0/; # False | |
9d860678 | 866 | |
14218588 GS |
867 | Several special variables also refer back to portions of the previous |
868 | match. C<$+> returns whatever the last bracket match matched. | |
869 | C<$&> returns the entire matched string. (At one point C<$0> did | |
870 | also, but now it returns the name of the program.) C<$`> returns | |
77ea4f6d JV |
871 | everything before the matched string. C<$'> returns everything |
872 | after the matched string. And C<$^N> contains whatever was matched by | |
873 | the most-recently closed group (submatch). C<$^N> can be used in | |
874 | extended patterns (see below), for example to assign a submatch to a | |
81714fb9 | 875 | variable. |
d74e8afc | 876 | X<$+> X<$^N> X<$&> X<$`> X<$'> |
14218588 | 877 | |
d8b950dc KW |
878 | These special variables, like the C<%+> hash and the numbered match variables |
879 | (C<$1>, C<$2>, C<$3>, etc.) are dynamically scoped | |
14218588 GS |
880 | until the end of the enclosing block or until the next successful |
881 | match, whichever comes first. (See L<perlsyn/"Compound Statements">.) | |
d74e8afc ITB |
882 | X<$+> X<$^N> X<$&> X<$`> X<$'> |
883 | X<$1> X<$2> X<$3> X<$4> X<$5> X<$6> X<$7> X<$8> X<$9> | |
884 | ||
0d017f4d | 885 | B<NOTE>: Failed matches in Perl do not reset the match variables, |
5146ce24 | 886 | which makes it easier to write code that tests for a series of more |
665e98b9 JH |
887 | specific cases and remembers the best match. |
888 | ||
13b0f67d DM |
889 | B<WARNING>: If your code is to run on Perl 5.16 or earlier, |
890 | beware that once Perl sees that you need one of C<$&>, C<$`>, or | |
14218588 | 891 | C<$'> anywhere in the program, it has to provide them for every |
13b0f67d DM |
892 | pattern match. This may substantially slow your program. |
893 | ||
894 | Perl uses the same mechanism to produce C<$1>, C<$2>, etc, so you also | |
895 | pay a price for each pattern that contains capturing parentheses. | |
896 | (To avoid this cost while retaining the grouping behaviour, use the | |
14218588 GS |
897 | extended regular expression C<(?: ... )> instead.) But if you never |
898 | use C<$&>, C<$`> or C<$'>, then patterns I<without> capturing | |
899 | parentheses will not be penalized. So avoid C<$&>, C<$'>, and C<$`> | |
900 | if you can, but if you can't (and some algorithms really appreciate | |
901 | them), once you've used them once, use them at will, because you've | |
13b0f67d | 902 | already paid the price. |
d74e8afc | 903 | X<$&> X<$`> X<$'> |
68dc0745 | 904 | |
13b0f67d DM |
905 | Perl 5.16 introduced a slightly more efficient mechanism that notes |
906 | separately whether each of C<$`>, C<$&>, and C<$'> have been seen, and | |
907 | thus may only need to copy part of the string. Perl 5.20 introduced a | |
908 | much more efficient copy-on-write mechanism which eliminates any slowdown. | |
909 | ||
910 | As another workaround for this problem, Perl 5.10.0 introduced C<${^PREMATCH}>, | |
cde0cee5 YO |
911 | C<${^MATCH}> and C<${^POSTMATCH}>, which are equivalent to C<$`>, C<$&> |
912 | and C<$'>, B<except> that they are only guaranteed to be defined after a | |
87e95b7f | 913 | successful match that was executed with the C</p> (preserve) modifier. |
cde0cee5 YO |
914 | The use of these variables incurs no global performance penalty, unlike |
915 | their punctuation char equivalents, however at the trade-off that you | |
13b0f67d DM |
916 | have to tell perl when you want to use them. As of Perl 5.20, these three |
917 | variables are equivalent to C<$`>, C<$&> and C<$'>, and C</p> is ignored. | |
87e95b7f | 918 | X</p> X<p modifier> |
cde0cee5 | 919 | |
9d727203 KW |
920 | =head2 Quoting metacharacters |
921 | ||
19799a22 GS |
922 | Backslashed metacharacters in Perl are alphanumeric, such as C<\b>, |
923 | C<\w>, C<\n>. Unlike some other regular expression languages, there | |
924 | are no backslashed symbols that aren't alphanumeric. So anything | |
0f264506 | 925 | that looks like \\, \(, \), \[, \], \{, or \} is always |
19799a22 GS |
926 | interpreted as a literal character, not a metacharacter. This was |
927 | once used in a common idiom to disable or quote the special meanings | |
928 | of regular expression metacharacters in a string that you want to | |
36bbe248 | 929 | use for a pattern. Simply quote all non-"word" characters: |
a0d0e21e LW |
930 | |
931 | $pattern =~ s/(\W)/\\$1/g; | |
932 | ||
f1cbbd6e | 933 | (If C<use locale> is set, then this depends on the current locale.) |
14218588 GS |
934 | Today it is more common to use the quotemeta() function or the C<\Q> |
935 | metaquoting escape sequence to disable all metacharacters' special | |
936 | meanings like this: | |
a0d0e21e LW |
937 | |
938 | /$unquoted\Q$quoted\E$unquoted/ | |
939 | ||
9da458fc IZ |
940 | Beware that if you put literal backslashes (those not inside |
941 | interpolated variables) between C<\Q> and C<\E>, double-quotish | |
942 | backslash interpolation may lead to confusing results. If you | |
943 | I<need> to use literal backslashes within C<\Q...\E>, | |
944 | consult L<perlop/"Gory details of parsing quoted constructs">. | |
945 | ||
736fe711 KW |
946 | C<quotemeta()> and C<\Q> are fully described in L<perlfunc/quotemeta>. |
947 | ||
19799a22 GS |
948 | =head2 Extended Patterns |
949 | ||
14218588 | 950 | Perl also defines a consistent extension syntax for features not |
0b928c2f FC |
951 | found in standard tools like B<awk> and |
952 | B<lex>. The syntax for most of these is a | |
14218588 GS |
953 | pair of parentheses with a question mark as the first thing within |
954 | the parentheses. The character after the question mark indicates | |
955 | the extension. | |
19799a22 | 956 | |
14218588 GS |
957 | The stability of these extensions varies widely. Some have been |
958 | part of the core language for many years. Others are experimental | |
959 | and may change without warning or be completely removed. Check | |
960 | the documentation on an individual feature to verify its current | |
961 | status. | |
19799a22 | 962 | |
14218588 GS |
963 | A question mark was chosen for this and for the minimal-matching |
964 | construct because 1) question marks are rare in older regular | |
965 | expressions, and 2) whenever you see one, you should stop and | |
0b928c2f | 966 | "question" exactly what is going on. That's psychology.... |
a0d0e21e | 967 | |
70ca8714 | 968 | =over 4 |
a0d0e21e | 969 | |
cc6b7395 | 970 | =item C<(?#text)> |
d74e8afc | 971 | X<(?#)> |
a0d0e21e | 972 | |
14218588 | 973 | A comment. The text is ignored. If the C</x> modifier enables |
19799a22 | 974 | whitespace formatting, a simple C<#> will suffice. Note that Perl closes |
259138e3 GS |
975 | the comment as soon as it sees a C<)>, so there is no way to put a literal |
976 | C<)> in the comment. | |
a0d0e21e | 977 | |
cfaf538b | 978 | =item C<(?adlupimsx-imsx)> |
fb85c044 | 979 | |
cfaf538b | 980 | =item C<(?^alupimsx)> |
fb85c044 | 981 | X<(?)> X<(?^)> |
19799a22 | 982 | |
0b6d1084 JH |
983 | One or more embedded pattern-match modifiers, to be turned on (or |
984 | turned off, if preceded by C<->) for the remainder of the pattern or | |
fb85c044 KW |
985 | the remainder of the enclosing pattern group (if any). |
986 | ||
fb85c044 | 987 | This is particularly useful for dynamic patterns, such as those read in from a |
0d017f4d | 988 | configuration file, taken from an argument, or specified in a table |
0b928c2f FC |
989 | somewhere. Consider the case where some patterns want to be |
990 | case-sensitive and some do not: The case-insensitive ones merely need to | |
0d017f4d | 991 | include C<(?i)> at the front of the pattern. For example: |
19799a22 GS |
992 | |
993 | $pattern = "foobar"; | |
5d458dd8 | 994 | if ( /$pattern/i ) { } |
19799a22 GS |
995 | |
996 | # more flexible: | |
997 | ||
998 | $pattern = "(?i)foobar"; | |
5d458dd8 | 999 | if ( /$pattern/ ) { } |
19799a22 | 1000 | |
0b6d1084 | 1001 | These modifiers are restored at the end of the enclosing group. For example, |
19799a22 | 1002 | |
d8b950dc | 1003 | ( (?i) blah ) \s+ \g1 |
19799a22 | 1004 | |
0d017f4d WL |
1005 | will match C<blah> in any case, some spaces, and an exact (I<including the case>!) |
1006 | repetition of the previous word, assuming the C</x> modifier, and no C</i> | |
1007 | modifier outside this group. | |
19799a22 | 1008 | |
8eb5594e | 1009 | These modifiers do not carry over into named subpatterns called in the |
dd72e27b | 1010 | enclosing group. In other words, a pattern such as C<((?i)(?&NAME))> does not |
8eb5594e DR |
1011 | change the case-sensitivity of the "NAME" pattern. |
1012 | ||
dc925305 KW |
1013 | Any of these modifiers can be set to apply globally to all regular |
1014 | expressions compiled within the scope of a C<use re>. See | |
a0bbd6ff | 1015 | L<re/"'/flags' mode">. |
dc925305 | 1016 | |
9de15fec KW |
1017 | Starting in Perl 5.14, a C<"^"> (caret or circumflex accent) immediately |
1018 | after the C<"?"> is a shorthand equivalent to C<d-imsx>. Flags (except | |
1019 | C<"d">) may follow the caret to override it. | |
1020 | But a minus sign is not legal with it. | |
1021 | ||
dc925305 | 1022 | Note that the C<a>, C<d>, C<l>, C<p>, and C<u> modifiers are special in |
e1d8d8ac | 1023 | that they can only be enabled, not disabled, and the C<a>, C<d>, C<l>, and |
dc925305 | 1024 | C<u> modifiers are mutually exclusive: specifying one de-specifies the |
ed7efc79 KW |
1025 | others, and a maximum of one (or two C<a>'s) may appear in the |
1026 | construct. Thus, for | |
0b928c2f | 1027 | example, C<(?-p)> will warn when compiled under C<use warnings>; |
b6fa137b | 1028 | C<(?-d:...)> and C<(?dl:...)> are fatal errors. |
9de15fec KW |
1029 | |
1030 | Note also that the C<p> modifier is special in that its presence | |
1031 | anywhere in a pattern has a global effect. | |
cde0cee5 | 1032 | |
5a964f20 | 1033 | =item C<(?:pattern)> |
d74e8afc | 1034 | X<(?:)> |
a0d0e21e | 1035 | |
cfaf538b | 1036 | =item C<(?adluimsx-imsx:pattern)> |
ca9dfc88 | 1037 | |
cfaf538b | 1038 | =item C<(?^aluimsx:pattern)> |
fb85c044 KW |
1039 | X<(?^:)> |
1040 | ||
5a964f20 TC |
1041 | This is for clustering, not capturing; it groups subexpressions like |
1042 | "()", but doesn't make backreferences as "()" does. So | |
a0d0e21e | 1043 | |
5a964f20 | 1044 | @fields = split(/\b(?:a|b|c)\b/) |
a0d0e21e LW |
1045 | |
1046 | is like | |
1047 | ||
5a964f20 | 1048 | @fields = split(/\b(a|b|c)\b/) |
a0d0e21e | 1049 | |
19799a22 GS |
1050 | but doesn't spit out extra fields. It's also cheaper not to capture |
1051 | characters if you don't need to. | |
a0d0e21e | 1052 | |
19799a22 | 1053 | Any letters between C<?> and C<:> act as flags modifiers as with |
cfaf538b | 1054 | C<(?adluimsx-imsx)>. For example, |
ca9dfc88 IZ |
1055 | |
1056 | /(?s-i:more.*than).*million/i | |
1057 | ||
14218588 | 1058 | is equivalent to the more verbose |
ca9dfc88 IZ |
1059 | |
1060 | /(?:(?s-i)more.*than).*million/i | |
1061 | ||
fb85c044 | 1062 | Starting in Perl 5.14, a C<"^"> (caret or circumflex accent) immediately |
9de15fec KW |
1063 | after the C<"?"> is a shorthand equivalent to C<d-imsx>. Any positive |
1064 | flags (except C<"d">) may follow the caret, so | |
fb85c044 KW |
1065 | |
1066 | (?^x:foo) | |
1067 | ||
1068 | is equivalent to | |
1069 | ||
1070 | (?x-ims:foo) | |
1071 | ||
1072 | The caret tells Perl that this cluster doesn't inherit the flags of any | |
0b928c2f | 1073 | surrounding pattern, but uses the system defaults (C<d-imsx>), |
fb85c044 KW |
1074 | modified by any flags specified. |
1075 | ||
1076 | The caret allows for simpler stringification of compiled regular | |
1077 | expressions. These look like | |
1078 | ||
1079 | (?^:pattern) | |
1080 | ||
1081 | with any non-default flags appearing between the caret and the colon. | |
1082 | A test that looks at such stringification thus doesn't need to have the | |
1083 | system default flags hard-coded in it, just the caret. If new flags are | |
1084 | added to Perl, the meaning of the caret's expansion will change to include | |
1085 | the default for those flags, so the test will still work, unchanged. | |
1086 | ||
1087 | Specifying a negative flag after the caret is an error, as the flag is | |
1088 | redundant. | |
1089 | ||
1090 | Mnemonic for C<(?^...)>: A fresh beginning since the usual use of a caret is | |
1091 | to match at the beginning. | |
1092 | ||
594d7033 YO |
1093 | =item C<(?|pattern)> |
1094 | X<(?|)> X<Branch reset> | |
1095 | ||
1096 | This is the "branch reset" pattern, which has the special property | |
c27a5cfe | 1097 | that the capture groups are numbered from the same starting point |
99d59c4d | 1098 | in each alternation branch. It is available starting from perl 5.10.0. |
4deaaa80 | 1099 | |
c27a5cfe | 1100 | Capture groups are numbered from left to right, but inside this |
693596a8 | 1101 | construct the numbering is restarted for each branch. |
4deaaa80 | 1102 | |
c27a5cfe | 1103 | The numbering within each branch will be as normal, and any groups |
4deaaa80 PJ |
1104 | following this construct will be numbered as though the construct |
1105 | contained only one branch, that being the one with the most capture | |
c27a5cfe | 1106 | groups in it. |
4deaaa80 | 1107 | |
0b928c2f | 1108 | This construct is useful when you want to capture one of a |
4deaaa80 PJ |
1109 | number of alternative matches. |
1110 | ||
1111 | Consider the following pattern. The numbers underneath show in | |
c27a5cfe | 1112 | which group the captured content will be stored. |
594d7033 YO |
1113 | |
1114 | ||
1115 | # before ---------------branch-reset----------- after | |
1116 | / ( a ) (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x | |
1117 | # 1 2 2 3 2 3 4 | |
1118 | ||
ab106183 A |
1119 | Be careful when using the branch reset pattern in combination with |
1120 | named captures. Named captures are implemented as being aliases to | |
c27a5cfe | 1121 | numbered groups holding the captures, and that interferes with the |
ab106183 A |
1122 | implementation of the branch reset pattern. If you are using named |
1123 | captures in a branch reset pattern, it's best to use the same names, | |
1124 | in the same order, in each of the alternations: | |
1125 | ||
1126 | /(?| (?<a> x ) (?<b> y ) | |
1127 | | (?<a> z ) (?<b> w )) /x | |
1128 | ||
1129 | Not doing so may lead to surprises: | |
1130 | ||
1131 | "12" =~ /(?| (?<a> \d+ ) | (?<b> \D+))/x; | |
1132 | say $+ {a}; # Prints '12' | |
1133 | say $+ {b}; # *Also* prints '12'. | |
1134 | ||
c27a5cfe KW |
1135 | The problem here is that both the group named C<< a >> and the group |
1136 | named C<< b >> are aliases for the group belonging to C<< $1 >>. | |
90a18110 | 1137 | |
ee9b8eae YO |
1138 | =item Look-Around Assertions |
1139 | X<look-around assertion> X<lookaround assertion> X<look-around> X<lookaround> | |
1140 | ||
0b928c2f | 1141 | Look-around assertions are zero-width patterns which match a specific |
ee9b8eae YO |
1142 | pattern without including it in C<$&>. Positive assertions match when |
1143 | their subpattern matches, negative assertions match when their subpattern | |
1144 | fails. Look-behind matches text up to the current match position, | |
1145 | look-ahead matches text following the current match position. | |
1146 | ||
1147 | =over 4 | |
1148 | ||
5a964f20 | 1149 | =item C<(?=pattern)> |
d74e8afc | 1150 | X<(?=)> X<look-ahead, positive> X<lookahead, positive> |
a0d0e21e | 1151 | |
19799a22 | 1152 | A zero-width positive look-ahead assertion. For example, C</\w+(?=\t)/> |
a0d0e21e LW |
1153 | matches a word followed by a tab, without including the tab in C<$&>. |
1154 | ||
5a964f20 | 1155 | =item C<(?!pattern)> |
d74e8afc | 1156 | X<(?!)> X<look-ahead, negative> X<lookahead, negative> |
a0d0e21e | 1157 | |
19799a22 | 1158 | A zero-width negative look-ahead assertion. For example C</foo(?!bar)/> |
a0d0e21e | 1159 | matches any occurrence of "foo" that isn't followed by "bar". Note |
19799a22 GS |
1160 | however that look-ahead and look-behind are NOT the same thing. You cannot |
1161 | use this for look-behind. | |
7b8d334a | 1162 | |
5a964f20 | 1163 | If you are looking for a "bar" that isn't preceded by a "foo", C</(?!foo)bar/> |
7b8d334a GS |
1164 | will not do what you want. That's because the C<(?!foo)> is just saying that |
1165 | the next thing cannot be "foo"--and it's not, it's a "bar", so "foobar" will | |
0b928c2f | 1166 | match. Use look-behind instead (see below). |
c277df42 | 1167 | |
ee9b8eae YO |
1168 | =item C<(?<=pattern)> C<\K> |
1169 | X<(?<=)> X<look-behind, positive> X<lookbehind, positive> X<\K> | |
c277df42 | 1170 | |
c47ff5f1 | 1171 | A zero-width positive look-behind assertion. For example, C</(?<=\t)\w+/> |
19799a22 GS |
1172 | matches a word that follows a tab, without including the tab in C<$&>. |
1173 | Works only for fixed-width look-behind. | |
c277df42 | 1174 | |
ee9b8eae YO |
1175 | There is a special form of this construct, called C<\K>, which causes the |
1176 | regex engine to "keep" everything it had matched prior to the C<\K> and | |
0b928c2f | 1177 | not include it in C<$&>. This effectively provides variable-length |
ee9b8eae YO |
1178 | look-behind. The use of C<\K> inside of another look-around assertion |
1179 | is allowed, but the behaviour is currently not well defined. | |
1180 | ||
c62285ac | 1181 | For various reasons C<\K> may be significantly more efficient than the |
ee9b8eae YO |
1182 | equivalent C<< (?<=...) >> construct, and it is especially useful in |
1183 | situations where you want to efficiently remove something following | |
1184 | something else in a string. For instance | |
1185 | ||
1186 | s/(foo)bar/$1/g; | |
1187 | ||
1188 | can be rewritten as the much more efficient | |
1189 | ||
1190 | s/foo\Kbar//g; | |
1191 | ||
5a964f20 | 1192 | =item C<(?<!pattern)> |
d74e8afc | 1193 | X<(?<!)> X<look-behind, negative> X<lookbehind, negative> |
c277df42 | 1194 | |
19799a22 GS |
1195 | A zero-width negative look-behind assertion. For example C</(?<!bar)foo/> |
1196 | matches any occurrence of "foo" that does not follow "bar". Works | |
1197 | only for fixed-width look-behind. | |
c277df42 | 1198 | |
ee9b8eae YO |
1199 | =back |
1200 | ||
81714fb9 YO |
1201 | =item C<(?'NAME'pattern)> |
1202 | ||
1203 | =item C<< (?<NAME>pattern) >> | |
1204 | X<< (?<NAME>) >> X<(?'NAME')> X<named capture> X<capture> | |
1205 | ||
c27a5cfe | 1206 | A named capture group. Identical in every respect to normal capturing |
0b928c2f FC |
1207 | parentheses C<()> but for the additional fact that the group |
1208 | can be referred to by name in various regular expression | |
1209 | constructs (like C<\g{NAME}>) and can be accessed by name | |
1210 | after a successful match via C<%+> or C<%->. See L<perlvar> | |
90a18110 | 1211 | for more details on the C<%+> and C<%-> hashes. |
81714fb9 | 1212 | |
c27a5cfe KW |
1213 | If multiple distinct capture groups have the same name then the |
1214 | $+{NAME} will refer to the leftmost defined group in the match. | |
81714fb9 | 1215 | |
0d017f4d | 1216 | The forms C<(?'NAME'pattern)> and C<< (?<NAME>pattern) >> are equivalent. |
81714fb9 YO |
1217 | |
1218 | B<NOTE:> While the notation of this construct is the same as the similar | |
c27a5cfe | 1219 | function in .NET regexes, the behavior is not. In Perl the groups are |
81714fb9 YO |
1220 | numbered sequentially regardless of being named or not. Thus in the |
1221 | pattern | |
1222 | ||
1223 | /(x)(?<foo>y)(z)/ | |
1224 | ||
1225 | $+{foo} will be the same as $2, and $3 will contain 'z' instead of | |
1226 | the opposite which is what a .NET regex hacker might expect. | |
1227 | ||
1f1031fe YO |
1228 | Currently NAME is restricted to simple identifiers only. |
1229 | In other words, it must match C</^[_A-Za-z][_A-Za-z0-9]*\z/> or | |
1230 | its Unicode extension (see L<utf8>), | |
1231 | though it isn't extended by the locale (see L<perllocale>). | |
81714fb9 | 1232 | |
1f1031fe | 1233 | B<NOTE:> In order to make things easier for programmers with experience |
ae5648b3 | 1234 | with the Python or PCRE regex engines, the pattern C<< (?PE<lt>NAMEE<gt>pattern) >> |
0d017f4d | 1235 | may be used instead of C<< (?<NAME>pattern) >>; however this form does not |
64c5a566 | 1236 | support the use of single quotes as a delimiter for the name. |
81714fb9 | 1237 | |
1f1031fe YO |
1238 | =item C<< \k<NAME> >> |
1239 | ||
1240 | =item C<< \k'NAME' >> | |
81714fb9 YO |
1241 | |
1242 | Named backreference. Similar to numeric backreferences, except that | |
1243 | the group is designated by name and not number. If multiple groups | |
1244 | have the same name then it refers to the leftmost defined group in | |
1245 | the current match. | |
1246 | ||
0d017f4d | 1247 | It is an error to refer to a name not defined by a C<< (?<NAME>) >> |
81714fb9 YO |
1248 | earlier in the pattern. |
1249 | ||
1250 | Both forms are equivalent. | |
1251 | ||
1f1031fe | 1252 | B<NOTE:> In order to make things easier for programmers with experience |
0d017f4d | 1253 | with the Python or PCRE regex engines, the pattern C<< (?P=NAME) >> |
64c5a566 | 1254 | may be used instead of C<< \k<NAME> >>. |
1f1031fe | 1255 | |
cc6b7395 | 1256 | =item C<(?{ code })> |
d74e8afc | 1257 | X<(?{})> X<regex, code in> X<regexp, code in> X<regular expression, code in> |
c277df42 | 1258 | |
83f32aba RS |
1259 | B<WARNING>: Using this feature safely requires that you understand its |
1260 | limitations. Code executed that has side effects may not perform identically | |
1261 | from version to version due to the effect of future optimisations in the regex | |
1262 | engine. For more information on this, see L</Embedded Code Execution | |
1263 | Frequency>. | |
c277df42 | 1264 | |
e128ab2c DM |
1265 | This zero-width assertion executes any embedded Perl code. It always |
1266 | succeeds, and its return value is set as C<$^R>. | |
19799a22 | 1267 | |
e128ab2c DM |
1268 | In literal patterns, the code is parsed at the same time as the |
1269 | surrounding code. While within the pattern, control is passed temporarily | |
1270 | back to the perl parser, until the logically-balancing closing brace is | |
1271 | encountered. This is similar to the way that an array index expression in | |
1272 | a literal string is handled, for example | |
77ea4f6d | 1273 | |
e128ab2c DM |
1274 | "abc$array[ 1 + f('[') + g()]def" |
1275 | ||
1276 | In particular, braces do not need to be balanced: | |
1277 | ||
576fa024 | 1278 | s/abc(?{ f('{'); })/def/ |
e128ab2c DM |
1279 | |
1280 | Even in a pattern that is interpolated and compiled at run-time, literal | |
1281 | code blocks will be compiled once, at perl compile time; the following | |
1282 | prints "ABCD": | |
1283 | ||
1284 | print "D"; | |
1285 | my $qr = qr/(?{ BEGIN { print "A" } })/; | |
1286 | my $foo = "foo"; | |
1287 | /$foo$qr(?{ BEGIN { print "B" } })/; | |
1288 | BEGIN { print "C" } | |
1289 | ||
1290 | In patterns where the text of the code is derived from run-time | |
1291 | information rather than appearing literally in a source code /pattern/, | |
1292 | the code is compiled at the same time that the pattern is compiled, and | |
5771dda0 | 1293 | for reasons of security, C<use re 'eval'> must be in scope. This is to |
e128ab2c DM |
1294 | stop user-supplied patterns containing code snippets from being |
1295 | executable. | |
1296 | ||
5771dda0 | 1297 | In situations where you need to enable this with C<use re 'eval'>, you should |
e128ab2c DM |
1298 | also have taint checking enabled. Better yet, use the carefully |
1299 | constrained evaluation within a Safe compartment. See L<perlsec> for | |
1300 | details about both these mechanisms. | |
1301 | ||
1302 | From the viewpoint of parsing, lexical variable scope and closures, | |
1303 | ||
1304 | /AAA(?{ BBB })CCC/ | |
1305 | ||
1306 | behaves approximately like | |
1307 | ||
1308 | /AAA/ && do { BBB } && /CCC/ | |
1309 | ||
1310 | Similarly, | |
1311 | ||
1312 | qr/AAA(?{ BBB })CCC/ | |
1313 | ||
1314 | behaves approximately like | |
77ea4f6d | 1315 | |
e128ab2c DM |
1316 | sub { /AAA/ && do { BBB } && /CCC/ } |
1317 | ||
1318 | In particular: | |
1319 | ||
1320 | { my $i = 1; $r = qr/(?{ print $i })/ } | |
1321 | my $i = 2; | |
1322 | /$r/; # prints "1" | |
1323 | ||
1324 | Inside a C<(?{...})> block, C<$_> refers to the string the regular | |
754091cb | 1325 | expression is matching against. You can also use C<pos()> to know what is |
fa11829f | 1326 | the current position of matching within this string. |
754091cb | 1327 | |
e128ab2c DM |
1328 | The code block introduces a new scope from the perspective of lexical |
1329 | variable declarations, but B<not> from the perspective of C<local> and | |
1330 | similar localizing behaviours. So later code blocks within the same | |
1331 | pattern will still see the values which were localized in earlier blocks. | |
1332 | These accumulated localizations are undone either at the end of a | |
1333 | successful match, or if the assertion is backtracked (compare | |
1334 | L<"Backtracking">). For example, | |
b9ac3b5b GS |
1335 | |
1336 | $_ = 'a' x 8; | |
5d458dd8 | 1337 | m< |
d1fbf752 | 1338 | (?{ $cnt = 0 }) # Initialize $cnt. |
b9ac3b5b | 1339 | ( |
5d458dd8 | 1340 | a |
b9ac3b5b | 1341 | (?{ |
d1fbf752 KW |
1342 | local $cnt = $cnt + 1; # Update $cnt, |
1343 | # backtracking-safe. | |
b9ac3b5b | 1344 | }) |
5d458dd8 | 1345 | )* |
b9ac3b5b | 1346 | aaaa |
d1fbf752 KW |
1347 | (?{ $res = $cnt }) # On success copy to |
1348 | # non-localized location. | |
b9ac3b5b GS |
1349 | >x; |
1350 | ||
e128ab2c DM |
1351 | will initially increment C<$cnt> up to 8; then during backtracking, its |
1352 | value will be unwound back to 4, which is the value assigned to C<$res>. | |
1353 | At the end of the regex execution, $cnt will be wound back to its initial | |
1354 | value of 0. | |
1355 | ||
1356 | This assertion may be used as the condition in a | |
b9ac3b5b | 1357 | |
e128ab2c DM |
1358 | (?(condition)yes-pattern|no-pattern) |
1359 | ||
1360 | switch. If I<not> used in this way, the result of evaluation of C<code> | |
1361 | is put into the special variable C<$^R>. This happens immediately, so | |
1362 | C<$^R> can be used from other C<(?{ code })> assertions inside the same | |
1363 | regular expression. | |
b9ac3b5b | 1364 | |
19799a22 GS |
1365 | The assignment to C<$^R> above is properly localized, so the old |
1366 | value of C<$^R> is restored if the assertion is backtracked; compare | |
1367 | L<"Backtracking">. | |
b9ac3b5b | 1368 | |
e128ab2c DM |
1369 | Note that the special variable C<$^N> is particularly useful with code |
1370 | blocks to capture the results of submatches in variables without having to | |
1371 | keep track of the number of nested parentheses. For example: | |
1372 | ||
1373 | $_ = "The brown fox jumps over the lazy dog"; | |
1374 | /the (\S+)(?{ $color = $^N }) (\S+)(?{ $animal = $^N })/i; | |
1375 | print "color = $color, animal = $animal\n"; | |
1376 | ||
8988a1bb | 1377 | |
14455d6c | 1378 | =item C<(??{ code })> |
d74e8afc ITB |
1379 | X<(??{})> |
1380 | X<regex, postponed> X<regexp, postponed> X<regular expression, postponed> | |
0f5d15d6 | 1381 | |
83f32aba RS |
1382 | B<WARNING>: Using this feature safely requires that you understand its |
1383 | limitations. Code executed that has side effects may not perform | |
1384 | identically from version to version due to the effect of future | |
1385 | optimisations in the regex engine. For more information on this, see | |
1386 | L</Embedded Code Execution Frequency>. | |
0f5d15d6 | 1387 | |
e128ab2c DM |
1388 | This is a "postponed" regular subexpression. It behaves in I<exactly> the |
1389 | same way as a C<(?{ code })> code block as described above, except that | |
1390 | its return value, rather than being assigned to C<$^R>, is treated as a | |
1391 | pattern, compiled if it's a string (or used as-is if its a qr// object), | |
1392 | then matched as if it were inserted instead of this construct. | |
6bda09f9 | 1393 | |
e128ab2c DM |
1394 | During the matching of this sub-pattern, it has its own set of |
1395 | captures which are valid during the sub-match, but are discarded once | |
1396 | control returns to the main pattern. For example, the following matches, | |
1397 | with the inner pattern capturing "B" and matching "BB", while the outer | |
1398 | pattern captures "A"; | |
1399 | ||
1400 | my $inner = '(.)\1'; | |
1401 | "ABBA" =~ /^(.)(??{ $inner })\1/; | |
1402 | print $1; # prints "A"; | |
6bda09f9 | 1403 | |
e128ab2c DM |
1404 | Note that this means that there is no way for the inner pattern to refer |
1405 | to a capture group defined outside. (The code block itself can use C<$1>, | |
1406 | etc., to refer to the enclosing pattern's capture groups.) Thus, although | |
0f5d15d6 | 1407 | |
e128ab2c DM |
1408 | ('a' x 100)=~/(??{'(.)' x 100})/ |
1409 | ||
1410 | I<will> match, it will I<not> set $1 on exit. | |
19799a22 GS |
1411 | |
1412 | The following pattern matches a parenthesized group: | |
0f5d15d6 | 1413 | |
d1fbf752 KW |
1414 | $re = qr{ |
1415 | \( | |
1416 | (?: | |
1417 | (?> [^()]+ ) # Non-parens without backtracking | |
1418 | | | |
1419 | (??{ $re }) # Group with matching parens | |
1420 | )* | |
1421 | \) | |
1422 | }x; | |
0f5d15d6 | 1423 | |
93f313ef KW |
1424 | See also |
1425 | L<C<(?I<PARNO>)>|/(?PARNO) (?-PARNO) (?+PARNO) (?R) (?0)> | |
1426 | for a different, more efficient way to accomplish | |
6bda09f9 YO |
1427 | the same task. |
1428 | ||
e128ab2c DM |
1429 | Executing a postponed regular expression 50 times without consuming any |
1430 | input string will result in a fatal error. The maximum depth is compiled | |
1431 | into perl, so changing it requires a custom build. | |
6bda09f9 | 1432 | |
93f313ef | 1433 | =item C<(?I<PARNO>)> C<(?-I<PARNO>)> C<(?+I<PARNO>)> C<(?R)> C<(?0)> |
542fa716 | 1434 | X<(?PARNO)> X<(?1)> X<(?R)> X<(?0)> X<(?-1)> X<(?+1)> X<(?-PARNO)> X<(?+PARNO)> |
6bda09f9 | 1435 | X<regex, recursive> X<regexp, recursive> X<regular expression, recursive> |
542fa716 | 1436 | X<regex, relative recursion> |
6bda09f9 | 1437 | |
e128ab2c DM |
1438 | Similar to C<(??{ code })> except that it does not involve executing any |
1439 | code or potentially compiling a returned pattern string; instead it treats | |
1440 | the part of the current pattern contained within a specified capture group | |
1441 | as an independent pattern that must match at the current position. | |
1442 | Capture groups contained by the pattern will have the value as determined | |
1443 | by the outermost recursion. | |
6bda09f9 | 1444 | |
93f313ef | 1445 | I<PARNO> is a sequence of digits (not starting with 0) whose value reflects |
c27a5cfe | 1446 | the paren-number of the capture group to recurse to. C<(?R)> recurses to |
894be9b7 | 1447 | the beginning of the whole pattern. C<(?0)> is an alternate syntax for |
93f313ef | 1448 | C<(?R)>. If I<PARNO> is preceded by a plus or minus sign then it is assumed |
c27a5cfe | 1449 | to be relative, with negative numbers indicating preceding capture groups |
542fa716 | 1450 | and positive ones following. Thus C<(?-1)> refers to the most recently |
c27a5cfe | 1451 | declared group, and C<(?+1)> indicates the next group to be declared. |
c74340f9 | 1452 | Note that the counting for relative recursion differs from that of |
c27a5cfe | 1453 | relative backreferences, in that with recursion unclosed groups B<are> |
c74340f9 | 1454 | included. |
6bda09f9 | 1455 | |
81714fb9 | 1456 | The following pattern matches a function foo() which may contain |
f145b7e9 | 1457 | balanced parentheses as the argument. |
6bda09f9 | 1458 | |
d1fbf752 | 1459 | $re = qr{ ( # paren group 1 (full function) |
81714fb9 | 1460 | foo |
d1fbf752 | 1461 | ( # paren group 2 (parens) |
6bda09f9 | 1462 | \( |
d1fbf752 | 1463 | ( # paren group 3 (contents of parens) |
6bda09f9 | 1464 | (?: |
d1fbf752 | 1465 | (?> [^()]+ ) # Non-parens without backtracking |
6bda09f9 | 1466 | | |
d1fbf752 | 1467 | (?2) # Recurse to start of paren group 2 |
6bda09f9 YO |
1468 | )* |
1469 | ) | |
1470 | \) | |
1471 | ) | |
1472 | ) | |
1473 | }x; | |
1474 | ||
1475 | If the pattern was used as follows | |
1476 | ||
1477 | 'foo(bar(baz)+baz(bop))'=~/$re/ | |
1478 | and print "\$1 = $1\n", | |
1479 | "\$2 = $2\n", | |
1480 | "\$3 = $3\n"; | |
1481 | ||
1482 | the output produced should be the following: | |
1483 | ||
1484 | $1 = foo(bar(baz)+baz(bop)) | |
1485 | $2 = (bar(baz)+baz(bop)) | |
81714fb9 | 1486 | $3 = bar(baz)+baz(bop) |
6bda09f9 | 1487 | |
c27a5cfe | 1488 | If there is no corresponding capture group defined, then it is a |
61528107 | 1489 | fatal error. Recursing deeper than 50 times without consuming any input |
81714fb9 | 1490 | string will also result in a fatal error. The maximum depth is compiled |
6bda09f9 YO |
1491 | into perl, so changing it requires a custom build. |
1492 | ||
542fa716 YO |
1493 | The following shows how using negative indexing can make it |
1494 | easier to embed recursive patterns inside of a C<qr//> construct | |
1495 | for later use: | |
1496 | ||
1497 | my $parens = qr/(\((?:[^()]++|(?-1))*+\))/; | |
c77257ed | 1498 | if (/foo $parens \s+ \+ \s+ bar $parens/x) { |
542fa716 YO |
1499 | # do something here... |
1500 | } | |
1501 | ||
81714fb9 | 1502 | B<Note> that this pattern does not behave the same way as the equivalent |
0d017f4d | 1503 | PCRE or Python construct of the same form. In Perl you can backtrack into |
6bda09f9 | 1504 | a recursed group, in PCRE and Python the recursed into group is treated |
542fa716 YO |
1505 | as atomic. Also, modifiers are resolved at compile time, so constructs |
1506 | like (?i:(?1)) or (?:(?i)(?1)) do not affect how the sub-pattern will | |
1507 | be processed. | |
6bda09f9 | 1508 | |
894be9b7 YO |
1509 | =item C<(?&NAME)> |
1510 | X<(?&NAME)> | |
1511 | ||
93f313ef | 1512 | Recurse to a named subpattern. Identical to C<(?I<PARNO>)> except that the |
0d017f4d | 1513 | parenthesis to recurse to is determined by name. If multiple parentheses have |
894be9b7 YO |
1514 | the same name, then it recurses to the leftmost. |
1515 | ||
1516 | It is an error to refer to a name that is not declared somewhere in the | |
1517 | pattern. | |
1518 | ||
1f1031fe YO |
1519 | B<NOTE:> In order to make things easier for programmers with experience |
1520 | with the Python or PCRE regex engines the pattern C<< (?P>NAME) >> | |
64c5a566 | 1521 | may be used instead of C<< (?&NAME) >>. |
1f1031fe | 1522 | |
e2e6a0f1 YO |
1523 | =item C<(?(condition)yes-pattern|no-pattern)> |
1524 | X<(?()> | |
286f584a | 1525 | |
e2e6a0f1 | 1526 | =item C<(?(condition)yes-pattern)> |
286f584a | 1527 | |
41ef34de ML |
1528 | Conditional expression. Matches C<yes-pattern> if C<condition> yields |
1529 | a true value, matches C<no-pattern> otherwise. A missing pattern always | |
1530 | matches. | |
1531 | ||
25e26d77 | 1532 | C<(condition)> should be one of: 1) an integer in |
e2e6a0f1 | 1533 | parentheses (which is valid if the corresponding pair of parentheses |
25e26d77 | 1534 | matched); 2) a look-ahead/look-behind/evaluate zero-width assertion; 3) a |
c27a5cfe | 1535 | name in angle brackets or single quotes (which is valid if a group |
25e26d77 | 1536 | with the given name matched); or 4) the special symbol (R) (true when |
e2e6a0f1 YO |
1537 | evaluated inside of recursion or eval). Additionally the R may be |
1538 | followed by a number, (which will be true when evaluated when recursing | |
1539 | inside of the appropriate group), or by C<&NAME>, in which case it will | |
1540 | be true only when evaluated during recursion in the named group. | |
1541 | ||
1542 | Here's a summary of the possible predicates: | |
1543 | ||
1544 | =over 4 | |
1545 | ||
1546 | =item (1) (2) ... | |
1547 | ||
c27a5cfe | 1548 | Checks if the numbered capturing group has matched something. |
e2e6a0f1 YO |
1549 | |
1550 | =item (<NAME>) ('NAME') | |
1551 | ||
c27a5cfe | 1552 | Checks if a group with the given name has matched something. |
e2e6a0f1 | 1553 | |
f01cd190 FC |
1554 | =item (?=...) (?!...) (?<=...) (?<!...) |
1555 | ||
1556 | Checks whether the pattern matches (or does not match, for the '!' | |
1557 | variants). | |
1558 | ||
e2e6a0f1 YO |
1559 | =item (?{ CODE }) |
1560 | ||
f01cd190 | 1561 | Treats the return value of the code block as the condition. |
e2e6a0f1 YO |
1562 | |
1563 | =item (R) | |
1564 | ||
1565 | Checks if the expression has been evaluated inside of recursion. | |
1566 | ||
1567 | =item (R1) (R2) ... | |
1568 | ||
1569 | Checks if the expression has been evaluated while executing directly | |
1570 | inside of the n-th capture group. This check is the regex equivalent of | |
1571 | ||
1572 | if ((caller(0))[3] eq 'subname') { ... } | |
1573 | ||
1574 | In other words, it does not check the full recursion stack. | |
1575 | ||
1576 | =item (R&NAME) | |
1577 | ||
1578 | Similar to C<(R1)>, this predicate checks to see if we're executing | |
1579 | directly inside of the leftmost group with a given name (this is the same | |
1580 | logic used by C<(?&NAME)> to disambiguate). It does not check the full | |
1581 | stack, but only the name of the innermost active recursion. | |
1582 | ||
1583 | =item (DEFINE) | |
1584 | ||
1585 | In this case, the yes-pattern is never directly executed, and no | |
1586 | no-pattern is allowed. Similar in spirit to C<(?{0})> but more efficient. | |
1587 | See below for details. | |
1588 | ||
1589 | =back | |
1590 | ||
1591 | For example: | |
1592 | ||
1593 | m{ ( \( )? | |
1594 | [^()]+ | |
1595 | (?(1) \) ) | |
1596 | }x | |
1597 | ||
1598 | matches a chunk of non-parentheses, possibly included in parentheses | |
1599 | themselves. | |
1600 | ||
0b928c2f FC |
1601 | A special form is the C<(DEFINE)> predicate, which never executes its |
1602 | yes-pattern directly, and does not allow a no-pattern. This allows one to | |
1603 | define subpatterns which will be executed only by the recursion mechanism. | |
e2e6a0f1 YO |
1604 | This way, you can define a set of regular expression rules that can be |
1605 | bundled into any pattern you choose. | |
1606 | ||
1607 | It is recommended that for this usage you put the DEFINE block at the | |
1608 | end of the pattern, and that you name any subpatterns defined within it. | |
1609 | ||
1610 | Also, it's worth noting that patterns defined this way probably will | |
31dc26d6 | 1611 | not be as efficient, as the optimizer is not very clever about |
e2e6a0f1 YO |
1612 | handling them. |
1613 | ||
1614 | An example of how this might be used is as follows: | |
1615 | ||
2bf803e2 | 1616 | /(?<NAME>(?&NAME_PAT))(?<ADDR>(?&ADDRESS_PAT)) |
e2e6a0f1 | 1617 | (?(DEFINE) |
2bf803e2 YO |
1618 | (?<NAME_PAT>....) |
1619 | (?<ADRESS_PAT>....) | |
e2e6a0f1 YO |
1620 | )/x |
1621 | ||
c27a5cfe KW |
1622 | Note that capture groups matched inside of recursion are not accessible |
1623 | after the recursion returns, so the extra layer of capturing groups is | |
e2e6a0f1 YO |
1624 | necessary. Thus C<$+{NAME_PAT}> would not be defined even though |
1625 | C<$+{NAME}> would be. | |
286f584a | 1626 | |
51a1303c BF |
1627 | Finally, keep in mind that subpatterns created inside a DEFINE block |
1628 | count towards the absolute and relative number of captures, so this: | |
1629 | ||
1630 | my @captures = "a" =~ /(.) # First capture | |
1631 | (?(DEFINE) | |
1632 | (?<EXAMPLE> 1 ) # Second capture | |
1633 | )/x; | |
1634 | say scalar @captures; | |
1635 | ||
1636 | Will output 2, not 1. This is particularly important if you intend to | |
1637 | compile the definitions with the C<qr//> operator, and later | |
1638 | interpolate them in another pattern. | |
1639 | ||
c47ff5f1 | 1640 | =item C<< (?>pattern) >> |
6bda09f9 | 1641 | X<backtrack> X<backtracking> X<atomic> X<possessive> |
5a964f20 | 1642 | |
19799a22 GS |
1643 | An "independent" subexpression, one which matches the substring |
1644 | that a I<standalone> C<pattern> would match if anchored at the given | |
9da458fc | 1645 | position, and it matches I<nothing other than this substring>. This |
19799a22 GS |
1646 | construct is useful for optimizations of what would otherwise be |
1647 | "eternal" matches, because it will not backtrack (see L<"Backtracking">). | |
9da458fc IZ |
1648 | It may also be useful in places where the "grab all you can, and do not |
1649 | give anything back" semantic is desirable. | |
19799a22 | 1650 | |
c47ff5f1 | 1651 | For example: C<< ^(?>a*)ab >> will never match, since C<< (?>a*) >> |
19799a22 GS |
1652 | (anchored at the beginning of string, as above) will match I<all> |
1653 | characters C<a> at the beginning of string, leaving no C<a> for | |
1654 | C<ab> to match. In contrast, C<a*ab> will match the same as C<a+b>, | |
1655 | since the match of the subgroup C<a*> is influenced by the following | |
1656 | group C<ab> (see L<"Backtracking">). In particular, C<a*> inside | |
1657 | C<a*ab> will match fewer characters than a standalone C<a*>, since | |
1658 | this makes the tail match. | |
1659 | ||
0b928c2f FC |
1660 | C<< (?>pattern) >> does not disable backtracking altogether once it has |
1661 | matched. It is still possible to backtrack past the construct, but not | |
1662 | into it. So C<< ((?>a*)|(?>b*))ar >> will still match "bar". | |
1663 | ||
c47ff5f1 | 1664 | An effect similar to C<< (?>pattern) >> may be achieved by writing |
0b928c2f FC |
1665 | C<(?=(pattern))\g{-1}>. This matches the same substring as a standalone |
1666 | C<a+>, and the following C<\g{-1}> eats the matched string; it therefore | |
c47ff5f1 | 1667 | makes a zero-length assertion into an analogue of C<< (?>...) >>. |
19799a22 GS |
1668 | (The difference between these two constructs is that the second one |
1669 | uses a capturing group, thus shifting ordinals of backreferences | |
1670 | in the rest of a regular expression.) | |
1671 | ||
1672 | Consider this pattern: | |
c277df42 | 1673 | |
871b0233 | 1674 | m{ \( |
e2e6a0f1 | 1675 | ( |
f793d64a | 1676 | [^()]+ # x+ |
e2e6a0f1 | 1677 | | |
871b0233 IZ |
1678 | \( [^()]* \) |
1679 | )+ | |
e2e6a0f1 | 1680 | \) |
871b0233 | 1681 | }x |
5a964f20 | 1682 | |
19799a22 GS |
1683 | That will efficiently match a nonempty group with matching parentheses |
1684 | two levels deep or less. However, if there is no such group, it | |
1685 | will take virtually forever on a long string. That's because there | |
1686 | are so many different ways to split a long string into several | |
1687 | substrings. This is what C<(.+)+> is doing, and C<(.+)+> is similar | |
1688 | to a subpattern of the above pattern. Consider how the pattern | |
1689 | above detects no-match on C<((()aaaaaaaaaaaaaaaaaa> in several | |
1690 | seconds, but that each extra letter doubles this time. This | |
1691 | exponential performance will make it appear that your program has | |
14218588 | 1692 | hung. However, a tiny change to this pattern |
5a964f20 | 1693 | |
e2e6a0f1 YO |
1694 | m{ \( |
1695 | ( | |
f793d64a | 1696 | (?> [^()]+ ) # change x+ above to (?> x+ ) |
e2e6a0f1 | 1697 | | |
871b0233 IZ |
1698 | \( [^()]* \) |
1699 | )+ | |
e2e6a0f1 | 1700 | \) |
871b0233 | 1701 | }x |
c277df42 | 1702 | |
c47ff5f1 | 1703 | which uses C<< (?>...) >> matches exactly when the one above does (verifying |
5a964f20 TC |
1704 | this yourself would be a productive exercise), but finishes in a fourth |
1705 | the time when used on a similar string with 1000000 C<a>s. Be aware, | |
0b928c2f FC |
1706 | however, that, when this construct is followed by a |
1707 | quantifier, it currently triggers a warning message under | |
9f1b1f2d | 1708 | the C<use warnings> pragma or B<-w> switch saying it |
6bab786b | 1709 | C<"matches null string many times in regex">. |
c277df42 | 1710 | |
c47ff5f1 | 1711 | On simple groups, such as the pattern C<< (?> [^()]+ ) >>, a comparable |
19799a22 | 1712 | effect may be achieved by negative look-ahead, as in C<[^()]+ (?! [^()] )>. |
c277df42 IZ |
1713 | This was only 4 times slower on a string with 1000000 C<a>s. |
1714 | ||
9da458fc IZ |
1715 | The "grab all you can, and do not give anything back" semantic is desirable |
1716 | in many situations where on the first sight a simple C<()*> looks like | |
1717 | the correct solution. Suppose we parse text with comments being delimited | |
1718 | by C<#> followed by some optional (horizontal) whitespace. Contrary to | |
4375e838 | 1719 | its appearance, C<#[ \t]*> I<is not> the correct subexpression to match |
9da458fc IZ |
1720 | the comment delimiter, because it may "give up" some whitespace if |
1721 | the remainder of the pattern can be made to match that way. The correct | |
1722 | answer is either one of these: | |
1723 | ||
1724 | (?>#[ \t]*) | |
1725 | #[ \t]*(?![ \t]) | |
1726 | ||
1727 | For example, to grab non-empty comments into $1, one should use either | |
1728 | one of these: | |
1729 | ||
1730 | / (?> \# [ \t]* ) ( .+ ) /x; | |
1731 | / \# [ \t]* ( [^ \t] .* ) /x; | |
1732 | ||
1733 | Which one you pick depends on which of these expressions better reflects | |
1734 | the above specification of comments. | |
1735 | ||
6bda09f9 YO |
1736 | In some literature this construct is called "atomic matching" or |
1737 | "possessive matching". | |
1738 | ||
b9b4dddf YO |
1739 | Possessive quantifiers are equivalent to putting the item they are applied |
1740 | to inside of one of these constructs. The following equivalences apply: | |
1741 | ||
1742 | Quantifier Form Bracketing Form | |
1743 | --------------- --------------- | |
1744 | PAT*+ (?>PAT*) | |
1745 | PAT++ (?>PAT+) | |
1746 | PAT?+ (?>PAT?) | |
1747 | PAT{min,max}+ (?>PAT{min,max}) | |
1748 | ||
9d1a5160 | 1749 | =item C<(?[ ])> |
f4f5fe57 | 1750 | |
572224ce | 1751 | See L<perlrecharclass/Extended Bracketed Character Classes>. |
9d1a5160 | 1752 | |
e2e6a0f1 YO |
1753 | =back |
1754 | ||
1755 | =head2 Special Backtracking Control Verbs | |
1756 | ||
e2e6a0f1 YO |
1757 | These special patterns are generally of the form C<(*VERB:ARG)>. Unless |
1758 | otherwise stated the ARG argument is optional; in some cases, it is | |
1759 | forbidden. | |
1760 | ||
1761 | Any pattern containing a special backtracking verb that allows an argument | |
e1020413 | 1762 | has the special behaviour that when executed it sets the current package's |
5d458dd8 YO |
1763 | C<$REGERROR> and C<$REGMARK> variables. When doing so the following |
1764 | rules apply: | |
e2e6a0f1 | 1765 | |
5d458dd8 YO |
1766 | On failure, the C<$REGERROR> variable will be set to the ARG value of the |
1767 | verb pattern, if the verb was involved in the failure of the match. If the | |
1768 | ARG part of the pattern was omitted, then C<$REGERROR> will be set to the | |
1769 | name of the last C<(*MARK:NAME)> pattern executed, or to TRUE if there was | |
1770 | none. Also, the C<$REGMARK> variable will be set to FALSE. | |
e2e6a0f1 | 1771 | |
5d458dd8 YO |
1772 | On a successful match, the C<$REGERROR> variable will be set to FALSE, and |
1773 | the C<$REGMARK> variable will be set to the name of the last | |
1774 | C<(*MARK:NAME)> pattern executed. See the explanation for the | |
1775 | C<(*MARK:NAME)> verb below for more details. | |
e2e6a0f1 | 1776 | |
5d458dd8 | 1777 | B<NOTE:> C<$REGERROR> and C<$REGMARK> are not magic variables like C<$1> |
0b928c2f | 1778 | and most other regex-related variables. They are not local to a scope, nor |
5d458dd8 YO |
1779 | readonly, but instead are volatile package variables similar to C<$AUTOLOAD>. |
1780 | Use C<local> to localize changes to them to a specific scope if necessary. | |
e2e6a0f1 YO |
1781 | |
1782 | If a pattern does not contain a special backtracking verb that allows an | |
5d458dd8 | 1783 | argument, then C<$REGERROR> and C<$REGMARK> are not touched at all. |
e2e6a0f1 | 1784 | |
70ca8714 | 1785 | =over 3 |
e2e6a0f1 YO |
1786 | |
1787 | =item Verbs that take an argument | |
1788 | ||
1789 | =over 4 | |
1790 | ||
5d458dd8 | 1791 | =item C<(*PRUNE)> C<(*PRUNE:NAME)> |
f7819f85 | 1792 | X<(*PRUNE)> X<(*PRUNE:NAME)> |
54612592 | 1793 | |
5d458dd8 YO |
1794 | This zero-width pattern prunes the backtracking tree at the current point |
1795 | when backtracked into on failure. Consider the pattern C<A (*PRUNE) B>, | |
1796 | where A and B are complex patterns. Until the C<(*PRUNE)> verb is reached, | |
1797 | A may backtrack as necessary to match. Once it is reached, matching | |
1798 | continues in B, which may also backtrack as necessary; however, should B | |
1799 | not match, then no further backtracking will take place, and the pattern | |
1800 | will fail outright at the current starting position. | |
54612592 YO |
1801 | |
1802 | The following example counts all the possible matching strings in a | |
1803 | pattern (without actually matching any of them). | |
1804 | ||
e2e6a0f1 | 1805 | 'aaab' =~ /a+b?(?{print "$&\n"; $count++})(*FAIL)/; |
54612592 YO |
1806 | print "Count=$count\n"; |
1807 | ||
1808 | which produces: | |
1809 | ||
1810 | aaab | |
1811 | aaa | |
1812 | aa | |
1813 | a | |
1814 | aab | |
1815 | aa | |
1816 | a | |
1817 | ab | |
1818 | a | |
1819 | Count=9 | |
1820 | ||
5d458dd8 | 1821 | If we add a C<(*PRUNE)> before the count like the following |
54612592 | 1822 | |
5d458dd8 | 1823 | 'aaab' =~ /a+b?(*PRUNE)(?{print "$&\n"; $count++})(*FAIL)/; |
54612592 YO |
1824 | print "Count=$count\n"; |
1825 | ||
0b928c2f | 1826 | we prevent backtracking and find the count of the longest matching string |
353c6505 | 1827 | at each matching starting point like so: |
54612592 YO |
1828 | |
1829 | aaab | |
1830 | aab | |
1831 | ab | |
1832 | Count=3 | |
1833 | ||
5d458dd8 | 1834 | Any number of C<(*PRUNE)> assertions may be used in a pattern. |
54612592 | 1835 | |
5d458dd8 YO |
1836 | See also C<< (?>pattern) >> and possessive quantifiers for other ways to |
1837 | control backtracking. In some cases, the use of C<(*PRUNE)> can be | |
1838 | replaced with a C<< (?>pattern) >> with no functional difference; however, | |
1839 | C<(*PRUNE)> can be used to handle cases that cannot be expressed using a | |
1840 | C<< (?>pattern) >> alone. | |
54612592 | 1841 | |
5d458dd8 YO |
1842 | =item C<(*SKIP)> C<(*SKIP:NAME)> |
1843 | X<(*SKIP)> | |
e2e6a0f1 | 1844 | |
5d458dd8 | 1845 | This zero-width pattern is similar to C<(*PRUNE)>, except that on |
e2e6a0f1 | 1846 | failure it also signifies that whatever text that was matched leading up |
5d458dd8 YO |
1847 | to the C<(*SKIP)> pattern being executed cannot be part of I<any> match |
1848 | of this pattern. This effectively means that the regex engine "skips" forward | |
1849 | to this position on failure and tries to match again, (assuming that | |
1850 | there is sufficient room to match). | |
1851 | ||
1852 | The name of the C<(*SKIP:NAME)> pattern has special significance. If a | |
1853 | C<(*MARK:NAME)> was encountered while matching, then it is that position | |
1854 | which is used as the "skip point". If no C<(*MARK)> of that name was | |
1855 | encountered, then the C<(*SKIP)> operator has no effect. When used | |
1856 | without a name the "skip point" is where the match point was when | |
1857 | executing the (*SKIP) pattern. | |
1858 | ||
0b928c2f | 1859 | Compare the following to the examples in C<(*PRUNE)>; note the string |
24b23f37 YO |
1860 | is twice as long: |
1861 | ||
d1fbf752 KW |
1862 | 'aaabaaab' =~ /a+b?(*SKIP)(?{print "$&\n"; $count++})(*FAIL)/; |
1863 | print "Count=$count\n"; | |
24b23f37 YO |
1864 | |
1865 | outputs | |
1866 | ||
1867 | aaab | |
1868 | aaab | |
1869 | Count=2 | |
1870 | ||
5d458dd8 | 1871 | Once the 'aaab' at the start of the string has matched, and the C<(*SKIP)> |
353c6505 | 1872 | executed, the next starting point will be where the cursor was when the |
5d458dd8 YO |
1873 | C<(*SKIP)> was executed. |
1874 | ||
5d458dd8 | 1875 | =item C<(*MARK:NAME)> C<(*:NAME)> |
b16db30f | 1876 | X<(*MARK)> X<(*MARK:NAME)> X<(*:NAME)> |
5d458dd8 YO |
1877 | |
1878 | This zero-width pattern can be used to mark the point reached in a string | |
1879 | when a certain part of the pattern has been successfully matched. This | |
1880 | mark may be given a name. A later C<(*SKIP)> pattern will then skip | |
1881 | forward to that point if backtracked into on failure. Any number of | |
b4222fa9 | 1882 | C<(*MARK)> patterns are allowed, and the NAME portion may be duplicated. |
5d458dd8 YO |
1883 | |
1884 | In addition to interacting with the C<(*SKIP)> pattern, C<(*MARK:NAME)> | |
1885 | can be used to "label" a pattern branch, so that after matching, the | |
1886 | program can determine which branches of the pattern were involved in the | |
1887 | match. | |
1888 | ||
1889 | When a match is successful, the C<$REGMARK> variable will be set to the | |
1890 | name of the most recently executed C<(*MARK:NAME)> that was involved | |
1891 | in the match. | |
1892 | ||
1893 | This can be used to determine which branch of a pattern was matched | |
c27a5cfe | 1894 | without using a separate capture group for each branch, which in turn |
5d458dd8 YO |
1895 | can result in a performance improvement, as perl cannot optimize |
1896 | C</(?:(x)|(y)|(z))/> as efficiently as something like | |
1897 | C</(?:x(*MARK:x)|y(*MARK:y)|z(*MARK:z))/>. | |
1898 | ||
1899 | When a match has failed, and unless another verb has been involved in | |
1900 | failing the match and has provided its own name to use, the C<$REGERROR> | |
1901 | variable will be set to the name of the most recently executed | |
1902 | C<(*MARK:NAME)>. | |
1903 | ||
42ac7c82 | 1904 | See L</(*SKIP)> for more details. |
5d458dd8 | 1905 | |
b62d2d15 YO |
1906 | As a shortcut C<(*MARK:NAME)> can be written C<(*:NAME)>. |
1907 | ||
5d458dd8 YO |
1908 | =item C<(*THEN)> C<(*THEN:NAME)> |
1909 | ||
ac9d8485 | 1910 | This is similar to the "cut group" operator C<::> from Perl 6. Like |
5d458dd8 YO |
1911 | C<(*PRUNE)>, this verb always matches, and when backtracked into on |
1912 | failure, it causes the regex engine to try the next alternation in the | |
ac9d8485 FC |
1913 | innermost enclosing group (capturing or otherwise) that has alternations. |
1914 | The two branches of a C<(?(condition)yes-pattern|no-pattern)> do not | |
1915 | count as an alternation, as far as C<(*THEN)> is concerned. | |
5d458dd8 YO |
1916 | |
1917 | Its name comes from the observation that this operation combined with the | |
1918 | alternation operator (C<|>) can be used to create what is essentially a | |
1919 | pattern-based if/then/else block: | |
1920 | ||
1921 | ( COND (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ ) | |
1922 | ||
1923 | Note that if this operator is used and NOT inside of an alternation then | |
1924 | it acts exactly like the C<(*PRUNE)> operator. | |
1925 | ||
1926 | / A (*PRUNE) B / | |
1927 | ||
1928 | is the same as | |
1929 | ||
1930 | / A (*THEN) B / | |
1931 | ||
1932 | but | |
1933 | ||
25e26d77 | 1934 | / ( A (*THEN) B | C ) / |
5d458dd8 YO |
1935 | |
1936 | is not the same as | |
1937 | ||
25e26d77 | 1938 | / ( A (*PRUNE) B | C ) / |
5d458dd8 YO |
1939 | |
1940 | as after matching the A but failing on the B the C<(*THEN)> verb will | |
1941 | backtrack and try C; but the C<(*PRUNE)> verb will simply fail. | |
24b23f37 | 1942 | |
cbeadc21 JV |
1943 | =back |
1944 | ||
1945 | =item Verbs without an argument | |
1946 | ||
1947 | =over 4 | |
1948 | ||
e2e6a0f1 YO |
1949 | =item C<(*COMMIT)> |
1950 | X<(*COMMIT)> | |
24b23f37 | 1951 | |
241e7389 | 1952 | This is the Perl 6 "commit pattern" C<< <commit> >> or C<:::>. It's a |
5d458dd8 YO |
1953 | zero-width pattern similar to C<(*SKIP)>, except that when backtracked |
1954 | into on failure it causes the match to fail outright. No further attempts | |
1955 | to find a valid match by advancing the start pointer will occur again. | |
1956 | For example, | |
24b23f37 | 1957 | |
d1fbf752 KW |
1958 | 'aaabaaab' =~ /a+b?(*COMMIT)(?{print "$&\n"; $count++})(*FAIL)/; |
1959 | print "Count=$count\n"; | |
24b23f37 YO |
1960 | |
1961 | outputs | |
1962 | ||
1963 | aaab | |
1964 | Count=1 | |
1965 | ||
e2e6a0f1 YO |
1966 | In other words, once the C<(*COMMIT)> has been entered, and if the pattern |
1967 | does not match, the regex engine will not try any further matching on the | |
1968 | rest of the string. | |
c277df42 | 1969 | |
e2e6a0f1 YO |
1970 | =item C<(*FAIL)> C<(*F)> |
1971 | X<(*FAIL)> X<(*F)> | |
9af228c6 | 1972 | |
e2e6a0f1 YO |
1973 | This pattern matches nothing and always fails. It can be used to force the |
1974 | engine to backtrack. It is equivalent to C<(?!)>, but easier to read. In | |
1975 | fact, C<(?!)> gets optimised into C<(*FAIL)> internally. | |
9af228c6 | 1976 | |
e2e6a0f1 | 1977 | It is probably useful only when combined with C<(?{})> or C<(??{})>. |
9af228c6 | 1978 | |
e2e6a0f1 YO |
1979 | =item C<(*ACCEPT)> |
1980 | X<(*ACCEPT)> | |
9af228c6 | 1981 | |
e2e6a0f1 YO |
1982 | This pattern matches nothing and causes the end of successful matching at |
1983 | the point at which the C<(*ACCEPT)> pattern was encountered, regardless of | |
1984 | whether there is actually more to match in the string. When inside of a | |
0d017f4d | 1985 | nested pattern, such as recursion, or in a subpattern dynamically generated |
e2e6a0f1 | 1986 | via C<(??{})>, only the innermost pattern is ended immediately. |
9af228c6 | 1987 | |
c27a5cfe | 1988 | If the C<(*ACCEPT)> is inside of capturing groups then the groups are |
e2e6a0f1 YO |
1989 | marked as ended at the point at which the C<(*ACCEPT)> was encountered. |
1990 | For instance: | |
9af228c6 | 1991 | |
e2e6a0f1 | 1992 | 'AB' =~ /(A (A|B(*ACCEPT)|C) D)(E)/x; |
9af228c6 | 1993 | |
e2e6a0f1 | 1994 | will match, and C<$1> will be C<AB> and C<$2> will be C<B>, C<$3> will not |
0b928c2f | 1995 | be set. If another branch in the inner parentheses was matched, such as in the |
e2e6a0f1 | 1996 | string 'ACDE', then the C<D> and C<E> would have to be matched as well. |
9af228c6 YO |
1997 | |
1998 | =back | |
c277df42 | 1999 | |
a0d0e21e LW |
2000 | =back |
2001 | ||
c07a80fd | 2002 | =head2 Backtracking |
d74e8afc | 2003 | X<backtrack> X<backtracking> |
c07a80fd | 2004 | |
35a734be IZ |
2005 | NOTE: This section presents an abstract approximation of regular |
2006 | expression behavior. For a more rigorous (and complicated) view of | |
2007 | the rules involved in selecting a match among possible alternatives, | |
0d017f4d | 2008 | see L<Combining RE Pieces>. |
35a734be | 2009 | |
c277df42 | 2010 | A fundamental feature of regular expression matching involves the |
5a964f20 | 2011 | notion called I<backtracking>, which is currently used (when needed) |
0d017f4d | 2012 | by all regular non-possessive expression quantifiers, namely C<*>, C<*?>, C<+>, |
9da458fc IZ |
2013 | C<+?>, C<{n,m}>, and C<{n,m}?>. Backtracking is often optimized |
2014 | internally, but the general principle outlined here is valid. | |
c07a80fd | 2015 | |
2016 | For a regular expression to match, the I<entire> regular expression must | |
2017 | match, not just part of it. So if the beginning of a pattern containing a | |
2018 | quantifier succeeds in a way that causes later parts in the pattern to | |
2019 | fail, the matching engine backs up and recalculates the beginning | |
2020 | part--that's why it's called backtracking. | |
2021 | ||
2022 | Here is an example of backtracking: Let's say you want to find the | |
2023 | word following "foo" in the string "Food is on the foo table.": | |
2024 | ||
2025 | $_ = "Food is on the foo table."; | |
2026 | if ( /\b(foo)\s+(\w+)/i ) { | |
f793d64a | 2027 | print "$2 follows $1.\n"; |
c07a80fd | 2028 | } |
2029 | ||
2030 | When the match runs, the first part of the regular expression (C<\b(foo)>) | |
2031 | finds a possible match right at the beginning of the string, and loads up | |
2032 | $1 with "Foo". However, as soon as the matching engine sees that there's | |
2033 | no whitespace following the "Foo" that it had saved in $1, it realizes its | |
68dc0745 | 2034 | mistake and starts over again one character after where it had the |
c07a80fd | 2035 | tentative match. This time it goes all the way until the next occurrence |
2036 | of "foo". The complete regular expression matches this time, and you get | |
2037 | the expected output of "table follows foo." | |
2038 | ||
2039 | Sometimes minimal matching can help a lot. Imagine you'd like to match | |
2040 | everything between "foo" and "bar". Initially, you write something | |
2041 | like this: | |
2042 | ||
2043 | $_ = "The food is under the bar in the barn."; | |
2044 | if ( /foo(.*)bar/ ) { | |
f793d64a | 2045 | print "got <$1>\n"; |
c07a80fd | 2046 | } |
2047 | ||
2048 | Which perhaps unexpectedly yields: | |
2049 | ||
2050 | got <d is under the bar in the > | |
2051 | ||
2052 | That's because C<.*> was greedy, so you get everything between the | |
14218588 | 2053 | I<first> "foo" and the I<last> "bar". Here it's more effective |
c07a80fd | 2054 | to use minimal matching to make sure you get the text between a "foo" |
2055 | and the first "bar" thereafter. | |
2056 | ||
2057 | if ( /foo(.*?)bar/ ) { print "got <$1>\n" } | |
2058 | got <d is under the > | |
2059 | ||
0d017f4d | 2060 | Here's another example. Let's say you'd like to match a number at the end |
b6e13d97 | 2061 | of a string, and you also want to keep the preceding part of the match. |
c07a80fd | 2062 | So you write this: |
2063 | ||
2064 | $_ = "I have 2 numbers: 53147"; | |
f793d64a KW |
2065 | if ( /(.*)(\d*)/ ) { # Wrong! |
2066 | print "Beginning is <$1>, number is <$2>.\n"; | |
c07a80fd | 2067 | } |
2068 | ||
2069 | That won't work at all, because C<.*> was greedy and gobbled up the | |
2070 | whole string. As C<\d*> can match on an empty string the complete | |
2071 | regular expression matched successfully. | |
2072 | ||
8e1088bc | 2073 | Beginning is <I have 2 numbers: 53147>, number is <>. |
c07a80fd | 2074 | |
2075 | Here are some variants, most of which don't work: | |
2076 | ||
2077 | $_ = "I have 2 numbers: 53147"; | |
2078 | @pats = qw{ | |
f793d64a KW |
2079 | (.*)(\d*) |
2080 | (.*)(\d+) | |
2081 | (.*?)(\d*) | |
2082 | (.*?)(\d+) | |
2083 | (.*)(\d+)$ | |
2084 | (.*?)(\d+)$ | |
2085 | (.*)\b(\d+)$ | |
2086 | (.*\D)(\d+)$ | |
c07a80fd | 2087 | }; |
2088 | ||
2089 | for $pat (@pats) { | |
f793d64a KW |
2090 | printf "%-12s ", $pat; |
2091 | if ( /$pat/ ) { | |
2092 | print "<$1> <$2>\n"; | |
2093 | } else { | |
2094 | print "FAIL\n"; | |
2095 | } | |
c07a80fd | 2096 | } |
2097 | ||
2098 | That will print out: | |
2099 | ||
2100 | (.*)(\d*) <I have 2 numbers: 53147> <> | |
2101 | (.*)(\d+) <I have 2 numbers: 5314> <7> | |
2102 | (.*?)(\d*) <> <> | |
2103 | (.*?)(\d+) <I have > <2> | |
2104 | (.*)(\d+)$ <I have 2 numbers: 5314> <7> | |
2105 | (.*?)(\d+)$ <I have 2 numbers: > <53147> | |
2106 | (.*)\b(\d+)$ <I have 2 numbers: > <53147> | |
2107 | (.*\D)(\d+)$ <I have 2 numbers: > <53147> | |
2108 | ||
2109 | As you see, this can be a bit tricky. It's important to realize that a | |
2110 | regular expression is merely a set of assertions that gives a definition | |
2111 | of success. There may be 0, 1, or several different ways that the | |
2112 | definition might succeed against a particular string. And if there are | |
5a964f20 TC |
2113 | multiple ways it might succeed, you need to understand backtracking to |
2114 | know which variety of success you will achieve. | |
c07a80fd | 2115 | |
19799a22 | 2116 | When using look-ahead assertions and negations, this can all get even |
8b19b778 | 2117 | trickier. Imagine you'd like to find a sequence of non-digits not |
c07a80fd | 2118 | followed by "123". You might try to write that as |
2119 | ||
871b0233 | 2120 | $_ = "ABC123"; |
f793d64a KW |
2121 | if ( /^\D*(?!123)/ ) { # Wrong! |
2122 | print "Yup, no 123 in $_\n"; | |
871b0233 | 2123 | } |
c07a80fd | 2124 | |
2125 | But that isn't going to match; at least, not the way you're hoping. It | |
2126 | claims that there is no 123 in the string. Here's a clearer picture of | |
9b9391b2 | 2127 | why that pattern matches, contrary to popular expectations: |
c07a80fd | 2128 | |
4358a253 SS |
2129 | $x = 'ABC123'; |
2130 | $y = 'ABC445'; | |
c07a80fd | 2131 | |
4358a253 SS |
2132 | print "1: got $1\n" if $x =~ /^(ABC)(?!123)/; |
2133 | print "2: got $1\n" if $y =~ /^(ABC)(?!123)/; | |
c07a80fd | 2134 | |
4358a253 SS |
2135 | print "3: got $1\n" if $x =~ /^(\D*)(?!123)/; |
2136 | print "4: got $1\n" if $y =~ /^(\D*)(?!123)/; | |
c07a80fd | 2137 | |
2138 | This prints | |
2139 | ||
2140 | 2: got ABC | |
2141 | 3: got AB | |
2142 | 4: got ABC | |
2143 | ||
5f05dabc | 2144 | You might have expected test 3 to fail because it seems to a more |
c07a80fd | 2145 | general purpose version of test 1. The important difference between |
2146 | them is that test 3 contains a quantifier (C<\D*>) and so can use | |
2147 | backtracking, whereas test 1 will not. What's happening is | |
2148 | that you've asked "Is it true that at the start of $x, following 0 or more | |
5f05dabc | 2149 | non-digits, you have something that's not 123?" If the pattern matcher had |
c07a80fd | 2150 | let C<\D*> expand to "ABC", this would have caused the whole pattern to |
54310121 | 2151 | fail. |
14218588 | 2152 | |
c07a80fd | 2153 | The search engine will initially match C<\D*> with "ABC". Then it will |
0b928c2f | 2154 | try to match C<(?!123)> with "123", which fails. But because |
c07a80fd | 2155 | a quantifier (C<\D*>) has been used in the regular expression, the |
2156 | search engine can backtrack and retry the match differently | |
54310121 | 2157 | in the hope of matching the complete regular expression. |
c07a80fd | 2158 | |
5a964f20 TC |
2159 | The pattern really, I<really> wants to succeed, so it uses the |
2160 | standard pattern back-off-and-retry and lets C<\D*> expand to just "AB" this | |
c07a80fd | 2161 | time. Now there's indeed something following "AB" that is not |
14218588 | 2162 | "123". It's "C123", which suffices. |
c07a80fd | 2163 | |
14218588 GS |
2164 | We can deal with this by using both an assertion and a negation. |
2165 | We'll say that the first part in $1 must be followed both by a digit | |
2166 | and by something that's not "123". Remember that the look-aheads | |
2167 | are zero-width expressions--they only look, but don't consume any | |
2168 | of the string in their match. So rewriting this way produces what | |
c07a80fd | 2169 | you'd expect; that is, case 5 will fail, but case 6 succeeds: |
2170 | ||
4358a253 SS |
2171 | print "5: got $1\n" if $x =~ /^(\D*)(?=\d)(?!123)/; |
2172 | print "6: got $1\n" if $y =~ /^(\D*)(?=\d)(?!123)/; | |
c07a80fd | 2173 | |
2174 | 6: got ABC | |
2175 | ||
5a964f20 | 2176 | In other words, the two zero-width assertions next to each other work as though |
19799a22 | 2177 | they're ANDed together, just as you'd use any built-in assertions: C</^$/> |
c07a80fd | 2178 | matches only if you're at the beginning of the line AND the end of the |
2179 | line simultaneously. The deeper underlying truth is that juxtaposition in | |
2180 | regular expressions always means AND, except when you write an explicit OR | |
2181 | using the vertical bar. C</ab/> means match "a" AND (then) match "b", | |
2182 | although the attempted matches are made at different positions because "a" | |
2183 | is not a zero-width assertion, but a one-width assertion. | |
2184 | ||
0d017f4d | 2185 | B<WARNING>: Particularly complicated regular expressions can take |
14218588 | 2186 | exponential time to solve because of the immense number of possible |
0d017f4d | 2187 | ways they can use backtracking to try for a match. For example, without |
9da458fc IZ |
2188 | internal optimizations done by the regular expression engine, this will |
2189 | take a painfully long time to run: | |
c07a80fd | 2190 | |
e1901655 IZ |
2191 | 'aaaaaaaaaaaa' =~ /((a{0,5}){0,5})*[c]/ |
2192 | ||
2193 | And if you used C<*>'s in the internal groups instead of limiting them | |
2194 | to 0 through 5 matches, then it would take forever--or until you ran | |
2195 | out of stack space. Moreover, these internal optimizations are not | |
2196 | always applicable. For example, if you put C<{0,5}> instead of C<*> | |
2197 | on the external group, no current optimization is applicable, and the | |
2198 | match takes a long time to finish. | |
c07a80fd | 2199 | |
9da458fc IZ |
2200 | A powerful tool for optimizing such beasts is what is known as an |
2201 | "independent group", | |
96090e4f | 2202 | which does not backtrack (see L</C<< (?>pattern) >>>). Note also that |
9da458fc | 2203 | zero-length look-ahead/look-behind assertions will not backtrack to make |
5d458dd8 | 2204 | the tail match, since they are in "logical" context: only |
14218588 | 2205 | whether they match is considered relevant. For an example |
9da458fc | 2206 | where side-effects of look-ahead I<might> have influenced the |
96090e4f | 2207 | following match, see L</C<< (?>pattern) >>>. |
c277df42 | 2208 | |
a0d0e21e | 2209 | =head2 Version 8 Regular Expressions |
d74e8afc | 2210 | X<regular expression, version 8> X<regex, version 8> X<regexp, version 8> |
a0d0e21e | 2211 | |
5a964f20 | 2212 | In case you're not familiar with the "regular" Version 8 regex |
a0d0e21e LW |
2213 | routines, here are the pattern-matching rules not described above. |
2214 | ||
54310121 | 2215 | Any single character matches itself, unless it is a I<metacharacter> |
a0d0e21e | 2216 | with a special meaning described here or above. You can cause |
5a964f20 | 2217 | characters that normally function as metacharacters to be interpreted |
5f05dabc | 2218 | literally by prefixing them with a "\" (e.g., "\." matches a ".", not any |
0d017f4d WL |
2219 | character; "\\" matches a "\"). This escape mechanism is also required |
2220 | for the character used as the pattern delimiter. | |
2221 | ||
2222 | A series of characters matches that series of characters in the target | |
0b928c2f | 2223 | string, so the pattern C<blurfl> would match "blurfl" in the target |
0d017f4d | 2224 | string. |
a0d0e21e LW |
2225 | |
2226 | You can specify a character class, by enclosing a list of characters | |
5d458dd8 | 2227 | in C<[]>, which will match any character from the list. If the |
a0d0e21e | 2228 | first character after the "[" is "^", the class matches any character not |
14218588 | 2229 | in the list. Within a list, the "-" character specifies a |
5a964f20 | 2230 | range, so that C<a-z> represents all characters between "a" and "z", |
8a4f6ac2 GS |
2231 | inclusive. If you want either "-" or "]" itself to be a member of a |
2232 | class, put it at the start of the list (possibly after a "^"), or | |
2233 | escape it with a backslash. "-" is also taken literally when it is | |
2234 | at the end of the list, just before the closing "]". (The | |
84850974 DD |
2235 | following all specify the same class of three characters: C<[-az]>, |
2236 | C<[az-]>, and C<[a\-z]>. All are different from C<[a-z]>, which | |
5d458dd8 YO |
2237 | specifies a class containing twenty-six characters, even on EBCDIC-based |
2238 | character sets.) Also, if you try to use the character | |
2239 | classes C<\w>, C<\W>, C<\s>, C<\S>, C<\d>, or C<\D> as endpoints of | |
2240 | a range, the "-" is understood literally. | |
a0d0e21e | 2241 | |
8ada0baa JH |
2242 | Note also that the whole range idea is rather unportable between |
2243 | character sets--and even within character sets they may cause results | |
2244 | you probably didn't expect. A sound principle is to use only ranges | |
0d017f4d | 2245 | that begin from and end at either alphabetics of equal case ([a-e], |
8ada0baa JH |
2246 | [A-E]), or digits ([0-9]). Anything else is unsafe. If in doubt, |
2247 | spell out the character sets in full. | |
2248 | ||
54310121 | 2249 | Characters may be specified using a metacharacter syntax much like that |
a0d0e21e LW |
2250 | used in C: "\n" matches a newline, "\t" a tab, "\r" a carriage return, |
2251 | "\f" a form feed, etc. More generally, \I<nnn>, where I<nnn> is a string | |
dc0d9c48 | 2252 | of three octal digits, matches the character whose coded character set value |
5d458dd8 | 2253 | is I<nnn>. Similarly, \xI<nn>, where I<nn> are hexadecimal digits, |
dc0d9c48 | 2254 | matches the character whose ordinal is I<nn>. The expression \cI<x> |
5d458dd8 | 2255 | matches the character control-I<x>. Finally, the "." metacharacter |
fb55449c | 2256 | matches any character except "\n" (unless you use C</s>). |
a0d0e21e LW |
2257 | |
2258 | You can specify a series of alternatives for a pattern using "|" to | |
2259 | separate them, so that C<fee|fie|foe> will match any of "fee", "fie", | |
5a964f20 | 2260 | or "foe" in the target string (as would C<f(e|i|o)e>). The |
a0d0e21e | 2261 | first alternative includes everything from the last pattern delimiter |
0b928c2f | 2262 | ("(", "(?:", etc. or the beginning of the pattern) up to the first "|", and |
a0d0e21e | 2263 | the last alternative contains everything from the last "|" to the next |
0b928c2f | 2264 | closing pattern delimiter. That's why it's common practice to include |
14218588 | 2265 | alternatives in parentheses: to minimize confusion about where they |
a3cb178b GS |
2266 | start and end. |
2267 | ||
5a964f20 | 2268 | Alternatives are tried from left to right, so the first |
a3cb178b GS |
2269 | alternative found for which the entire expression matches, is the one that |
2270 | is chosen. This means that alternatives are not necessarily greedy. For | |
628afcb5 | 2271 | example: when matching C<foo|foot> against "barefoot", only the "foo" |
a3cb178b GS |
2272 | part will match, as that is the first alternative tried, and it successfully |
2273 | matches the target string. (This might not seem important, but it is | |
2274 | important when you are capturing matched text using parentheses.) | |
2275 | ||
5a964f20 | 2276 | Also remember that "|" is interpreted as a literal within square brackets, |
a3cb178b | 2277 | so if you write C<[fee|fie|foe]> you're really only matching C<[feio|]>. |
a0d0e21e | 2278 | |
14218588 GS |
2279 | Within a pattern, you may designate subpatterns for later reference |
2280 | by enclosing them in parentheses, and you may refer back to the | |
2281 | I<n>th subpattern later in the pattern using the metacharacter | |
0b928c2f | 2282 | \I<n> or \gI<n>. Subpatterns are numbered based on the left to right order |
14218588 GS |
2283 | of their opening parenthesis. A backreference matches whatever |
2284 | actually matched the subpattern in the string being examined, not | |
d8b950dc | 2285 | the rules for that subpattern. Therefore, C<(0|0x)\d*\s\g1\d*> will |
14218588 GS |
2286 | match "0x1234 0x4321", but not "0x1234 01234", because subpattern |
2287 | 1 matched "0x", even though the rule C<0|0x> could potentially match | |
2288 | the leading 0 in the second number. | |
cb1a09d0 | 2289 | |
0d017f4d | 2290 | =head2 Warning on \1 Instead of $1 |
cb1a09d0 | 2291 | |
5a964f20 | 2292 | Some people get too used to writing things like: |
cb1a09d0 AD |
2293 | |
2294 | $pattern =~ s/(\W)/\\\1/g; | |
2295 | ||
3ff1c45a KW |
2296 | This is grandfathered (for \1 to \9) for the RHS of a substitute to avoid |
2297 | shocking the | |
cb1a09d0 | 2298 | B<sed> addicts, but it's a dirty habit to get into. That's because in |
d1be9408 | 2299 | PerlThink, the righthand side of an C<s///> is a double-quoted string. C<\1> in |
cb1a09d0 AD |
2300 | the usual double-quoted string means a control-A. The customary Unix |
2301 | meaning of C<\1> is kludged in for C<s///>. However, if you get into the habit | |
2302 | of doing that, you get yourself into trouble if you then add an C</e> | |
2303 | modifier. | |
2304 | ||
f793d64a | 2305 | s/(\d+)/ \1 + 1 /eg; # causes warning under -w |
cb1a09d0 AD |
2306 | |
2307 | Or if you try to do | |
2308 | ||
2309 | s/(\d+)/\1000/; | |
2310 | ||
2311 | You can't disambiguate that by saying C<\{1}000>, whereas you can fix it with | |
14218588 | 2312 | C<${1}000>. The operation of interpolation should not be confused |
cb1a09d0 AD |
2313 | with the operation of matching a backreference. Certainly they mean two |
2314 | different things on the I<left> side of the C<s///>. | |
9fa51da4 | 2315 | |
0d017f4d | 2316 | =head2 Repeated Patterns Matching a Zero-length Substring |
c84d73f1 | 2317 | |
19799a22 | 2318 | B<WARNING>: Difficult material (and prose) ahead. This section needs a rewrite. |
c84d73f1 IZ |
2319 | |
2320 | Regular expressions provide a terse and powerful programming language. As | |
2321 | with most other power tools, power comes together with the ability | |
2322 | to wreak havoc. | |
2323 | ||
2324 | A common abuse of this power stems from the ability to make infinite | |
628afcb5 | 2325 | loops using regular expressions, with something as innocuous as: |
c84d73f1 IZ |
2326 | |
2327 | 'foo' =~ m{ ( o? )* }x; | |
2328 | ||
0d017f4d | 2329 | The C<o?> matches at the beginning of C<'foo'>, and since the position |
c84d73f1 | 2330 | in the string is not moved by the match, C<o?> would match again and again |
527e91da | 2331 | because of the C<*> quantifier. Another common way to create a similar cycle |
c84d73f1 IZ |
2332 | is with the looping modifier C<//g>: |
2333 | ||
2334 | @matches = ( 'foo' =~ m{ o? }xg ); | |
2335 | ||
2336 | or | |
2337 | ||
2338 | print "match: <$&>\n" while 'foo' =~ m{ o? }xg; | |
2339 | ||
2340 | or the loop implied by split(). | |
2341 | ||
2342 | However, long experience has shown that many programming tasks may | |
14218588 GS |
2343 | be significantly simplified by using repeated subexpressions that |
2344 | may match zero-length substrings. Here's a simple example being: | |
c84d73f1 | 2345 | |
d1fbf752 | 2346 | @chars = split //, $string; # // is not magic in split |
c84d73f1 IZ |
2347 | ($whitewashed = $string) =~ s/()/ /g; # parens avoid magic s// / |
2348 | ||
9da458fc | 2349 | Thus Perl allows such constructs, by I<forcefully breaking |
c84d73f1 | 2350 | the infinite loop>. The rules for this are different for lower-level |
527e91da | 2351 | loops given by the greedy quantifiers C<*+{}>, and for higher-level |
c84d73f1 IZ |
2352 | ones like the C</g> modifier or split() operator. |
2353 | ||
19799a22 GS |
2354 | The lower-level loops are I<interrupted> (that is, the loop is |
2355 | broken) when Perl detects that a repeated expression matched a | |
2356 | zero-length substring. Thus | |
c84d73f1 IZ |
2357 | |
2358 | m{ (?: NON_ZERO_LENGTH | ZERO_LENGTH )* }x; | |
2359 | ||
5d458dd8 | 2360 | is made equivalent to |
c84d73f1 | 2361 | |
0b928c2f FC |
2362 | m{ (?: NON_ZERO_LENGTH )* (?: ZERO_LENGTH )? }x; |
2363 | ||
2364 | For example, this program | |
2365 | ||
2366 | #!perl -l | |
2367 | "aaaaab" =~ / | |
2368 | (?: | |
2369 | a # non-zero | |
2370 | | # or | |
2371 | (?{print "hello"}) # print hello whenever this | |
2372 | # branch is tried | |
2373 | (?=(b)) # zero-width assertion | |
2374 | )* # any number of times | |
2375 | /x; | |
2376 | print $&; | |
2377 | print $1; | |
c84d73f1 | 2378 | |
0b928c2f FC |
2379 | prints |
2380 | ||
2381 | hello | |
2382 | aaaaa | |
2383 | b | |
2384 | ||
2385 | Notice that "hello" is only printed once, as when Perl sees that the sixth | |
2386 | iteration of the outermost C<(?:)*> matches a zero-length string, it stops | |
2387 | the C<*>. | |
2388 | ||
2389 | The higher-level loops preserve an additional state between iterations: | |
5d458dd8 | 2390 | whether the last match was zero-length. To break the loop, the following |
c84d73f1 | 2391 | match after a zero-length match is prohibited to have a length of zero. |
5d458dd8 | 2392 | This prohibition interacts with backtracking (see L<"Backtracking">), |
c84d73f1 IZ |
2393 | and so the I<second best> match is chosen if the I<best> match is of |
2394 | zero length. | |
2395 | ||
19799a22 | 2396 | For example: |
c84d73f1 IZ |
2397 | |
2398 | $_ = 'bar'; | |
2399 | s/\w??/<$&>/g; | |
2400 | ||
20fb949f | 2401 | results in C<< <><b><><a><><r><> >>. At each position of the string the best |
5d458dd8 | 2402 | match given by non-greedy C<??> is the zero-length match, and the I<second |
c84d73f1 IZ |
2403 | best> match is what is matched by C<\w>. Thus zero-length matches |
2404 | alternate with one-character-long matches. | |
2405 | ||
5d458dd8 | 2406 | Similarly, for repeated C<m/()/g> the second-best match is the match at the |
c84d73f1 IZ |
2407 | position one notch further in the string. |
2408 | ||
19799a22 | 2409 | The additional state of being I<matched with zero-length> is associated with |
c84d73f1 | 2410 | the matched string, and is reset by each assignment to pos(). |
9da458fc IZ |
2411 | Zero-length matches at the end of the previous match are ignored |
2412 | during C<split>. | |
c84d73f1 | 2413 | |
0d017f4d | 2414 | =head2 Combining RE Pieces |
35a734be IZ |
2415 | |
2416 | Each of the elementary pieces of regular expressions which were described | |
2417 | before (such as C<ab> or C<\Z>) could match at most one substring | |
2418 | at the given position of the input string. However, in a typical regular | |
2419 | expression these elementary pieces are combined into more complicated | |
0b928c2f | 2420 | patterns using combining operators C<ST>, C<S|T>, C<S*> etc. |
35a734be IZ |
2421 | (in these examples C<S> and C<T> are regular subexpressions). |
2422 | ||
2423 | Such combinations can include alternatives, leading to a problem of choice: | |
2424 | if we match a regular expression C<a|ab> against C<"abc">, will it match | |
2425 | substring C<"a"> or C<"ab">? One way to describe which substring is | |
2426 | actually matched is the concept of backtracking (see L<"Backtracking">). | |
2427 | However, this description is too low-level and makes you think | |
2428 | in terms of a particular implementation. | |
2429 | ||
2430 | Another description starts with notions of "better"/"worse". All the | |
2431 | substrings which may be matched by the given regular expression can be | |
2432 | sorted from the "best" match to the "worst" match, and it is the "best" | |
2433 | match which is chosen. This substitutes the question of "what is chosen?" | |
2434 | by the question of "which matches are better, and which are worse?". | |
2435 | ||
2436 | Again, for elementary pieces there is no such question, since at most | |
2437 | one match at a given position is possible. This section describes the | |
2438 | notion of better/worse for combining operators. In the description | |
2439 | below C<S> and C<T> are regular subexpressions. | |
2440 | ||
13a2d996 | 2441 | =over 4 |
35a734be IZ |
2442 | |
2443 | =item C<ST> | |
2444 | ||
2445 | Consider two possible matches, C<AB> and C<A'B'>, C<A> and C<A'> are | |
2446 | substrings which can be matched by C<S>, C<B> and C<B'> are substrings | |
5d458dd8 | 2447 | which can be matched by C<T>. |
35a734be | 2448 | |
0b928c2f | 2449 | If C<A> is a better match for C<S> than C<A'>, C<AB> is a better |
35a734be IZ |
2450 | match than C<A'B'>. |
2451 | ||
2452 | If C<A> and C<A'> coincide: C<AB> is a better match than C<AB'> if | |
0b928c2f | 2453 | C<B> is a better match for C<T> than C<B'>. |
35a734be IZ |
2454 | |
2455 | =item C<S|T> | |
2456 | ||
2457 | When C<S> can match, it is a better match than when only C<T> can match. | |
2458 | ||
2459 | Ordering of two matches for C<S> is the same as for C<S>. Similar for | |
2460 | two matches for C<T>. | |
2461 | ||
2462 | =item C<S{REPEAT_COUNT}> | |
2463 | ||
2464 | Matches as C<SSS...S> (repeated as many times as necessary). | |
2465 | ||
2466 | =item C<S{min,max}> | |
2467 | ||
2468 | Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>. | |
2469 | ||
2470 | =item C<S{min,max}?> | |
2471 | ||
2472 | Matches as C<S{min}|S{min+1}|...|S{max-1}|S{max}>. | |
2473 | ||
2474 | =item C<S?>, C<S*>, C<S+> | |
2475 | ||
2476 | Same as C<S{0,1}>, C<S{0,BIG_NUMBER}>, C<S{1,BIG_NUMBER}> respectively. | |
2477 | ||
2478 | =item C<S??>, C<S*?>, C<S+?> | |
2479 | ||
2480 | Same as C<S{0,1}?>, C<S{0,BIG_NUMBER}?>, C<S{1,BIG_NUMBER}?> respectively. | |
2481 | ||
c47ff5f1 | 2482 | =item C<< (?>S) >> |
35a734be IZ |
2483 | |
2484 | Matches the best match for C<S> and only that. | |
2485 | ||
2486 | =item C<(?=S)>, C<(?<=S)> | |
2487 | ||
2488 | Only the best match for C<S> is considered. (This is important only if | |
2489 | C<S> has capturing parentheses, and backreferences are used somewhere | |
2490 | else in the whole regular expression.) | |
2491 | ||
2492 | =item C<(?!S)>, C<(?<!S)> | |
2493 | ||
2494 | For this grouping operator there is no need to describe the ordering, since | |
2495 | only whether or not C<S> can match is important. | |
2496 | ||
93f313ef | 2497 | =item C<(??{ EXPR })>, C<(?I<PARNO>)> |
35a734be IZ |
2498 | |
2499 | The ordering is the same as for the regular expression which is | |
93f313ef | 2500 | the result of EXPR, or the pattern contained by capture group I<PARNO>. |
35a734be IZ |
2501 | |
2502 | =item C<(?(condition)yes-pattern|no-pattern)> | |
2503 | ||
2504 | Recall that which of C<yes-pattern> or C<no-pattern> actually matches is | |
2505 | already determined. The ordering of the matches is the same as for the | |
2506 | chosen subexpression. | |
2507 | ||
2508 | =back | |
2509 | ||
2510 | The above recipes describe the ordering of matches I<at a given position>. | |
2511 | One more rule is needed to understand how a match is determined for the | |
2512 | whole regular expression: a match at an earlier position is always better | |
2513 | than a match at a later position. | |
2514 | ||
0d017f4d | 2515 | =head2 Creating Custom RE Engines |
c84d73f1 | 2516 | |
0b928c2f FC |
2517 | As of Perl 5.10.0, one can create custom regular expression engines. This |
2518 | is not for the faint of heart, as they have to plug in at the C level. See | |
2519 | L<perlreapi> for more details. | |
2520 | ||
2521 | As an alternative, overloaded constants (see L<overload>) provide a simple | |
2522 | way to extend the functionality of the RE engine, by substituting one | |
2523 | pattern for another. | |
c84d73f1 IZ |
2524 | |
2525 | Suppose that we want to enable a new RE escape-sequence C<\Y|> which | |
0d017f4d | 2526 | matches at a boundary between whitespace characters and non-whitespace |
c84d73f1 IZ |
2527 | characters. Note that C<(?=\S)(?<!\S)|(?!\S)(?<=\S)> matches exactly |
2528 | at these positions, so we want to have each C<\Y|> in the place of the | |
2529 | more complicated version. We can create a module C<customre> to do | |
2530 | this: | |
2531 | ||
2532 | package customre; | |
2533 | use overload; | |
2534 | ||
2535 | sub import { | |
2536 | shift; | |
2537 | die "No argument to customre::import allowed" if @_; | |
2538 | overload::constant 'qr' => \&convert; | |
2539 | } | |
2540 | ||
2541 | sub invalid { die "/$_[0]/: invalid escape '\\$_[1]'"} | |
2542 | ||
580a9fe1 RGS |
2543 | # We must also take care of not escaping the legitimate \\Y| |
2544 | # sequence, hence the presence of '\\' in the conversion rules. | |
5d458dd8 | 2545 | my %rules = ( '\\' => '\\\\', |
f793d64a | 2546 | 'Y|' => qr/(?=\S)(?<!\S)|(?!\S)(?<=\S)/ ); |
c84d73f1 IZ |
2547 | sub convert { |
2548 | my $re = shift; | |
5d458dd8 | 2549 | $re =~ s{ |
c84d73f1 IZ |
2550 | \\ ( \\ | Y . ) |
2551 | } | |
5d458dd8 | 2552 | { $rules{$1} or invalid($re,$1) }sgex; |
c84d73f1 IZ |
2553 | return $re; |
2554 | } | |
2555 | ||
2556 | Now C<use customre> enables the new escape in constant regular | |
2557 | expressions, i.e., those without any runtime variable interpolations. | |
2558 | As documented in L<overload>, this conversion will work only over | |
2559 | literal parts of regular expressions. For C<\Y|$re\Y|> the variable | |
2560 | part of this regular expression needs to be converted explicitly | |
2561 | (but only if the special meaning of C<\Y|> should be enabled inside $re): | |
2562 | ||
2563 | use customre; | |
2564 | $re = <>; | |
2565 | chomp $re; | |
2566 | $re = customre::convert $re; | |
2567 | /\Y|$re\Y|/; | |
2568 | ||
83f32aba RS |
2569 | =head2 Embedded Code Execution Frequency |
2570 | ||
2571 | The exact rules for how often (??{}) and (?{}) are executed in a pattern | |
2572 | are unspecified. In the case of a successful match you can assume that | |
2573 | they DWIM and will be executed in left to right order the appropriate | |
2574 | number of times in the accepting path of the pattern as would any other | |
2575 | meta-pattern. How non-accepting pathways and match failures affect the | |
2576 | number of times a pattern is executed is specifically unspecified and | |
2577 | may vary depending on what optimizations can be applied to the pattern | |
2578 | and is likely to change from version to version. | |
2579 | ||
2580 | For instance in | |
2581 | ||
2582 | "aaabcdeeeee"=~/a(?{print "a"})b(?{print "b"})cde/; | |
2583 | ||
2584 | the exact number of times "a" or "b" are printed out is unspecified for | |
2585 | failure, but you may assume they will be printed at least once during | |
2586 | a successful match, additionally you may assume that if "b" is printed, | |
2587 | it will be preceded by at least one "a". | |
2588 | ||
2589 | In the case of branching constructs like the following: | |
2590 | ||
2591 | /a(b|(?{ print "a" }))c(?{ print "c" })/; | |
2592 | ||
2593 | you can assume that the input "ac" will output "ac", and that "abc" | |
2594 | will output only "c". | |
2595 | ||
2596 | When embedded code is quantified, successful matches will call the | |
2597 | code once for each matched iteration of the quantifier. For | |
2598 | example: | |
2599 | ||
2600 | "good" =~ /g(?:o(?{print "o"}))*d/; | |
2601 | ||
2602 | will output "o" twice. | |
2603 | ||
0b928c2f | 2604 | =head2 PCRE/Python Support |
1f1031fe | 2605 | |
0b928c2f | 2606 | As of Perl 5.10.0, Perl supports several Python/PCRE-specific extensions |
1f1031fe | 2607 | to the regex syntax. While Perl programmers are encouraged to use the |
0b928c2f | 2608 | Perl-specific syntax, the following are also accepted: |
1f1031fe YO |
2609 | |
2610 | =over 4 | |
2611 | ||
ae5648b3 | 2612 | =item C<< (?PE<lt>NAMEE<gt>pattern) >> |
1f1031fe | 2613 | |
c27a5cfe | 2614 | Define a named capture group. Equivalent to C<< (?<NAME>pattern) >>. |
1f1031fe YO |
2615 | |
2616 | =item C<< (?P=NAME) >> | |
2617 | ||
c27a5cfe | 2618 | Backreference to a named capture group. Equivalent to C<< \g{NAME} >>. |
1f1031fe YO |
2619 | |
2620 | =item C<< (?P>NAME) >> | |
2621 | ||
c27a5cfe | 2622 | Subroutine call to a named capture group. Equivalent to C<< (?&NAME) >>. |
1f1031fe | 2623 | |
ee9b8eae | 2624 | =back |
1f1031fe | 2625 | |
19799a22 GS |
2626 | =head1 BUGS |
2627 | ||
88c9975e KW |
2628 | Many regular expression constructs don't work on EBCDIC platforms. |
2629 | ||
ed7efc79 KW |
2630 | There are a number of issues with regard to case-insensitive matching |
2631 | in Unicode rules. See C<i> under L</Modifiers> above. | |
2632 | ||
9da458fc IZ |
2633 | This document varies from difficult to understand to completely |
2634 | and utterly opaque. The wandering prose riddled with jargon is | |
2635 | hard to fathom in several places. | |
2636 | ||
2637 | This document needs a rewrite that separates the tutorial content | |
2638 | from the reference content. | |
19799a22 GS |
2639 | |
2640 | =head1 SEE ALSO | |
9fa51da4 | 2641 | |
91e0c79e MJD |
2642 | L<perlrequick>. |
2643 | ||
2644 | L<perlretut>. | |
2645 | ||
9b599b2a GS |
2646 | L<perlop/"Regexp Quote-Like Operators">. |
2647 | ||
1e66bd83 PP |
2648 | L<perlop/"Gory details of parsing quoted constructs">. |
2649 | ||
14218588 GS |
2650 | L<perlfaq6>. |
2651 | ||
9b599b2a GS |
2652 | L<perlfunc/pos>. |
2653 | ||
2654 | L<perllocale>. | |
2655 | ||
fb55449c JH |
2656 | L<perlebcdic>. |
2657 | ||
14218588 GS |
2658 | I<Mastering Regular Expressions> by Jeffrey Friedl, published |
2659 | by O'Reilly and Associates. |