pod2man generated .IX lines upset whatis on Solaris
[p5sagit/p5-mst-13.2.git] / pod / perlre.pod
CommitLineData
a0d0e21e 1=head1 NAME
2
3perlre - Perl regular expressions
4
5=head1 DESCRIPTION
6
cb1a09d0 7This page describes the syntax of regular expressions in Perl. For a
5f05dabc 8description of how to I<use> regular expressions in matching
cb1a09d0 9operations, plus various examples of the same, see C<m//> and C<s///> in
10L<perlop>.
11
68dc0745 12The matching operations can have various modifiers. The modifiers
13which relate to the interpretation of the regular expression inside
14are listed below. For the modifiers that alter the behaviour of the
15operation, see L<perlop/"m//"> and L<perlop/"s//">.
a0d0e21e 16
55497cff 17=over 4
18
19=item i
20
21Do case-insensitive pattern matching.
22
a034a98d 23If C<use locale> is in effect, the case map is taken from the current
24locale. See L<perllocale>.
25
54310121 26=item m
55497cff 27
28Treat string as multiple lines. That is, change "^" and "$" from matching
5f05dabc 29at only the very start or end of the string to the start or end of any
55497cff 30line anywhere within the string,
31
54310121 32=item s
55497cff 33
34Treat string as single line. That is, change "." to match any character
35whatsoever, even a newline, which it normally would not match.
36
54310121 37=item x
55497cff 38
39Extend your pattern's legibility by permitting whitespace and comments.
40
41=back
a0d0e21e 42
43These are usually written as "the C</x> modifier", even though the delimiter
44in question might not actually be a slash. In fact, any of these
45modifiers may also be embedded within the regular expression itself using
46the new C<(?...)> construct. See below.
47
4633a7c4 48The C</x> modifier itself needs a little more explanation. It tells
55497cff 49the regular expression parser to ignore whitespace that is neither
50backslashed nor within a character class. You can use this to break up
4633a7c4 51your regular expression into (slightly) more readable parts. The C<#>
54310121 52character is also treated as a metacharacter introducing a comment,
55497cff 53just as in ordinary Perl code. This also means that if you want real
54whitespace or C<#> characters in the pattern that you'll have to either
55escape them or encode them using octal or hex escapes. Taken together,
56these features go a long way towards making Perl's regular expressions
57more readable. See the C comment deletion code in L<perlop>.
a0d0e21e 58
59=head2 Regular Expressions
60
61The patterns used in pattern matching are regular expressions such as
62those supplied in the Version 8 regexp routines. (In fact, the
63routines are derived (distantly) from Henry Spencer's freely
64redistributable reimplementation of the V8 routines.)
65See L<Version 8 Regular Expressions> for details.
66
67In particular the following metacharacters have their standard I<egrep>-ish
68meanings:
69
54310121 70 \ Quote the next metacharacter
a0d0e21e 71 ^ Match the beginning of the line
72 . Match any character (except newline)
c07a80fd 73 $ Match the end of the line (or before newline at the end)
a0d0e21e 74 | Alternation
75 () Grouping
76 [] Character class
77
5f05dabc 78By default, the "^" character is guaranteed to match at only the
79beginning of the string, the "$" character at only the end (or before the
a0d0e21e 80newline at the end) and Perl does certain optimizations with the
81assumption that the string contains only one line. Embedded newlines
82will not be matched by "^" or "$". You may, however, wish to treat a
4a6725af 83string as a multi-line buffer, such that the "^" will match after any
a0d0e21e 84newline within the string, and "$" will match before any newline. At the
85cost of a little more overhead, you can do this by using the /m modifier
86on the pattern match operator. (Older programs did this by setting C<$*>,
5f05dabc 87but this practice is now deprecated.)
a0d0e21e 88
4a6725af 89To facilitate multi-line substitutions, the "." character never matches a
55497cff 90newline unless you use the C</s> modifier, which in effect tells Perl to pretend
a0d0e21e 91the string is a single line--even if it isn't. The C</s> modifier also
92overrides the setting of C<$*>, in case you have some (badly behaved) older
93code that sets it in another module.
94
95The following standard quantifiers are recognized:
96
97 * Match 0 or more times
98 + Match 1 or more times
99 ? Match 1 or 0 times
100 {n} Match exactly n times
101 {n,} Match at least n times
102 {n,m} Match at least n but not more than m times
103
104(If a curly bracket occurs in any other context, it is treated
105as a regular character.) The "*" modifier is equivalent to C<{0,}>, the "+"
25f94b33 106modifier to C<{1,}>, and the "?" modifier to C<{0,1}>. n and m are limited
c07a80fd 107to integral values less than 65536.
a0d0e21e 108
54310121 109By default, a quantified subpattern is "greedy", that is, it will match as
110many times as possible (given a particular starting location) while still
111allowing the rest of the pattern to match. If you want it to match the
112minimum number of times possible, follow the quantifier with a "?". Note
113that the meanings don't change, just the "greediness":
a0d0e21e 114
115 *? Match 0 or more times
116 +? Match 1 or more times
117 ?? Match 0 or 1 time
118 {n}? Match exactly n times
119 {n,}? Match at least n times
120 {n,m}? Match at least n but not more than m times
121
5f05dabc 122Because patterns are processed as double quoted strings, the following
a0d0e21e 123also work:
124
0f36ee90 125 \t tab (HT, TAB)
126 \n newline (LF, NL)
127 \r return (CR)
128 \f form feed (FF)
129 \a alarm (bell) (BEL)
130 \e escape (think troff) (ESC)
cb1a09d0 131 \033 octal char (think of a PDP-11)
132 \x1B hex char
a0d0e21e 133 \c[ control char
cb1a09d0 134 \l lowercase next char (think vi)
135 \u uppercase next char (think vi)
136 \L lowercase till \E (think vi)
137 \U uppercase till \E (think vi)
138 \E end case modification (think vi)
a0d0e21e 139 \Q quote regexp metacharacters till \E
140
a034a98d 141If C<use locale> is in effect, the case map used by C<\l>, C<\L>, C<\u>
142and <\U> is taken from the current locale. See L<perllocale>.
143
a0d0e21e 144In addition, Perl defines the following:
145
146 \w Match a "word" character (alphanumeric plus "_")
147 \W Match a non-word character
148 \s Match a whitespace character
149 \S Match a non-whitespace character
150 \d Match a digit character
151 \D Match a non-digit character
152
153Note that C<\w> matches a single alphanumeric character, not a whole
a034a98d 154word. To match a word you'd need to say C<\w+>. If C<use locale> is in
155effect, the list of alphabetic characters generated by C<\w> is taken
156from the current locale. See L<perllocale>. You may use C<\w>, C<\W>,
157C<\s>, C<\S>, C<\d>, and C<\D> within character classes (though not as
158either end of a range).
a0d0e21e 159
160Perl defines the following zero-width assertions:
161
162 \b Match a word boundary
163 \B Match a non-(word boundary)
5f05dabc 164 \A Match at only beginning of string
165 \Z Match at only end of string (or before newline at the end)
a99df21c 166 \G Match only where previous m//g left off (works only with /g)
a0d0e21e 167
168A word boundary (C<\b>) is defined as a spot between two characters that
68dc0745 169has a C<\w> on one side of it and a C<\W> on the other side of it (in
a0d0e21e 170either order), counting the imaginary characters off the beginning and
171end of the string as matching a C<\W>. (Within character classes C<\b>
172represents backspace rather than a word boundary.) The C<\A> and C<\Z> are
173just like "^" and "$" except that they won't match multiple times when the
174C</m> modifier is used, while "^" and "$" will match at every internal line
c07a80fd 175boundary. To match the actual end of the string, not ignoring newline,
a99df21c 176you can use C<\Z(?!\n)>. The C<\G> assertion can be used to chain global
177matches (using C<m//g>), as described in
e7ea3e70 178L<perlop/"Regexp Quote-Like Operators">.
a99df21c 179
e7ea3e70 180It is also useful when writing C<lex>-like scanners, when you have several
181regexps which you want to match against consequent substrings of your
182string, see the previous reference.
44a8e56a 183The actual location where C<\G> will match can also be influenced
184by using C<pos()> as an lvalue. See L<perlfunc/pos>.
a0d0e21e 185
0f36ee90 186When the bracketing construct C<( ... )> is used, \E<lt>digitE<gt> matches the
cb1a09d0 187digit'th substring. Outside of the pattern, always use "$" instead of "\"
0f36ee90 188in front of the digit. (While the \E<lt>digitE<gt> notation can on rare occasion work
cb1a09d0 189outside the current pattern, this should not be relied upon. See the
0f36ee90 190WARNING below.) The scope of $E<lt>digitE<gt> (and C<$`>, C<$&>, and C<$'>)
cb1a09d0 191extends to the end of the enclosing BLOCK or eval string, or to the next
192successful pattern match, whichever comes first. If you want to use
5f05dabc 193parentheses to delimit a subpattern (e.g., a set of alternatives) without
84dc3c4d 194saving it as a subpattern, follow the ( with a ?:.
cb1a09d0 195
196You may have as many parentheses as you wish. If you have more
a0d0e21e 197than 9 substrings, the variables $10, $11, ... refer to the
198corresponding substring. Within the pattern, \10, \11, etc. refer back
5f05dabc 199to substrings if there have been at least that many left parentheses before
c07a80fd 200the backreference. Otherwise (for backward compatibility) \10 is the
a0d0e21e 201same as \010, a backspace, and \11 the same as \011, a tab. And so
202on. (\1 through \9 are always backreferences.)
203
204C<$+> returns whatever the last bracket match matched. C<$&> returns the
0f36ee90 205entire matched string. (C<$0> used to return the same thing, but not any
a0d0e21e 206more.) C<$`> returns everything before the matched string. C<$'> returns
207everything after the matched string. Examples:
208
209 s/^([^ ]*) *([^ ]*)/$2 $1/; # swap first two words
210
211 if (/Time: (..):(..):(..)/) {
212 $hours = $1;
213 $minutes = $2;
214 $seconds = $3;
215 }
216
68dc0745 217Once perl sees that you need one of C<$&>, C<$`> or C<$'> anywhere in
218the program, it has to provide them on each and every pattern match.
219This can slow your program down. The same mechanism that handles
220these provides for the use of $1, $2, etc., so you pay the same price
221for each regexp that contains capturing parentheses. But if you never
222use $&, etc., in your script, then regexps I<without> capturing
223parentheses won't be penalized. So avoid $&, $', and $` if you can,
224but if you can't (and some algorithms really appreciate them), once
225you've used them once, use them at will, because you've already paid
226the price.
227
a0d0e21e 228You will note that all backslashed metacharacters in Perl are
229alphanumeric, such as C<\b>, C<\w>, C<\n>. Unlike some other regular expression
230languages, there are no backslashed symbols that aren't alphanumeric.
0f36ee90 231So anything that looks like \\, \(, \), \E<lt>, \E<gt>, \{, or \} is always
54310121 232interpreted as a literal character, not a metacharacter. This makes it
a0d0e21e 233simple to quote a string that you want to use for a pattern but that
5f05dabc 234you are afraid might contain metacharacters. Quote simply all the
a0d0e21e 235non-alphanumeric characters:
236
237 $pattern =~ s/(\W)/\\$1/g;
238
54310121 239You can also use the builtin quotemeta() function to do this.
a0d0e21e 240An even easier way to quote metacharacters right in the match operator
c07a80fd 241is to say
a0d0e21e 242
243 /$unquoted\Q$quoted\E$unquoted/
244
5f05dabc 245Perl defines a consistent extension syntax for regular expressions.
246The syntax is a pair of parentheses with a question mark as the first
247thing within the parentheses (this was a syntax error in older
248versions of Perl). The character after the question mark gives the
249function of the extension. Several extensions are already supported:
a0d0e21e 250
251=over 10
252
253=item (?#text)
254
cb1a09d0 255A comment. The text is ignored. If the C</x> switch is used to enable
256whitespace formatting, a simple C<#> will suffice.
a0d0e21e 257
258=item (?:regexp)
259
0f36ee90 260This groups things like "()" but doesn't make backreferences like "()" does. So
a0d0e21e 261
262 split(/\b(?:a|b|c)\b/)
263
264is like
265
266 split(/\b(a|b|c)\b/)
267
268but doesn't spit out extra fields.
269
270=item (?=regexp)
271
272A zero-width positive lookahead assertion. For example, C</\w+(?=\t)/>
273matches a word followed by a tab, without including the tab in C<$&>.
274
275=item (?!regexp)
276
277A zero-width negative lookahead assertion. For example C</foo(?!bar)/>
278matches any occurrence of "foo" that isn't followed by "bar". Note
279however that lookahead and lookbehind are NOT the same thing. You cannot
280use this for lookbehind: C</(?!foo)bar/> will not find an occurrence of
281"bar" that is preceded by something which is not "foo". That's because
282the C<(?!foo)> is just saying that the next thing cannot be "foo"--and
283it's not, it's a "bar", so "foobar" will match. You would have to do
0f36ee90 284something like C</(?!foo)...bar/> for that. We say "like" because there's
a0d0e21e 285the case of your "bar" not having three characters before it. You could
c07a80fd 286cover that this way: C</(?:(?!foo)...|^..?)bar/>. Sometimes it's still
a0d0e21e 287easier just to say:
288
c07a80fd 289 if (/foo/ && $` =~ /bar$/)
a0d0e21e 290
291
292=item (?imsx)
293
294One or more embedded pattern-match modifiers. This is particularly
295useful for patterns that are specified in a table somewhere, some of
296which want to be case sensitive, and some of which don't. The case
5f05dabc 297insensitive ones need to include merely C<(?i)> at the front of the
a0d0e21e 298pattern. For example:
299
300 $pattern = "foobar";
c07a80fd 301 if ( /$pattern/i )
a0d0e21e 302
303 # more flexible:
304
305 $pattern = "(?i)foobar";
c07a80fd 306 if ( /$pattern/ )
a0d0e21e 307
308=back
309
310The specific choice of question mark for this and the new minimal
311matching construct was because 1) question mark is pretty rare in older
312regular expressions, and 2) whenever you see one, you should stop
313and "question" exactly what is going on. That's psychology...
314
c07a80fd 315=head2 Backtracking
316
317A fundamental feature of regular expression matching involves the notion
318called I<backtracking>. which is used (when needed) by all regular
319expression quantifiers, namely C<*>, C<*?>, C<+>, C<+?>, C<{n,m}>, and
320C<{n,m}?>.
321
322For a regular expression to match, the I<entire> regular expression must
323match, not just part of it. So if the beginning of a pattern containing a
324quantifier succeeds in a way that causes later parts in the pattern to
325fail, the matching engine backs up and recalculates the beginning
326part--that's why it's called backtracking.
327
328Here is an example of backtracking: Let's say you want to find the
329word following "foo" in the string "Food is on the foo table.":
330
331 $_ = "Food is on the foo table.";
332 if ( /\b(foo)\s+(\w+)/i ) {
333 print "$2 follows $1.\n";
334 }
335
336When the match runs, the first part of the regular expression (C<\b(foo)>)
337finds a possible match right at the beginning of the string, and loads up
338$1 with "Foo". However, as soon as the matching engine sees that there's
339no whitespace following the "Foo" that it had saved in $1, it realizes its
68dc0745 340mistake and starts over again one character after where it had the
c07a80fd 341tentative match. This time it goes all the way until the next occurrence
342of "foo". The complete regular expression matches this time, and you get
343the expected output of "table follows foo."
344
345Sometimes minimal matching can help a lot. Imagine you'd like to match
346everything between "foo" and "bar". Initially, you write something
347like this:
348
349 $_ = "The food is under the bar in the barn.";
350 if ( /foo(.*)bar/ ) {
351 print "got <$1>\n";
352 }
353
354Which perhaps unexpectedly yields:
355
356 got <d is under the bar in the >
357
358That's because C<.*> was greedy, so you get everything between the
359I<first> "foo" and the I<last> "bar". In this case, it's more effective
360to use minimal matching to make sure you get the text between a "foo"
361and the first "bar" thereafter.
362
363 if ( /foo(.*?)bar/ ) { print "got <$1>\n" }
364 got <d is under the >
365
366Here's another example: let's say you'd like to match a number at the end
367of a string, and you also want to keep the preceding part the match.
368So you write this:
369
370 $_ = "I have 2 numbers: 53147";
371 if ( /(.*)(\d*)/ ) { # Wrong!
372 print "Beginning is <$1>, number is <$2>.\n";
373 }
374
375That won't work at all, because C<.*> was greedy and gobbled up the
376whole string. As C<\d*> can match on an empty string the complete
377regular expression matched successfully.
378
8e1088bc 379 Beginning is <I have 2 numbers: 53147>, number is <>.
c07a80fd 380
381Here are some variants, most of which don't work:
382
383 $_ = "I have 2 numbers: 53147";
384 @pats = qw{
385 (.*)(\d*)
386 (.*)(\d+)
387 (.*?)(\d*)
388 (.*?)(\d+)
389 (.*)(\d+)$
390 (.*?)(\d+)$
391 (.*)\b(\d+)$
392 (.*\D)(\d+)$
393 };
394
395 for $pat (@pats) {
396 printf "%-12s ", $pat;
397 if ( /$pat/ ) {
398 print "<$1> <$2>\n";
399 } else {
400 print "FAIL\n";
401 }
402 }
403
404That will print out:
405
406 (.*)(\d*) <I have 2 numbers: 53147> <>
407 (.*)(\d+) <I have 2 numbers: 5314> <7>
408 (.*?)(\d*) <> <>
409 (.*?)(\d+) <I have > <2>
410 (.*)(\d+)$ <I have 2 numbers: 5314> <7>
411 (.*?)(\d+)$ <I have 2 numbers: > <53147>
412 (.*)\b(\d+)$ <I have 2 numbers: > <53147>
413 (.*\D)(\d+)$ <I have 2 numbers: > <53147>
414
415As you see, this can be a bit tricky. It's important to realize that a
416regular expression is merely a set of assertions that gives a definition
417of success. There may be 0, 1, or several different ways that the
418definition might succeed against a particular string. And if there are
5f05dabc 419multiple ways it might succeed, you need to understand backtracking to know which variety of success you will achieve.
c07a80fd 420
421When using lookahead assertions and negations, this can all get even
54310121 422tricker. Imagine you'd like to find a sequence of non-digits not
c07a80fd 423followed by "123". You might try to write that as
424
425 $_ = "ABC123";
426 if ( /^\D*(?!123)/ ) { # Wrong!
427 print "Yup, no 123 in $_\n";
428 }
429
430But that isn't going to match; at least, not the way you're hoping. It
431claims that there is no 123 in the string. Here's a clearer picture of
432why it that pattern matches, contrary to popular expectations:
433
434 $x = 'ABC123' ;
435 $y = 'ABC445' ;
436
437 print "1: got $1\n" if $x =~ /^(ABC)(?!123)/ ;
438 print "2: got $1\n" if $y =~ /^(ABC)(?!123)/ ;
439
440 print "3: got $1\n" if $x =~ /^(\D*)(?!123)/ ;
441 print "4: got $1\n" if $y =~ /^(\D*)(?!123)/ ;
442
443This prints
444
445 2: got ABC
446 3: got AB
447 4: got ABC
448
5f05dabc 449You might have expected test 3 to fail because it seems to a more
c07a80fd 450general purpose version of test 1. The important difference between
451them is that test 3 contains a quantifier (C<\D*>) and so can use
452backtracking, whereas test 1 will not. What's happening is
453that you've asked "Is it true that at the start of $x, following 0 or more
5f05dabc 454non-digits, you have something that's not 123?" If the pattern matcher had
c07a80fd 455let C<\D*> expand to "ABC", this would have caused the whole pattern to
54310121 456fail.
c07a80fd 457The search engine will initially match C<\D*> with "ABC". Then it will
458try to match C<(?!123> with "123" which, of course, fails. But because
459a quantifier (C<\D*>) has been used in the regular expression, the
460search engine can backtrack and retry the match differently
54310121 461in the hope of matching the complete regular expression.
c07a80fd 462
54310121 463Well now,
c07a80fd 464the pattern really, I<really> wants to succeed, so it uses the
5f05dabc 465standard regexp back-off-and-retry and lets C<\D*> expand to just "AB" this
c07a80fd 466time. Now there's indeed something following "AB" that is not
467"123". It's in fact "C123", which suffices.
468
469We can deal with this by using both an assertion and a negation. We'll
470say that the first part in $1 must be followed by a digit, and in fact, it
471must also be followed by something that's not "123". Remember that the
472lookaheads are zero-width expressions--they only look, but don't consume
473any of the string in their match. So rewriting this way produces what
474you'd expect; that is, case 5 will fail, but case 6 succeeds:
475
476 print "5: got $1\n" if $x =~ /^(\D*)(?=\d)(?!123)/ ;
477 print "6: got $1\n" if $y =~ /^(\D*)(?=\d)(?!123)/ ;
478
479 6: got ABC
480
481In other words, the two zero-width assertions next to each other work like
482they're ANDed together, just as you'd use any builtin assertions: C</^$/>
483matches only if you're at the beginning of the line AND the end of the
484line simultaneously. The deeper underlying truth is that juxtaposition in
485regular expressions always means AND, except when you write an explicit OR
486using the vertical bar. C</ab/> means match "a" AND (then) match "b",
487although the attempted matches are made at different positions because "a"
488is not a zero-width assertion, but a one-width assertion.
489
490One warning: particularly complicated regular expressions can take
491exponential time to solve due to the immense number of possible ways they
492can use backtracking to try match. For example this will take a very long
493time to run
494
495 /((a{0,5}){0,5}){0,5}/
496
497And if you used C<*>'s instead of limiting it to 0 through 5 matches, then
498it would take literally forever--or until you ran out of stack space.
499
a0d0e21e 500=head2 Version 8 Regular Expressions
501
502In case you're not familiar with the "regular" Version 8 regexp
503routines, here are the pattern-matching rules not described above.
504
54310121 505Any single character matches itself, unless it is a I<metacharacter>
a0d0e21e 506with a special meaning described here or above. You can cause
507characters which normally function as metacharacters to be interpreted
5f05dabc 508literally by prefixing them with a "\" (e.g., "\." matches a ".", not any
a0d0e21e 509character; "\\" matches a "\"). A series of characters matches that
510series of characters in the target string, so the pattern C<blurfl>
511would match "blurfl" in the target string.
512
513You can specify a character class, by enclosing a list of characters
514in C<[]>, which will match any one of the characters in the list. If the
515first character after the "[" is "^", the class matches any character not
516in the list. Within a list, the "-" character is used to specify a
517range, so that C<a-z> represents all the characters between "a" and "z",
84850974 518inclusive. If you want "-" itself to be a member of a class, put it
519at the start or end of the list, or escape it with a backslash. (The
520following all specify the same class of three characters: C<[-az]>,
521C<[az-]>, and C<[a\-z]>. All are different from C<[a-z]>, which
522specifies a class containing twenty-six characters.)
a0d0e21e 523
54310121 524Characters may be specified using a metacharacter syntax much like that
a0d0e21e 525used in C: "\n" matches a newline, "\t" a tab, "\r" a carriage return,
526"\f" a form feed, etc. More generally, \I<nnn>, where I<nnn> is a string
527of octal digits, matches the character whose ASCII value is I<nnn>.
0f36ee90 528Similarly, \xI<nn>, where I<nn> are hexadecimal digits, matches the
a0d0e21e 529character whose ASCII value is I<nn>. The expression \cI<x> matches the
54310121 530ASCII character control-I<x>. Finally, the "." metacharacter matches any
a0d0e21e 531character except "\n" (unless you use C</s>).
532
533You can specify a series of alternatives for a pattern using "|" to
534separate them, so that C<fee|fie|foe> will match any of "fee", "fie",
535or "foe" in the target string (as would C<f(e|i|o)e>). Note that the
536first alternative includes everything from the last pattern delimiter
537("(", "[", or the beginning of the pattern) up to the first "|", and
538the last alternative contains everything from the last "|" to the next
539pattern delimiter. For this reason, it's common practice to include
540alternatives in parentheses, to minimize confusion about where they
748a9306 541start and end. Note however that "|" is interpreted as a literal with
542square brackets, so if you write C<[fee|fie|foe]> you're really only
543matching C<[feio|]>.
a0d0e21e 544
54310121 545Within a pattern, you may designate subpatterns for later reference by
a0d0e21e 546enclosing them in parentheses, and you may refer back to the I<n>th
54310121 547subpattern later in the pattern using the metacharacter \I<n>.
548Subpatterns are numbered based on the left to right order of their
a0d0e21e 549opening parenthesis. Note that a backreference matches whatever
54310121 550actually matched the subpattern in the string being examined, not the
551rules for that subpattern. Therefore, C<(0|0x)\d*\s\1\d*> will
552match "0x1234 0x4321",but not "0x1234 01234", because subpattern 1
748a9306 553actually matched "0x", even though the rule C<0|0x> could
a0d0e21e 554potentially match the leading 0 in the second number.
cb1a09d0 555
556=head2 WARNING on \1 vs $1
557
558Some people get too used to writing things like
559
560 $pattern =~ s/(\W)/\\\1/g;
561
562This is grandfathered for the RHS of a substitute to avoid shocking the
563B<sed> addicts, but it's a dirty habit to get into. That's because in
5f05dabc 564PerlThink, the righthand side of a C<s///> is a double-quoted string. C<\1> in
cb1a09d0 565the usual double-quoted string means a control-A. The customary Unix
566meaning of C<\1> is kludged in for C<s///>. However, if you get into the habit
567of doing that, you get yourself into trouble if you then add an C</e>
568modifier.
569
570 s/(\d+)/ \1 + 1 /eg;
571
572Or if you try to do
573
574 s/(\d+)/\1000/;
575
576You can't disambiguate that by saying C<\{1}000>, whereas you can fix it with
577C<${1}000>. Basically, the operation of interpolation should not be confused
578with the operation of matching a backreference. Certainly they mean two
579different things on the I<left> side of the C<s///>.
9fa51da4 580
581=head2 SEE ALSO
582
583"Mastering Regular Expressions" (see L<perlbook>) by Jeffrey Friedl.