Commit | Line | Data |
a0d0e21e |
1 | =head1 NAME |
2 | |
3 | perlre - Perl regular expressions |
4 | |
5 | =head1 DESCRIPTION |
6 | |
91e0c79e |
7 | This page describes the syntax of regular expressions in Perl. |
8 | |
9 | if you haven't used regular expressions before, a quick-start |
10 | introduction is available in L<perlrequick>, and a longer tutorial |
11 | introduction is available in L<perlretut>. |
12 | |
13 | For reference on how regular expressions are used in matching |
14 | operations, plus various examples of the same, see discussions of |
15 | C<m//>, C<s///>, C<qr//> and C<??> in L<perlop/"Regexp Quote-Like |
16 | Operators">. |
cb1a09d0 |
17 | |
19799a22 |
18 | Matching operations can have various modifiers. Modifiers |
5a964f20 |
19 | that relate to the interpretation of the regular expression inside |
19799a22 |
20 | are listed below. Modifiers that alter the way a regular expression |
21 | is used by Perl are detailed in L<perlop/"Regexp Quote-Like Operators"> and |
1e66bd83 |
22 | L<perlop/"Gory details of parsing quoted constructs">. |
a0d0e21e |
23 | |
55497cff |
24 | =over 4 |
25 | |
26 | =item i |
27 | |
28 | Do case-insensitive pattern matching. |
29 | |
a034a98d |
30 | If C<use locale> is in effect, the case map is taken from the current |
31 | locale. See L<perllocale>. |
32 | |
54310121 |
33 | =item m |
55497cff |
34 | |
35 | Treat string as multiple lines. That is, change "^" and "$" from matching |
14218588 |
36 | the start or end of the string to matching the start or end of any |
7f761169 |
37 | line anywhere within the string. |
55497cff |
38 | |
54310121 |
39 | =item s |
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 | |
19799a22 |
44 | The C</s> and C</m> modifiers both override the C<$*> setting. That |
45 | is, no matter what C<$*> contains, C</s> without C</m> will force |
46 | "^" to match only at the beginning of the string and "$" to match |
47 | only at the end (or just before a newline at the end) of the string. |
48 | Together, as /ms, they let the "." match any character whatsoever, |
fb55449c |
49 | while still allowing "^" and "$" to match, respectively, just after |
19799a22 |
50 | and just before newlines within the string. |
7b8d334a |
51 | |
54310121 |
52 | =item x |
55497cff |
53 | |
54 | Extend your pattern's legibility by permitting whitespace and comments. |
55 | |
56 | =back |
a0d0e21e |
57 | |
58 | These are usually written as "the C</x> modifier", even though the delimiter |
14218588 |
59 | in question might not really be a slash. Any of these |
a0d0e21e |
60 | modifiers may also be embedded within the regular expression itself using |
14218588 |
61 | the C<(?...)> construct. See below. |
a0d0e21e |
62 | |
4633a7c4 |
63 | The C</x> modifier itself needs a little more explanation. It tells |
55497cff |
64 | the regular expression parser to ignore whitespace that is neither |
65 | backslashed nor within a character class. You can use this to break up |
4633a7c4 |
66 | your regular expression into (slightly) more readable parts. The C<#> |
54310121 |
67 | character is also treated as a metacharacter introducing a comment, |
55497cff |
68 | just as in ordinary Perl code. This also means that if you want real |
14218588 |
69 | whitespace or C<#> characters in the pattern (outside a character |
5a964f20 |
70 | class, where they are unaffected by C</x>), that you'll either have to |
55497cff |
71 | escape them or encode them using octal or hex escapes. Taken together, |
72 | these features go a long way towards making Perl's regular expressions |
0c815be9 |
73 | more readable. Note that you have to be careful not to include the |
74 | pattern delimiter in the comment--perl has no way of knowing you did |
5a964f20 |
75 | not intend to close the pattern early. See the C-comment deletion code |
0c815be9 |
76 | in L<perlop>. |
a0d0e21e |
77 | |
78 | =head2 Regular Expressions |
79 | |
19799a22 |
80 | The patterns used in Perl pattern matching derive from supplied in |
14218588 |
81 | the Version 8 regex routines. (The routines are derived |
19799a22 |
82 | (distantly) from Henry Spencer's freely redistributable reimplementation |
83 | of the V8 routines.) See L<Version 8 Regular Expressions> for |
84 | details. |
a0d0e21e |
85 | |
86 | In particular the following metacharacters have their standard I<egrep>-ish |
87 | meanings: |
88 | |
54310121 |
89 | \ Quote the next metacharacter |
a0d0e21e |
90 | ^ Match the beginning of the line |
91 | . Match any character (except newline) |
c07a80fd |
92 | $ Match the end of the line (or before newline at the end) |
a0d0e21e |
93 | | Alternation |
94 | () Grouping |
95 | [] Character class |
96 | |
14218588 |
97 | By default, the "^" character is guaranteed to match only the |
98 | beginning of the string, the "$" character only the end (or before the |
99 | newline at the end), and Perl does certain optimizations with the |
a0d0e21e |
100 | assumption that the string contains only one line. Embedded newlines |
101 | will not be matched by "^" or "$". You may, however, wish to treat a |
4a6725af |
102 | string as a multi-line buffer, such that the "^" will match after any |
a0d0e21e |
103 | newline within the string, and "$" will match before any newline. At the |
104 | cost of a little more overhead, you can do this by using the /m modifier |
105 | on the pattern match operator. (Older programs did this by setting C<$*>, |
5f05dabc |
106 | but this practice is now deprecated.) |
a0d0e21e |
107 | |
14218588 |
108 | To simplify multi-line substitutions, the "." character never matches a |
55497cff |
109 | newline unless you use the C</s> modifier, which in effect tells Perl to pretend |
a0d0e21e |
110 | the string is a single line--even if it isn't. The C</s> modifier also |
111 | overrides the setting of C<$*>, in case you have some (badly behaved) older |
112 | code that sets it in another module. |
113 | |
114 | The following standard quantifiers are recognized: |
115 | |
116 | * Match 0 or more times |
117 | + Match 1 or more times |
118 | ? Match 1 or 0 times |
119 | {n} Match exactly n times |
120 | {n,} Match at least n times |
121 | {n,m} Match at least n but not more than m times |
122 | |
123 | (If a curly bracket occurs in any other context, it is treated |
b975c076 |
124 | as a regular character. In particular, the lower bound |
125 | is not optional.) The "*" modifier is equivalent to C<{0,}>, the "+" |
25f94b33 |
126 | modifier to C<{1,}>, and the "?" modifier to C<{0,1}>. n and m are limited |
9c79236d |
127 | to integral values less than a preset limit defined when perl is built. |
128 | This is usually 32766 on the most common platforms. The actual limit can |
129 | be seen in the error message generated by code such as this: |
130 | |
820475bd |
131 | $_ **= $_ , / {$_} / for 2 .. 42; |
a0d0e21e |
132 | |
54310121 |
133 | By default, a quantified subpattern is "greedy", that is, it will match as |
134 | many times as possible (given a particular starting location) while still |
135 | allowing the rest of the pattern to match. If you want it to match the |
136 | minimum number of times possible, follow the quantifier with a "?". Note |
137 | that the meanings don't change, just the "greediness": |
a0d0e21e |
138 | |
139 | *? Match 0 or more times |
140 | +? Match 1 or more times |
141 | ?? Match 0 or 1 time |
142 | {n}? Match exactly n times |
143 | {n,}? Match at least n times |
144 | {n,m}? Match at least n but not more than m times |
145 | |
5f05dabc |
146 | Because patterns are processed as double quoted strings, the following |
a0d0e21e |
147 | also work: |
148 | |
0f36ee90 |
149 | \t tab (HT, TAB) |
150 | \n newline (LF, NL) |
151 | \r return (CR) |
152 | \f form feed (FF) |
153 | \a alarm (bell) (BEL) |
154 | \e escape (think troff) (ESC) |
cb1a09d0 |
155 | \033 octal char (think of a PDP-11) |
156 | \x1B hex char |
a0ed51b3 |
157 | \x{263a} wide hex char (Unicode SMILEY) |
a0d0e21e |
158 | \c[ control char |
4a2d328f |
159 | \N{name} named char |
cb1a09d0 |
160 | \l lowercase next char (think vi) |
161 | \u uppercase next char (think vi) |
162 | \L lowercase till \E (think vi) |
163 | \U uppercase till \E (think vi) |
164 | \E end case modification (think vi) |
5a964f20 |
165 | \Q quote (disable) pattern metacharacters till \E |
a0d0e21e |
166 | |
a034a98d |
167 | If C<use locale> is in effect, the case map used by C<\l>, C<\L>, C<\u> |
423cee85 |
168 | and C<\U> is taken from the current locale. See L<perllocale>. For |
4a2d328f |
169 | documentation of C<\N{name}>, see L<charnames>. |
a034a98d |
170 | |
1d2dff63 |
171 | You cannot include a literal C<$> or C<@> within a C<\Q> sequence. |
172 | An unescaped C<$> or C<@> interpolates the corresponding variable, |
173 | while escaping will cause the literal string C<\$> to be matched. |
174 | You'll need to write something like C<m/\Quser\E\@\Qhost/>. |
175 | |
a0d0e21e |
176 | In addition, Perl defines the following: |
177 | |
178 | \w Match a "word" character (alphanumeric plus "_") |
36bbe248 |
179 | \W Match a non-"word" character |
a0d0e21e |
180 | \s Match a whitespace character |
181 | \S Match a non-whitespace character |
182 | \d Match a digit character |
183 | \D Match a non-digit character |
a0ed51b3 |
184 | \pP Match P, named property. Use \p{Prop} for longer names. |
185 | \PP Match non-P |
f244e06d |
186 | \X Match eXtended Unicode "combining character sequence", |
07698885 |
187 | equivalent to (?:\PM\pM*) |
72ff2908 |
188 | \C Match a single C char (octet) even under Unicode. |
07698885 |
189 | NOTE: breaks up characters into their UTF-8 bytes, |
72ff2908 |
190 | so you may end up with malformed pieces of UTF-8. |
a0d0e21e |
191 | |
08ce8fc6 |
192 | A C<\w> matches a single alphanumeric character (an alphabetic |
193 | character, or a decimal digit) or C<_>, not a whole word. Use C<\w+> |
194 | to match a string of Perl-identifier characters (which isn't the same |
195 | as matching an English word). If C<use locale> is in effect, the list |
196 | of alphabetic characters generated by C<\w> is taken from the current |
197 | locale. See L<perllocale>. You may use C<\w>, C<\W>, C<\s>, C<\S>, |
1209ba90 |
198 | C<\d>, and C<\D> within character classes, but if you try to use them |
08ce8fc6 |
199 | as endpoints of a range, that's not a range, the "-" is understood |
200 | literally. If Unicode is in effect, C<\s> matches also "\x{85}", |
201 | "\x{2028}, and "\x{2029}", see L<perlunicode> for more details about |
491fd90a |
202 | C<\pP>, C<\PP>, and C<\X>, and L<perluniintro> about Unicode in general. |
203 | You can define your own C<\p> and C<\P> propreties, see L<perlunicode>. |
a0d0e21e |
204 | |
b8c5462f |
205 | The POSIX character class syntax |
206 | |
820475bd |
207 | [:class:] |
b8c5462f |
208 | |
26b44a0a |
209 | is also available. The available classes and their backslash |
210 | equivalents (if available) are as follows: |
b8c5462f |
211 | |
212 | alpha |
213 | alnum |
214 | ascii |
aaa51d5e |
215 | blank [1] |
b8c5462f |
216 | cntrl |
217 | digit \d |
218 | graph |
219 | lower |
220 | print |
221 | punct |
aaa51d5e |
222 | space \s [2] |
b8c5462f |
223 | upper |
aaa51d5e |
224 | word \w [3] |
b8c5462f |
225 | xdigit |
226 | |
07698885 |
227 | =over |
228 | |
229 | =item [1] |
230 | |
231 | A GNU extension equivalent to C<[ \t]>, `all horizontal whitespace'. |
232 | |
233 | =item [2] |
234 | |
235 | Not exactly equivalent to C<\s> since the C<[[:space:]]> includes |
08ce8fc6 |
236 | also the (very rare) `vertical tabulator', "\ck", chr(11). |
07698885 |
237 | |
238 | =item [3] |
239 | |
08ce8fc6 |
240 | A Perl extension, see above. |
07698885 |
241 | |
242 | =back |
aaa51d5e |
243 | |
26b44a0a |
244 | For example use C<[:upper:]> to match all the uppercase characters. |
aaa51d5e |
245 | Note that the C<[]> are part of the C<[::]> construct, not part of the |
246 | whole character class. For example: |
b8c5462f |
247 | |
820475bd |
248 | [01[:alpha:]%] |
b8c5462f |
249 | |
593df60c |
250 | matches zero, one, any alphabetic character, and the percentage sign. |
b8c5462f |
251 | |
72ff2908 |
252 | The following equivalences to Unicode \p{} constructs and equivalent |
253 | backslash character classes (if available), will hold: |
254 | |
255 | [:...:] \p{...} backslash |
b8c5462f |
256 | |
257 | alpha IsAlpha |
258 | alnum IsAlnum |
259 | ascii IsASCII |
aaa51d5e |
260 | blank IsSpace |
b8c5462f |
261 | cntrl IsCntrl |
3bec3564 |
262 | digit IsDigit \d |
b8c5462f |
263 | graph IsGraph |
264 | lower IsLower |
265 | print IsPrint |
266 | punct IsPunct |
267 | space IsSpace |
3bec3564 |
268 | IsSpacePerl \s |
b8c5462f |
269 | upper IsUpper |
270 | word IsWord |
271 | xdigit IsXDigit |
272 | |
26b44a0a |
273 | For example C<[:lower:]> and C<\p{IsLower}> are equivalent. |
b8c5462f |
274 | |
275 | If the C<utf8> pragma is not used but the C<locale> pragma is, the |
aaa51d5e |
276 | classes correlate with the usual isalpha(3) interface (except for |
277 | `word' and `blank'). |
b8c5462f |
278 | |
279 | The assumedly non-obviously named classes are: |
280 | |
281 | =over 4 |
282 | |
283 | =item cntrl |
284 | |
820475bd |
285 | Any control character. Usually characters that don't produce output as |
286 | such but instead control the terminal somehow: for example newline and |
287 | backspace are control characters. All characters with ord() less than |
593df60c |
288 | 32 are most often classified as control characters (assuming ASCII, |
7be5a6cf |
289 | the ISO Latin character sets, and Unicode), as is the character with |
290 | the ord() value of 127 (C<DEL>). |
b8c5462f |
291 | |
292 | =item graph |
293 | |
f1cbbd6e |
294 | Any alphanumeric or punctuation (special) character. |
b8c5462f |
295 | |
296 | =item print |
297 | |
f79b3095 |
298 | Any alphanumeric or punctuation (special) character or the space character. |
b8c5462f |
299 | |
300 | =item punct |
301 | |
f1cbbd6e |
302 | Any punctuation (special) character. |
b8c5462f |
303 | |
304 | =item xdigit |
305 | |
593df60c |
306 | Any hexadecimal digit. Though this may feel silly ([0-9A-Fa-f] would |
820475bd |
307 | work just fine) it is included for completeness. |
b8c5462f |
308 | |
b8c5462f |
309 | =back |
310 | |
311 | You can negate the [::] character classes by prefixing the class name |
312 | with a '^'. This is a Perl extension. For example: |
313 | |
72ff2908 |
314 | POSIX traditional Unicode |
93733859 |
315 | |
316 | [:^digit:] \D \P{IsDigit} |
317 | [:^space:] \S \P{IsSpace} |
318 | [:^word:] \W \P{IsWord} |
b8c5462f |
319 | |
54c18d04 |
320 | Perl respects the POSIX standard in that POSIX character classes are |
321 | only supported within a character class. The POSIX character classes |
322 | [.cc.] and [=cc=] are recognized but B<not> supported and trying to |
323 | use them will cause an error. |
b8c5462f |
324 | |
a0d0e21e |
325 | Perl defines the following zero-width assertions: |
326 | |
327 | \b Match a word boundary |
328 | \B Match a non-(word boundary) |
b85d18e9 |
329 | \A Match only at beginning of string |
330 | \Z Match only at end of string, or before newline at the end |
331 | \z Match only at end of string |
9da458fc |
332 | \G Match only at pos() (e.g. at the end-of-match position |
333 | of prior m//g) |
a0d0e21e |
334 | |
14218588 |
335 | A word boundary (C<\b>) is a spot between two characters |
19799a22 |
336 | that has a C<\w> on one side of it and a C<\W> on the other side |
337 | of it (in either order), counting the imaginary characters off the |
338 | beginning and end of the string as matching a C<\W>. (Within |
339 | character classes C<\b> represents backspace rather than a word |
340 | boundary, just as it normally does in any double-quoted string.) |
341 | The C<\A> and C<\Z> are just like "^" and "$", except that they |
342 | won't match multiple times when the C</m> modifier is used, while |
343 | "^" and "$" will match at every internal line boundary. To match |
344 | the actual end of the string and not ignore an optional trailing |
345 | newline, use C<\z>. |
346 | |
347 | The C<\G> assertion can be used to chain global matches (using |
348 | C<m//g>), as described in L<perlop/"Regexp Quote-Like Operators">. |
349 | It is also useful when writing C<lex>-like scanners, when you have |
350 | several patterns that you want to match against consequent substrings |
351 | of your string, see the previous reference. The actual location |
352 | where C<\G> will match can also be influenced by using C<pos()> as |
25cf8c22 |
353 | an lvalue: see L<perlfunc/pos>. Currently C<\G> is only fully |
354 | supported when anchored to the start of the pattern; while it |
355 | is permitted to use it elsewhere, as in C</(?<=\G..)./g>, some |
356 | such uses (C</.\G/g>, for example) currently cause problems, and |
357 | it is recommended that you avoid such usage for now. |
c47ff5f1 |
358 | |
14218588 |
359 | The bracketing construct C<( ... )> creates capture buffers. To |
c47ff5f1 |
360 | refer to the digit'th buffer use \<digit> within the |
14218588 |
361 | match. Outside the match use "$" instead of "\". (The |
c47ff5f1 |
362 | \<digit> notation works in certain circumstances outside |
14218588 |
363 | the match. See the warning below about \1 vs $1 for details.) |
364 | Referring back to another part of the match is called a |
365 | I<backreference>. |
366 | |
367 | There is no limit to the number of captured substrings that you may |
368 | use. However Perl also uses \10, \11, etc. as aliases for \010, |
fb55449c |
369 | \011, etc. (Recall that 0 means octal, so \011 is the character at |
370 | number 9 in your coded character set; which would be the 10th character, |
371 | a horizontal tab under ASCII.) Perl resolves this |
372 | ambiguity by interpreting \10 as a backreference only if at least 10 |
373 | left parentheses have opened before it. Likewise \11 is a |
374 | backreference only if at least 11 left parentheses have opened |
375 | before it. And so on. \1 through \9 are always interpreted as |
376 | backreferences. |
14218588 |
377 | |
378 | Examples: |
a0d0e21e |
379 | |
380 | s/^([^ ]*) *([^ ]*)/$2 $1/; # swap first two words |
381 | |
14218588 |
382 | if (/(.)\1/) { # find first doubled char |
383 | print "'$1' is the first doubled character\n"; |
384 | } |
c47ff5f1 |
385 | |
14218588 |
386 | if (/Time: (..):(..):(..)/) { # parse out values |
a0d0e21e |
387 | $hours = $1; |
388 | $minutes = $2; |
389 | $seconds = $3; |
390 | } |
c47ff5f1 |
391 | |
14218588 |
392 | Several special variables also refer back to portions of the previous |
393 | match. C<$+> returns whatever the last bracket match matched. |
394 | C<$&> returns the entire matched string. (At one point C<$0> did |
395 | also, but now it returns the name of the program.) C<$`> returns |
77ea4f6d |
396 | everything before the matched string. C<$'> returns everything |
397 | after the matched string. And C<$^N> contains whatever was matched by |
398 | the most-recently closed group (submatch). C<$^N> can be used in |
399 | extended patterns (see below), for example to assign a submatch to a |
400 | variable. |
14218588 |
401 | |
402 | The numbered variables ($1, $2, $3, etc.) and the related punctuation |
77ea4f6d |
403 | set (C<$+>, C<$&>, C<$`>, C<$'>, and C<$^N>) are all dynamically scoped |
14218588 |
404 | until the end of the enclosing block or until the next successful |
405 | match, whichever comes first. (See L<perlsyn/"Compound Statements">.) |
406 | |
407 | B<WARNING>: Once Perl sees that you need one of C<$&>, C<$`>, or |
408 | C<$'> anywhere in the program, it has to provide them for every |
409 | pattern match. This may substantially slow your program. Perl |
410 | uses the same mechanism to produce $1, $2, etc, so you also pay a |
411 | price for each pattern that contains capturing parentheses. (To |
412 | avoid this cost while retaining the grouping behaviour, use the |
413 | extended regular expression C<(?: ... )> instead.) But if you never |
414 | use C<$&>, C<$`> or C<$'>, then patterns I<without> capturing |
415 | parentheses will not be penalized. So avoid C<$&>, C<$'>, and C<$`> |
416 | if you can, but if you can't (and some algorithms really appreciate |
417 | them), once you've used them once, use them at will, because you've |
418 | already paid the price. As of 5.005, C<$&> is not so costly as the |
419 | other two. |
68dc0745 |
420 | |
19799a22 |
421 | Backslashed metacharacters in Perl are alphanumeric, such as C<\b>, |
422 | C<\w>, C<\n>. Unlike some other regular expression languages, there |
423 | are no backslashed symbols that aren't alphanumeric. So anything |
c47ff5f1 |
424 | that looks like \\, \(, \), \<, \>, \{, or \} is always |
19799a22 |
425 | interpreted as a literal character, not a metacharacter. This was |
426 | once used in a common idiom to disable or quote the special meanings |
427 | of regular expression metacharacters in a string that you want to |
36bbe248 |
428 | use for a pattern. Simply quote all non-"word" characters: |
a0d0e21e |
429 | |
430 | $pattern =~ s/(\W)/\\$1/g; |
431 | |
f1cbbd6e |
432 | (If C<use locale> is set, then this depends on the current locale.) |
14218588 |
433 | Today it is more common to use the quotemeta() function or the C<\Q> |
434 | metaquoting escape sequence to disable all metacharacters' special |
435 | meanings like this: |
a0d0e21e |
436 | |
437 | /$unquoted\Q$quoted\E$unquoted/ |
438 | |
9da458fc |
439 | Beware that if you put literal backslashes (those not inside |
440 | interpolated variables) between C<\Q> and C<\E>, double-quotish |
441 | backslash interpolation may lead to confusing results. If you |
442 | I<need> to use literal backslashes within C<\Q...\E>, |
443 | consult L<perlop/"Gory details of parsing quoted constructs">. |
444 | |
19799a22 |
445 | =head2 Extended Patterns |
446 | |
14218588 |
447 | Perl also defines a consistent extension syntax for features not |
448 | found in standard tools like B<awk> and B<lex>. The syntax is a |
449 | pair of parentheses with a question mark as the first thing within |
450 | the parentheses. The character after the question mark indicates |
451 | the extension. |
19799a22 |
452 | |
14218588 |
453 | The stability of these extensions varies widely. Some have been |
454 | part of the core language for many years. Others are experimental |
455 | and may change without warning or be completely removed. Check |
456 | the documentation on an individual feature to verify its current |
457 | status. |
19799a22 |
458 | |
14218588 |
459 | A question mark was chosen for this and for the minimal-matching |
460 | construct because 1) question marks are rare in older regular |
461 | expressions, and 2) whenever you see one, you should stop and |
462 | "question" exactly what is going on. That's psychology... |
a0d0e21e |
463 | |
464 | =over 10 |
465 | |
cc6b7395 |
466 | =item C<(?#text)> |
a0d0e21e |
467 | |
14218588 |
468 | A comment. The text is ignored. If the C</x> modifier enables |
19799a22 |
469 | whitespace formatting, a simple C<#> will suffice. Note that Perl closes |
259138e3 |
470 | the comment as soon as it sees a C<)>, so there is no way to put a literal |
471 | C<)> in the comment. |
a0d0e21e |
472 | |
19799a22 |
473 | =item C<(?imsx-imsx)> |
474 | |
0b6d1084 |
475 | One or more embedded pattern-match modifiers, to be turned on (or |
476 | turned off, if preceded by C<->) for the remainder of the pattern or |
477 | the remainder of the enclosing pattern group (if any). This is |
478 | particularly useful for dynamic patterns, such as those read in from a |
479 | configuration file, read in as an argument, are specified in a table |
480 | somewhere, etc. Consider the case that some of which want to be case |
481 | sensitive and some do not. The case insensitive ones need to include |
482 | merely C<(?i)> at the front of the pattern. For example: |
19799a22 |
483 | |
484 | $pattern = "foobar"; |
485 | if ( /$pattern/i ) { } |
486 | |
487 | # more flexible: |
488 | |
489 | $pattern = "(?i)foobar"; |
490 | if ( /$pattern/ ) { } |
491 | |
0b6d1084 |
492 | These modifiers are restored at the end of the enclosing group. For example, |
19799a22 |
493 | |
494 | ( (?i) blah ) \s+ \1 |
495 | |
496 | will match a repeated (I<including the case>!) word C<blah> in any |
14218588 |
497 | case, assuming C<x> modifier, and no C<i> modifier outside this |
19799a22 |
498 | group. |
499 | |
5a964f20 |
500 | =item C<(?:pattern)> |
a0d0e21e |
501 | |
ca9dfc88 |
502 | =item C<(?imsx-imsx:pattern)> |
503 | |
5a964f20 |
504 | This is for clustering, not capturing; it groups subexpressions like |
505 | "()", but doesn't make backreferences as "()" does. So |
a0d0e21e |
506 | |
5a964f20 |
507 | @fields = split(/\b(?:a|b|c)\b/) |
a0d0e21e |
508 | |
509 | is like |
510 | |
5a964f20 |
511 | @fields = split(/\b(a|b|c)\b/) |
a0d0e21e |
512 | |
19799a22 |
513 | but doesn't spit out extra fields. It's also cheaper not to capture |
514 | characters if you don't need to. |
a0d0e21e |
515 | |
19799a22 |
516 | Any letters between C<?> and C<:> act as flags modifiers as with |
517 | C<(?imsx-imsx)>. For example, |
ca9dfc88 |
518 | |
519 | /(?s-i:more.*than).*million/i |
520 | |
14218588 |
521 | is equivalent to the more verbose |
ca9dfc88 |
522 | |
523 | /(?:(?s-i)more.*than).*million/i |
524 | |
5a964f20 |
525 | =item C<(?=pattern)> |
a0d0e21e |
526 | |
19799a22 |
527 | A zero-width positive look-ahead assertion. For example, C</\w+(?=\t)/> |
a0d0e21e |
528 | matches a word followed by a tab, without including the tab in C<$&>. |
529 | |
5a964f20 |
530 | =item C<(?!pattern)> |
a0d0e21e |
531 | |
19799a22 |
532 | A zero-width negative look-ahead assertion. For example C</foo(?!bar)/> |
a0d0e21e |
533 | matches any occurrence of "foo" that isn't followed by "bar". Note |
19799a22 |
534 | however that look-ahead and look-behind are NOT the same thing. You cannot |
535 | use this for look-behind. |
7b8d334a |
536 | |
5a964f20 |
537 | If you are looking for a "bar" that isn't preceded by a "foo", C</(?!foo)bar/> |
7b8d334a |
538 | will not do what you want. That's because the C<(?!foo)> is just saying that |
539 | the next thing cannot be "foo"--and it's not, it's a "bar", so "foobar" will |
540 | match. You would have to do something like C</(?!foo)...bar/> for that. We |
541 | say "like" because there's the case of your "bar" not having three characters |
542 | before it. You could cover that this way: C</(?:(?!foo)...|^.{0,2})bar/>. |
543 | Sometimes it's still easier just to say: |
a0d0e21e |
544 | |
a3cb178b |
545 | if (/bar/ && $` !~ /foo$/) |
a0d0e21e |
546 | |
19799a22 |
547 | For look-behind see below. |
c277df42 |
548 | |
c47ff5f1 |
549 | =item C<(?<=pattern)> |
c277df42 |
550 | |
c47ff5f1 |
551 | A zero-width positive look-behind assertion. For example, C</(?<=\t)\w+/> |
19799a22 |
552 | matches a word that follows a tab, without including the tab in C<$&>. |
553 | Works only for fixed-width look-behind. |
c277df42 |
554 | |
5a964f20 |
555 | =item C<(?<!pattern)> |
c277df42 |
556 | |
19799a22 |
557 | A zero-width negative look-behind assertion. For example C</(?<!bar)foo/> |
558 | matches any occurrence of "foo" that does not follow "bar". Works |
559 | only for fixed-width look-behind. |
c277df42 |
560 | |
cc6b7395 |
561 | =item C<(?{ code })> |
c277df42 |
562 | |
19799a22 |
563 | B<WARNING>: This extended regular expression feature is considered |
564 | highly experimental, and may be changed or deleted without notice. |
c277df42 |
565 | |
19799a22 |
566 | This zero-width assertion evaluate any embedded Perl code. It |
567 | always succeeds, and its C<code> is not interpolated. Currently, |
568 | the rules to determine where the C<code> ends are somewhat convoluted. |
569 | |
77ea4f6d |
570 | This feature can be used together with the special variable C<$^N> to |
571 | capture the results of submatches in variables without having to keep |
572 | track of the number of nested parentheses. For example: |
573 | |
574 | $_ = "The brown fox jumps over the lazy dog"; |
575 | /the (\S+)(?{ $color = $^N }) (\S+)(?{ $animal = $^N })/i; |
576 | print "color = $color, animal = $animal\n"; |
577 | |
19799a22 |
578 | The C<code> is properly scoped in the following sense: If the assertion |
579 | is backtracked (compare L<"Backtracking">), all changes introduced after |
580 | C<local>ization are undone, so that |
b9ac3b5b |
581 | |
582 | $_ = 'a' x 8; |
583 | m< |
584 | (?{ $cnt = 0 }) # Initialize $cnt. |
585 | ( |
586 | a |
587 | (?{ |
588 | local $cnt = $cnt + 1; # Update $cnt, backtracking-safe. |
589 | }) |
590 | )* |
591 | aaaa |
592 | (?{ $res = $cnt }) # On success copy to non-localized |
593 | # location. |
594 | >x; |
595 | |
19799a22 |
596 | will set C<$res = 4>. Note that after the match, $cnt returns to the globally |
14218588 |
597 | introduced value, because the scopes that restrict C<local> operators |
b9ac3b5b |
598 | are unwound. |
599 | |
19799a22 |
600 | This assertion may be used as a C<(?(condition)yes-pattern|no-pattern)> |
601 | switch. If I<not> used in this way, the result of evaluation of |
602 | C<code> is put into the special variable C<$^R>. This happens |
603 | immediately, so C<$^R> can be used from other C<(?{ code })> assertions |
604 | inside the same regular expression. |
b9ac3b5b |
605 | |
19799a22 |
606 | The assignment to C<$^R> above is properly localized, so the old |
607 | value of C<$^R> is restored if the assertion is backtracked; compare |
608 | L<"Backtracking">. |
b9ac3b5b |
609 | |
19799a22 |
610 | For reasons of security, this construct is forbidden if the regular |
611 | expression involves run-time interpolation of variables, unless the |
612 | perilous C<use re 'eval'> pragma has been used (see L<re>), or the |
613 | variables contain results of C<qr//> operator (see |
614 | L<perlop/"qr/STRING/imosx">). |
871b0233 |
615 | |
14218588 |
616 | This restriction is because of the wide-spread and remarkably convenient |
19799a22 |
617 | custom of using run-time determined strings as patterns. For example: |
871b0233 |
618 | |
619 | $re = <>; |
620 | chomp $re; |
621 | $string =~ /$re/; |
622 | |
14218588 |
623 | Before Perl knew how to execute interpolated code within a pattern, |
624 | this operation was completely safe from a security point of view, |
625 | although it could raise an exception from an illegal pattern. If |
626 | you turn on the C<use re 'eval'>, though, it is no longer secure, |
627 | so you should only do so if you are also using taint checking. |
628 | Better yet, use the carefully constrained evaluation within a Safe |
629 | module. See L<perlsec> for details about both these mechanisms. |
871b0233 |
630 | |
14455d6c |
631 | =item C<(??{ code })> |
0f5d15d6 |
632 | |
19799a22 |
633 | B<WARNING>: This extended regular expression feature is considered |
634 | highly experimental, and may be changed or deleted without notice. |
9da458fc |
635 | A simplified version of the syntax may be introduced for commonly |
636 | used idioms. |
0f5d15d6 |
637 | |
19799a22 |
638 | This is a "postponed" regular subexpression. The C<code> is evaluated |
639 | at run time, at the moment this subexpression may match. The result |
640 | of evaluation is considered as a regular expression and matched as |
641 | if it were inserted instead of this construct. |
0f5d15d6 |
642 | |
428594d9 |
643 | The C<code> is not interpolated. As before, the rules to determine |
19799a22 |
644 | where the C<code> ends are currently somewhat convoluted. |
645 | |
646 | The following pattern matches a parenthesized group: |
0f5d15d6 |
647 | |
648 | $re = qr{ |
649 | \( |
650 | (?: |
651 | (?> [^()]+ ) # Non-parens without backtracking |
652 | | |
14455d6c |
653 | (??{ $re }) # Group with matching parens |
0f5d15d6 |
654 | )* |
655 | \) |
656 | }x; |
657 | |
c47ff5f1 |
658 | =item C<< (?>pattern) >> |
5a964f20 |
659 | |
19799a22 |
660 | B<WARNING>: This extended regular expression feature is considered |
661 | highly experimental, and may be changed or deleted without notice. |
662 | |
663 | An "independent" subexpression, one which matches the substring |
664 | that a I<standalone> C<pattern> would match if anchored at the given |
9da458fc |
665 | position, and it matches I<nothing other than this substring>. This |
19799a22 |
666 | construct is useful for optimizations of what would otherwise be |
667 | "eternal" matches, because it will not backtrack (see L<"Backtracking">). |
9da458fc |
668 | It may also be useful in places where the "grab all you can, and do not |
669 | give anything back" semantic is desirable. |
19799a22 |
670 | |
c47ff5f1 |
671 | For example: C<< ^(?>a*)ab >> will never match, since C<< (?>a*) >> |
19799a22 |
672 | (anchored at the beginning of string, as above) will match I<all> |
673 | characters C<a> at the beginning of string, leaving no C<a> for |
674 | C<ab> to match. In contrast, C<a*ab> will match the same as C<a+b>, |
675 | since the match of the subgroup C<a*> is influenced by the following |
676 | group C<ab> (see L<"Backtracking">). In particular, C<a*> inside |
677 | C<a*ab> will match fewer characters than a standalone C<a*>, since |
678 | this makes the tail match. |
679 | |
c47ff5f1 |
680 | An effect similar to C<< (?>pattern) >> may be achieved by writing |
19799a22 |
681 | C<(?=(pattern))\1>. This matches the same substring as a standalone |
682 | C<a+>, and the following C<\1> eats the matched string; it therefore |
c47ff5f1 |
683 | makes a zero-length assertion into an analogue of C<< (?>...) >>. |
19799a22 |
684 | (The difference between these two constructs is that the second one |
685 | uses a capturing group, thus shifting ordinals of backreferences |
686 | in the rest of a regular expression.) |
687 | |
688 | Consider this pattern: |
c277df42 |
689 | |
871b0233 |
690 | m{ \( |
691 | ( |
9da458fc |
692 | [^()]+ # x+ |
871b0233 |
693 | | |
694 | \( [^()]* \) |
695 | )+ |
696 | \) |
697 | }x |
5a964f20 |
698 | |
19799a22 |
699 | That will efficiently match a nonempty group with matching parentheses |
700 | two levels deep or less. However, if there is no such group, it |
701 | will take virtually forever on a long string. That's because there |
702 | are so many different ways to split a long string into several |
703 | substrings. This is what C<(.+)+> is doing, and C<(.+)+> is similar |
704 | to a subpattern of the above pattern. Consider how the pattern |
705 | above detects no-match on C<((()aaaaaaaaaaaaaaaaaa> in several |
706 | seconds, but that each extra letter doubles this time. This |
707 | exponential performance will make it appear that your program has |
14218588 |
708 | hung. However, a tiny change to this pattern |
5a964f20 |
709 | |
871b0233 |
710 | m{ \( |
711 | ( |
9da458fc |
712 | (?> [^()]+ ) # change x+ above to (?> x+ ) |
871b0233 |
713 | | |
714 | \( [^()]* \) |
715 | )+ |
716 | \) |
717 | }x |
c277df42 |
718 | |
c47ff5f1 |
719 | which uses C<< (?>...) >> matches exactly when the one above does (verifying |
5a964f20 |
720 | this yourself would be a productive exercise), but finishes in a fourth |
721 | the time when used on a similar string with 1000000 C<a>s. Be aware, |
722 | however, that this pattern currently triggers a warning message under |
9f1b1f2d |
723 | the C<use warnings> pragma or B<-w> switch saying it |
6bab786b |
724 | C<"matches null string many times in regex">. |
c277df42 |
725 | |
c47ff5f1 |
726 | On simple groups, such as the pattern C<< (?> [^()]+ ) >>, a comparable |
19799a22 |
727 | effect may be achieved by negative look-ahead, as in C<[^()]+ (?! [^()] )>. |
c277df42 |
728 | This was only 4 times slower on a string with 1000000 C<a>s. |
729 | |
9da458fc |
730 | The "grab all you can, and do not give anything back" semantic is desirable |
731 | in many situations where on the first sight a simple C<()*> looks like |
732 | the correct solution. Suppose we parse text with comments being delimited |
733 | by C<#> followed by some optional (horizontal) whitespace. Contrary to |
4375e838 |
734 | its appearance, C<#[ \t]*> I<is not> the correct subexpression to match |
9da458fc |
735 | the comment delimiter, because it may "give up" some whitespace if |
736 | the remainder of the pattern can be made to match that way. The correct |
737 | answer is either one of these: |
738 | |
739 | (?>#[ \t]*) |
740 | #[ \t]*(?![ \t]) |
741 | |
742 | For example, to grab non-empty comments into $1, one should use either |
743 | one of these: |
744 | |
745 | / (?> \# [ \t]* ) ( .+ ) /x; |
746 | / \# [ \t]* ( [^ \t] .* ) /x; |
747 | |
748 | Which one you pick depends on which of these expressions better reflects |
749 | the above specification of comments. |
750 | |
5a964f20 |
751 | =item C<(?(condition)yes-pattern|no-pattern)> |
c277df42 |
752 | |
5a964f20 |
753 | =item C<(?(condition)yes-pattern)> |
c277df42 |
754 | |
19799a22 |
755 | B<WARNING>: This extended regular expression feature is considered |
756 | highly experimental, and may be changed or deleted without notice. |
757 | |
c277df42 |
758 | Conditional expression. C<(condition)> should be either an integer in |
759 | parentheses (which is valid if the corresponding pair of parentheses |
19799a22 |
760 | matched), or look-ahead/look-behind/evaluate zero-width assertion. |
c277df42 |
761 | |
19799a22 |
762 | For example: |
c277df42 |
763 | |
5a964f20 |
764 | m{ ( \( )? |
871b0233 |
765 | [^()]+ |
5a964f20 |
766 | (?(1) \) ) |
871b0233 |
767 | }x |
c277df42 |
768 | |
769 | matches a chunk of non-parentheses, possibly included in parentheses |
770 | themselves. |
a0d0e21e |
771 | |
a0d0e21e |
772 | =back |
773 | |
c07a80fd |
774 | =head2 Backtracking |
775 | |
35a734be |
776 | NOTE: This section presents an abstract approximation of regular |
777 | expression behavior. For a more rigorous (and complicated) view of |
778 | the rules involved in selecting a match among possible alternatives, |
779 | see L<Combining pieces together>. |
780 | |
c277df42 |
781 | A fundamental feature of regular expression matching involves the |
5a964f20 |
782 | notion called I<backtracking>, which is currently used (when needed) |
c277df42 |
783 | by all regular expression quantifiers, namely C<*>, C<*?>, C<+>, |
9da458fc |
784 | C<+?>, C<{n,m}>, and C<{n,m}?>. Backtracking is often optimized |
785 | internally, but the general principle outlined here is valid. |
c07a80fd |
786 | |
787 | For a regular expression to match, the I<entire> regular expression must |
788 | match, not just part of it. So if the beginning of a pattern containing a |
789 | quantifier succeeds in a way that causes later parts in the pattern to |
790 | fail, the matching engine backs up and recalculates the beginning |
791 | part--that's why it's called backtracking. |
792 | |
793 | Here is an example of backtracking: Let's say you want to find the |
794 | word following "foo" in the string "Food is on the foo table.": |
795 | |
796 | $_ = "Food is on the foo table."; |
797 | if ( /\b(foo)\s+(\w+)/i ) { |
798 | print "$2 follows $1.\n"; |
799 | } |
800 | |
801 | When the match runs, the first part of the regular expression (C<\b(foo)>) |
802 | finds a possible match right at the beginning of the string, and loads up |
803 | $1 with "Foo". However, as soon as the matching engine sees that there's |
804 | no whitespace following the "Foo" that it had saved in $1, it realizes its |
68dc0745 |
805 | mistake and starts over again one character after where it had the |
c07a80fd |
806 | tentative match. This time it goes all the way until the next occurrence |
807 | of "foo". The complete regular expression matches this time, and you get |
808 | the expected output of "table follows foo." |
809 | |
810 | Sometimes minimal matching can help a lot. Imagine you'd like to match |
811 | everything between "foo" and "bar". Initially, you write something |
812 | like this: |
813 | |
814 | $_ = "The food is under the bar in the barn."; |
815 | if ( /foo(.*)bar/ ) { |
816 | print "got <$1>\n"; |
817 | } |
818 | |
819 | Which perhaps unexpectedly yields: |
820 | |
821 | got <d is under the bar in the > |
822 | |
823 | That's because C<.*> was greedy, so you get everything between the |
14218588 |
824 | I<first> "foo" and the I<last> "bar". Here it's more effective |
c07a80fd |
825 | to use minimal matching to make sure you get the text between a "foo" |
826 | and the first "bar" thereafter. |
827 | |
828 | if ( /foo(.*?)bar/ ) { print "got <$1>\n" } |
829 | got <d is under the > |
830 | |
831 | Here's another example: let's say you'd like to match a number at the end |
b6e13d97 |
832 | of a string, and you also want to keep the preceding part of the match. |
c07a80fd |
833 | So you write this: |
834 | |
835 | $_ = "I have 2 numbers: 53147"; |
836 | if ( /(.*)(\d*)/ ) { # Wrong! |
837 | print "Beginning is <$1>, number is <$2>.\n"; |
838 | } |
839 | |
840 | That won't work at all, because C<.*> was greedy and gobbled up the |
841 | whole string. As C<\d*> can match on an empty string the complete |
842 | regular expression matched successfully. |
843 | |
8e1088bc |
844 | Beginning is <I have 2 numbers: 53147>, number is <>. |
c07a80fd |
845 | |
846 | Here are some variants, most of which don't work: |
847 | |
848 | $_ = "I have 2 numbers: 53147"; |
849 | @pats = qw{ |
850 | (.*)(\d*) |
851 | (.*)(\d+) |
852 | (.*?)(\d*) |
853 | (.*?)(\d+) |
854 | (.*)(\d+)$ |
855 | (.*?)(\d+)$ |
856 | (.*)\b(\d+)$ |
857 | (.*\D)(\d+)$ |
858 | }; |
859 | |
860 | for $pat (@pats) { |
861 | printf "%-12s ", $pat; |
862 | if ( /$pat/ ) { |
863 | print "<$1> <$2>\n"; |
864 | } else { |
865 | print "FAIL\n"; |
866 | } |
867 | } |
868 | |
869 | That will print out: |
870 | |
871 | (.*)(\d*) <I have 2 numbers: 53147> <> |
872 | (.*)(\d+) <I have 2 numbers: 5314> <7> |
873 | (.*?)(\d*) <> <> |
874 | (.*?)(\d+) <I have > <2> |
875 | (.*)(\d+)$ <I have 2 numbers: 5314> <7> |
876 | (.*?)(\d+)$ <I have 2 numbers: > <53147> |
877 | (.*)\b(\d+)$ <I have 2 numbers: > <53147> |
878 | (.*\D)(\d+)$ <I have 2 numbers: > <53147> |
879 | |
880 | As you see, this can be a bit tricky. It's important to realize that a |
881 | regular expression is merely a set of assertions that gives a definition |
882 | of success. There may be 0, 1, or several different ways that the |
883 | definition might succeed against a particular string. And if there are |
5a964f20 |
884 | multiple ways it might succeed, you need to understand backtracking to |
885 | know which variety of success you will achieve. |
c07a80fd |
886 | |
19799a22 |
887 | When using look-ahead assertions and negations, this can all get even |
8b19b778 |
888 | trickier. Imagine you'd like to find a sequence of non-digits not |
c07a80fd |
889 | followed by "123". You might try to write that as |
890 | |
871b0233 |
891 | $_ = "ABC123"; |
892 | if ( /^\D*(?!123)/ ) { # Wrong! |
893 | print "Yup, no 123 in $_\n"; |
894 | } |
c07a80fd |
895 | |
896 | But that isn't going to match; at least, not the way you're hoping. It |
897 | claims that there is no 123 in the string. Here's a clearer picture of |
9b9391b2 |
898 | why that pattern matches, contrary to popular expectations: |
c07a80fd |
899 | |
900 | $x = 'ABC123' ; |
901 | $y = 'ABC445' ; |
902 | |
903 | print "1: got $1\n" if $x =~ /^(ABC)(?!123)/ ; |
904 | print "2: got $1\n" if $y =~ /^(ABC)(?!123)/ ; |
905 | |
906 | print "3: got $1\n" if $x =~ /^(\D*)(?!123)/ ; |
907 | print "4: got $1\n" if $y =~ /^(\D*)(?!123)/ ; |
908 | |
909 | This prints |
910 | |
911 | 2: got ABC |
912 | 3: got AB |
913 | 4: got ABC |
914 | |
5f05dabc |
915 | You might have expected test 3 to fail because it seems to a more |
c07a80fd |
916 | general purpose version of test 1. The important difference between |
917 | them is that test 3 contains a quantifier (C<\D*>) and so can use |
918 | backtracking, whereas test 1 will not. What's happening is |
919 | that you've asked "Is it true that at the start of $x, following 0 or more |
5f05dabc |
920 | non-digits, you have something that's not 123?" If the pattern matcher had |
c07a80fd |
921 | let C<\D*> expand to "ABC", this would have caused the whole pattern to |
54310121 |
922 | fail. |
14218588 |
923 | |
c07a80fd |
924 | The search engine will initially match C<\D*> with "ABC". Then it will |
14218588 |
925 | try to match C<(?!123> with "123", which fails. But because |
c07a80fd |
926 | a quantifier (C<\D*>) has been used in the regular expression, the |
927 | search engine can backtrack and retry the match differently |
54310121 |
928 | in the hope of matching the complete regular expression. |
c07a80fd |
929 | |
5a964f20 |
930 | The pattern really, I<really> wants to succeed, so it uses the |
931 | standard pattern back-off-and-retry and lets C<\D*> expand to just "AB" this |
c07a80fd |
932 | time. Now there's indeed something following "AB" that is not |
14218588 |
933 | "123". It's "C123", which suffices. |
c07a80fd |
934 | |
14218588 |
935 | We can deal with this by using both an assertion and a negation. |
936 | We'll say that the first part in $1 must be followed both by a digit |
937 | and by something that's not "123". Remember that the look-aheads |
938 | are zero-width expressions--they only look, but don't consume any |
939 | of the string in their match. So rewriting this way produces what |
c07a80fd |
940 | you'd expect; that is, case 5 will fail, but case 6 succeeds: |
941 | |
942 | print "5: got $1\n" if $x =~ /^(\D*)(?=\d)(?!123)/ ; |
943 | print "6: got $1\n" if $y =~ /^(\D*)(?=\d)(?!123)/ ; |
944 | |
945 | 6: got ABC |
946 | |
5a964f20 |
947 | In other words, the two zero-width assertions next to each other work as though |
19799a22 |
948 | they're ANDed together, just as you'd use any built-in assertions: C</^$/> |
c07a80fd |
949 | matches only if you're at the beginning of the line AND the end of the |
950 | line simultaneously. The deeper underlying truth is that juxtaposition in |
951 | regular expressions always means AND, except when you write an explicit OR |
952 | using the vertical bar. C</ab/> means match "a" AND (then) match "b", |
953 | although the attempted matches are made at different positions because "a" |
954 | is not a zero-width assertion, but a one-width assertion. |
955 | |
19799a22 |
956 | B<WARNING>: particularly complicated regular expressions can take |
14218588 |
957 | exponential time to solve because of the immense number of possible |
9da458fc |
958 | ways they can use backtracking to try match. For example, without |
959 | internal optimizations done by the regular expression engine, this will |
960 | take a painfully long time to run: |
c07a80fd |
961 | |
e1901655 |
962 | 'aaaaaaaaaaaa' =~ /((a{0,5}){0,5})*[c]/ |
963 | |
964 | And if you used C<*>'s in the internal groups instead of limiting them |
965 | to 0 through 5 matches, then it would take forever--or until you ran |
966 | out of stack space. Moreover, these internal optimizations are not |
967 | always applicable. For example, if you put C<{0,5}> instead of C<*> |
968 | on the external group, no current optimization is applicable, and the |
969 | match takes a long time to finish. |
c07a80fd |
970 | |
9da458fc |
971 | A powerful tool for optimizing such beasts is what is known as an |
972 | "independent group", |
c47ff5f1 |
973 | which does not backtrack (see L<C<< (?>pattern) >>>). Note also that |
9da458fc |
974 | zero-length look-ahead/look-behind assertions will not backtrack to make |
14218588 |
975 | the tail match, since they are in "logical" context: only |
976 | whether they match is considered relevant. For an example |
9da458fc |
977 | where side-effects of look-ahead I<might> have influenced the |
c47ff5f1 |
978 | following match, see L<C<< (?>pattern) >>>. |
c277df42 |
979 | |
a0d0e21e |
980 | =head2 Version 8 Regular Expressions |
981 | |
5a964f20 |
982 | In case you're not familiar with the "regular" Version 8 regex |
a0d0e21e |
983 | routines, here are the pattern-matching rules not described above. |
984 | |
54310121 |
985 | Any single character matches itself, unless it is a I<metacharacter> |
a0d0e21e |
986 | with a special meaning described here or above. You can cause |
5a964f20 |
987 | characters that normally function as metacharacters to be interpreted |
5f05dabc |
988 | literally by prefixing them with a "\" (e.g., "\." matches a ".", not any |
a0d0e21e |
989 | character; "\\" matches a "\"). A series of characters matches that |
990 | series of characters in the target string, so the pattern C<blurfl> |
991 | would match "blurfl" in the target string. |
992 | |
993 | You can specify a character class, by enclosing a list of characters |
5a964f20 |
994 | in C<[]>, which will match any one character from the list. If the |
a0d0e21e |
995 | first character after the "[" is "^", the class matches any character not |
14218588 |
996 | in the list. Within a list, the "-" character specifies a |
5a964f20 |
997 | range, so that C<a-z> represents all characters between "a" and "z", |
8a4f6ac2 |
998 | inclusive. If you want either "-" or "]" itself to be a member of a |
999 | class, put it at the start of the list (possibly after a "^"), or |
1000 | escape it with a backslash. "-" is also taken literally when it is |
1001 | at the end of the list, just before the closing "]". (The |
84850974 |
1002 | following all specify the same class of three characters: C<[-az]>, |
1003 | C<[az-]>, and C<[a\-z]>. All are different from C<[a-z]>, which |
fb55449c |
1004 | specifies a class containing twenty-six characters, even on EBCDIC |
1005 | based coded character sets.) Also, if you try to use the character |
1006 | classes C<\w>, C<\W>, C<\s>, C<\S>, C<\d>, or C<\D> as endpoints of |
1007 | a range, that's not a range, the "-" is understood literally. |
a0d0e21e |
1008 | |
8ada0baa |
1009 | Note also that the whole range idea is rather unportable between |
1010 | character sets--and even within character sets they may cause results |
1011 | you probably didn't expect. A sound principle is to use only ranges |
1012 | that begin from and end at either alphabets of equal case ([a-e], |
1013 | [A-E]), or digits ([0-9]). Anything else is unsafe. If in doubt, |
1014 | spell out the character sets in full. |
1015 | |
54310121 |
1016 | Characters may be specified using a metacharacter syntax much like that |
a0d0e21e |
1017 | used in C: "\n" matches a newline, "\t" a tab, "\r" a carriage return, |
1018 | "\f" a form feed, etc. More generally, \I<nnn>, where I<nnn> is a string |
fb55449c |
1019 | of octal digits, matches the character whose coded character set value |
1020 | is I<nnn>. Similarly, \xI<nn>, where I<nn> are hexadecimal digits, |
1021 | matches the character whose numeric value is I<nn>. The expression \cI<x> |
1022 | matches the character control-I<x>. Finally, the "." metacharacter |
1023 | matches any character except "\n" (unless you use C</s>). |
a0d0e21e |
1024 | |
1025 | You can specify a series of alternatives for a pattern using "|" to |
1026 | separate them, so that C<fee|fie|foe> will match any of "fee", "fie", |
5a964f20 |
1027 | or "foe" in the target string (as would C<f(e|i|o)e>). The |
a0d0e21e |
1028 | first alternative includes everything from the last pattern delimiter |
1029 | ("(", "[", or the beginning of the pattern) up to the first "|", and |
1030 | the last alternative contains everything from the last "|" to the next |
14218588 |
1031 | pattern delimiter. That's why it's common practice to include |
1032 | alternatives in parentheses: to minimize confusion about where they |
a3cb178b |
1033 | start and end. |
1034 | |
5a964f20 |
1035 | Alternatives are tried from left to right, so the first |
a3cb178b |
1036 | alternative found for which the entire expression matches, is the one that |
1037 | is chosen. This means that alternatives are not necessarily greedy. For |
628afcb5 |
1038 | example: when matching C<foo|foot> against "barefoot", only the "foo" |
a3cb178b |
1039 | part will match, as that is the first alternative tried, and it successfully |
1040 | matches the target string. (This might not seem important, but it is |
1041 | important when you are capturing matched text using parentheses.) |
1042 | |
5a964f20 |
1043 | Also remember that "|" is interpreted as a literal within square brackets, |
a3cb178b |
1044 | so if you write C<[fee|fie|foe]> you're really only matching C<[feio|]>. |
a0d0e21e |
1045 | |
14218588 |
1046 | Within a pattern, you may designate subpatterns for later reference |
1047 | by enclosing them in parentheses, and you may refer back to the |
1048 | I<n>th subpattern later in the pattern using the metacharacter |
1049 | \I<n>. Subpatterns are numbered based on the left to right order |
1050 | of their opening parenthesis. A backreference matches whatever |
1051 | actually matched the subpattern in the string being examined, not |
1052 | the rules for that subpattern. Therefore, C<(0|0x)\d*\s\1\d*> will |
1053 | match "0x1234 0x4321", but not "0x1234 01234", because subpattern |
1054 | 1 matched "0x", even though the rule C<0|0x> could potentially match |
1055 | the leading 0 in the second number. |
cb1a09d0 |
1056 | |
19799a22 |
1057 | =head2 Warning on \1 vs $1 |
cb1a09d0 |
1058 | |
5a964f20 |
1059 | Some people get too used to writing things like: |
cb1a09d0 |
1060 | |
1061 | $pattern =~ s/(\W)/\\\1/g; |
1062 | |
1063 | This is grandfathered for the RHS of a substitute to avoid shocking the |
1064 | B<sed> addicts, but it's a dirty habit to get into. That's because in |
d1be9408 |
1065 | PerlThink, the righthand side of an C<s///> is a double-quoted string. C<\1> in |
cb1a09d0 |
1066 | the usual double-quoted string means a control-A. The customary Unix |
1067 | meaning of C<\1> is kludged in for C<s///>. However, if you get into the habit |
1068 | of doing that, you get yourself into trouble if you then add an C</e> |
1069 | modifier. |
1070 | |
5a964f20 |
1071 | s/(\d+)/ \1 + 1 /eg; # causes warning under -w |
cb1a09d0 |
1072 | |
1073 | Or if you try to do |
1074 | |
1075 | s/(\d+)/\1000/; |
1076 | |
1077 | You can't disambiguate that by saying C<\{1}000>, whereas you can fix it with |
14218588 |
1078 | C<${1}000>. The operation of interpolation should not be confused |
cb1a09d0 |
1079 | with the operation of matching a backreference. Certainly they mean two |
1080 | different things on the I<left> side of the C<s///>. |
9fa51da4 |
1081 | |
c84d73f1 |
1082 | =head2 Repeated patterns matching zero-length substring |
1083 | |
19799a22 |
1084 | B<WARNING>: Difficult material (and prose) ahead. This section needs a rewrite. |
c84d73f1 |
1085 | |
1086 | Regular expressions provide a terse and powerful programming language. As |
1087 | with most other power tools, power comes together with the ability |
1088 | to wreak havoc. |
1089 | |
1090 | A common abuse of this power stems from the ability to make infinite |
628afcb5 |
1091 | loops using regular expressions, with something as innocuous as: |
c84d73f1 |
1092 | |
1093 | 'foo' =~ m{ ( o? )* }x; |
1094 | |
1095 | The C<o?> can match at the beginning of C<'foo'>, and since the position |
1096 | in the string is not moved by the match, C<o?> would match again and again |
14218588 |
1097 | because of the C<*> modifier. Another common way to create a similar cycle |
c84d73f1 |
1098 | is with the looping modifier C<//g>: |
1099 | |
1100 | @matches = ( 'foo' =~ m{ o? }xg ); |
1101 | |
1102 | or |
1103 | |
1104 | print "match: <$&>\n" while 'foo' =~ m{ o? }xg; |
1105 | |
1106 | or the loop implied by split(). |
1107 | |
1108 | However, long experience has shown that many programming tasks may |
14218588 |
1109 | be significantly simplified by using repeated subexpressions that |
1110 | may match zero-length substrings. Here's a simple example being: |
c84d73f1 |
1111 | |
1112 | @chars = split //, $string; # // is not magic in split |
1113 | ($whitewashed = $string) =~ s/()/ /g; # parens avoid magic s// / |
1114 | |
9da458fc |
1115 | Thus Perl allows such constructs, by I<forcefully breaking |
c84d73f1 |
1116 | the infinite loop>. The rules for this are different for lower-level |
1117 | loops given by the greedy modifiers C<*+{}>, and for higher-level |
1118 | ones like the C</g> modifier or split() operator. |
1119 | |
19799a22 |
1120 | The lower-level loops are I<interrupted> (that is, the loop is |
1121 | broken) when Perl detects that a repeated expression matched a |
1122 | zero-length substring. Thus |
c84d73f1 |
1123 | |
1124 | m{ (?: NON_ZERO_LENGTH | ZERO_LENGTH )* }x; |
1125 | |
1126 | is made equivalent to |
1127 | |
1128 | m{ (?: NON_ZERO_LENGTH )* |
1129 | | |
1130 | (?: ZERO_LENGTH )? |
1131 | }x; |
1132 | |
1133 | The higher level-loops preserve an additional state between iterations: |
1134 | whether the last match was zero-length. To break the loop, the following |
1135 | match after a zero-length match is prohibited to have a length of zero. |
1136 | This prohibition interacts with backtracking (see L<"Backtracking">), |
1137 | and so the I<second best> match is chosen if the I<best> match is of |
1138 | zero length. |
1139 | |
19799a22 |
1140 | For example: |
c84d73f1 |
1141 | |
1142 | $_ = 'bar'; |
1143 | s/\w??/<$&>/g; |
1144 | |
20fb949f |
1145 | results in C<< <><b><><a><><r><> >>. At each position of the string the best |
c84d73f1 |
1146 | match given by non-greedy C<??> is the zero-length match, and the I<second |
1147 | best> match is what is matched by C<\w>. Thus zero-length matches |
1148 | alternate with one-character-long matches. |
1149 | |
1150 | Similarly, for repeated C<m/()/g> the second-best match is the match at the |
1151 | position one notch further in the string. |
1152 | |
19799a22 |
1153 | The additional state of being I<matched with zero-length> is associated with |
c84d73f1 |
1154 | the matched string, and is reset by each assignment to pos(). |
9da458fc |
1155 | Zero-length matches at the end of the previous match are ignored |
1156 | during C<split>. |
c84d73f1 |
1157 | |
35a734be |
1158 | =head2 Combining pieces together |
1159 | |
1160 | Each of the elementary pieces of regular expressions which were described |
1161 | before (such as C<ab> or C<\Z>) could match at most one substring |
1162 | at the given position of the input string. However, in a typical regular |
1163 | expression these elementary pieces are combined into more complicated |
1164 | patterns using combining operators C<ST>, C<S|T>, C<S*> etc |
1165 | (in these examples C<S> and C<T> are regular subexpressions). |
1166 | |
1167 | Such combinations can include alternatives, leading to a problem of choice: |
1168 | if we match a regular expression C<a|ab> against C<"abc">, will it match |
1169 | substring C<"a"> or C<"ab">? One way to describe which substring is |
1170 | actually matched is the concept of backtracking (see L<"Backtracking">). |
1171 | However, this description is too low-level and makes you think |
1172 | in terms of a particular implementation. |
1173 | |
1174 | Another description starts with notions of "better"/"worse". All the |
1175 | substrings which may be matched by the given regular expression can be |
1176 | sorted from the "best" match to the "worst" match, and it is the "best" |
1177 | match which is chosen. This substitutes the question of "what is chosen?" |
1178 | by the question of "which matches are better, and which are worse?". |
1179 | |
1180 | Again, for elementary pieces there is no such question, since at most |
1181 | one match at a given position is possible. This section describes the |
1182 | notion of better/worse for combining operators. In the description |
1183 | below C<S> and C<T> are regular subexpressions. |
1184 | |
13a2d996 |
1185 | =over 4 |
35a734be |
1186 | |
1187 | =item C<ST> |
1188 | |
1189 | Consider two possible matches, C<AB> and C<A'B'>, C<A> and C<A'> are |
1190 | substrings which can be matched by C<S>, C<B> and C<B'> are substrings |
1191 | which can be matched by C<T>. |
1192 | |
1193 | If C<A> is better match for C<S> than C<A'>, C<AB> is a better |
1194 | match than C<A'B'>. |
1195 | |
1196 | If C<A> and C<A'> coincide: C<AB> is a better match than C<AB'> if |
1197 | C<B> is better match for C<T> than C<B'>. |
1198 | |
1199 | =item C<S|T> |
1200 | |
1201 | When C<S> can match, it is a better match than when only C<T> can match. |
1202 | |
1203 | Ordering of two matches for C<S> is the same as for C<S>. Similar for |
1204 | two matches for C<T>. |
1205 | |
1206 | =item C<S{REPEAT_COUNT}> |
1207 | |
1208 | Matches as C<SSS...S> (repeated as many times as necessary). |
1209 | |
1210 | =item C<S{min,max}> |
1211 | |
1212 | Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>. |
1213 | |
1214 | =item C<S{min,max}?> |
1215 | |
1216 | Matches as C<S{min}|S{min+1}|...|S{max-1}|S{max}>. |
1217 | |
1218 | =item C<S?>, C<S*>, C<S+> |
1219 | |
1220 | Same as C<S{0,1}>, C<S{0,BIG_NUMBER}>, C<S{1,BIG_NUMBER}> respectively. |
1221 | |
1222 | =item C<S??>, C<S*?>, C<S+?> |
1223 | |
1224 | Same as C<S{0,1}?>, C<S{0,BIG_NUMBER}?>, C<S{1,BIG_NUMBER}?> respectively. |
1225 | |
c47ff5f1 |
1226 | =item C<< (?>S) >> |
35a734be |
1227 | |
1228 | Matches the best match for C<S> and only that. |
1229 | |
1230 | =item C<(?=S)>, C<(?<=S)> |
1231 | |
1232 | Only the best match for C<S> is considered. (This is important only if |
1233 | C<S> has capturing parentheses, and backreferences are used somewhere |
1234 | else in the whole regular expression.) |
1235 | |
1236 | =item C<(?!S)>, C<(?<!S)> |
1237 | |
1238 | For this grouping operator there is no need to describe the ordering, since |
1239 | only whether or not C<S> can match is important. |
1240 | |
14455d6c |
1241 | =item C<(??{ EXPR })> |
35a734be |
1242 | |
1243 | The ordering is the same as for the regular expression which is |
1244 | the result of EXPR. |
1245 | |
1246 | =item C<(?(condition)yes-pattern|no-pattern)> |
1247 | |
1248 | Recall that which of C<yes-pattern> or C<no-pattern> actually matches is |
1249 | already determined. The ordering of the matches is the same as for the |
1250 | chosen subexpression. |
1251 | |
1252 | =back |
1253 | |
1254 | The above recipes describe the ordering of matches I<at a given position>. |
1255 | One more rule is needed to understand how a match is determined for the |
1256 | whole regular expression: a match at an earlier position is always better |
1257 | than a match at a later position. |
1258 | |
c84d73f1 |
1259 | =head2 Creating custom RE engines |
1260 | |
1261 | Overloaded constants (see L<overload>) provide a simple way to extend |
1262 | the functionality of the RE engine. |
1263 | |
1264 | Suppose that we want to enable a new RE escape-sequence C<\Y|> which |
1265 | matches at boundary between white-space characters and non-whitespace |
1266 | characters. Note that C<(?=\S)(?<!\S)|(?!\S)(?<=\S)> matches exactly |
1267 | at these positions, so we want to have each C<\Y|> in the place of the |
1268 | more complicated version. We can create a module C<customre> to do |
1269 | this: |
1270 | |
1271 | package customre; |
1272 | use overload; |
1273 | |
1274 | sub import { |
1275 | shift; |
1276 | die "No argument to customre::import allowed" if @_; |
1277 | overload::constant 'qr' => \&convert; |
1278 | } |
1279 | |
1280 | sub invalid { die "/$_[0]/: invalid escape '\\$_[1]'"} |
1281 | |
1282 | my %rules = ( '\\' => '\\', |
1283 | 'Y|' => qr/(?=\S)(?<!\S)|(?!\S)(?<=\S)/ ); |
1284 | sub convert { |
1285 | my $re = shift; |
1286 | $re =~ s{ |
1287 | \\ ( \\ | Y . ) |
1288 | } |
1289 | { $rules{$1} or invalid($re,$1) }sgex; |
1290 | return $re; |
1291 | } |
1292 | |
1293 | Now C<use customre> enables the new escape in constant regular |
1294 | expressions, i.e., those without any runtime variable interpolations. |
1295 | As documented in L<overload>, this conversion will work only over |
1296 | literal parts of regular expressions. For C<\Y|$re\Y|> the variable |
1297 | part of this regular expression needs to be converted explicitly |
1298 | (but only if the special meaning of C<\Y|> should be enabled inside $re): |
1299 | |
1300 | use customre; |
1301 | $re = <>; |
1302 | chomp $re; |
1303 | $re = customre::convert $re; |
1304 | /\Y|$re\Y|/; |
1305 | |
19799a22 |
1306 | =head1 BUGS |
1307 | |
9da458fc |
1308 | This document varies from difficult to understand to completely |
1309 | and utterly opaque. The wandering prose riddled with jargon is |
1310 | hard to fathom in several places. |
1311 | |
1312 | This document needs a rewrite that separates the tutorial content |
1313 | from the reference content. |
19799a22 |
1314 | |
1315 | =head1 SEE ALSO |
9fa51da4 |
1316 | |
91e0c79e |
1317 | L<perlrequick>. |
1318 | |
1319 | L<perlretut>. |
1320 | |
9b599b2a |
1321 | L<perlop/"Regexp Quote-Like Operators">. |
1322 | |
1e66bd83 |
1323 | L<perlop/"Gory details of parsing quoted constructs">. |
1324 | |
14218588 |
1325 | L<perlfaq6>. |
1326 | |
9b599b2a |
1327 | L<perlfunc/pos>. |
1328 | |
1329 | L<perllocale>. |
1330 | |
fb55449c |
1331 | L<perlebcdic>. |
1332 | |
14218588 |
1333 | I<Mastering Regular Expressions> by Jeffrey Friedl, published |
1334 | by O'Reilly and Associates. |