2 X<regular expression> X<regex> X<regexp>
4 perlre - Perl regular expressions
8 This page describes the syntax of regular expressions in Perl.
10 If you haven't used regular expressions before, a tutorial introduction
11 is available in L<perlretut>. If you know just a little about them,
12 a quick-start introduction is available in L<perlrequick>.
14 Except for L</The Basics> section, this page assumes you are familiar
15 with regular expression basics, like what is a "pattern", what does it
16 look like, and how it is basically used. For a reference on how they
17 are used, plus various examples of the same, see discussions of C<m//>,
18 C<s///>, C<qr//> and C<"??"> in L<perlop/"Regexp Quote-Like Operators">.
20 New in v5.22, L<C<use re 'strict'>|re/'strict' mode> applies stricter
21 rules than otherwise when compiling regular expression patterns. It can
22 find things that, while legal, may not be what you intended.
25 X<regular expression, version 8> X<regex, version 8> X<regexp, version 8>
27 Regular expressions are strings with the very particular syntax and
28 meaning described in this document and auxiliary documents referred to
29 by this one. The strings are called "patterns". Patterns are used to
30 determine if some other string, called the "target", has (or doesn't
31 have) the characteristics specified by the pattern. We call this
32 "matching" the target string against the pattern. Usually the match is
33 done by having the target be the first operand, and the pattern be the
34 second operand, of one of the two binary operators C<=~> and C<!~>,
35 listed in L<perlop/Binding Operators>; and the pattern will have been
36 converted from an ordinary string by one of the operators in
37 L<perlop/"Regexp Quote-Like Operators">, like so:
41 This evaluates to true if and only if the string in the variable C<$foo>
42 contains somewhere in it, the sequence of characters "a", "b", then "c".
43 (The C<=~ m>, or match operator, is described in
44 L<perlop/m/PATTERN/msixpodualngc>.)
46 Patterns that aren't already stored in some variable must be delimitted,
47 at both ends, by delimitter characters. These are often, as in the
48 example above, forward slashes, and the typical way a pattern is written
49 in documentation is with those slashes. In most cases, the delimitter
50 is the same character, fore and aft, but there are a few cases where a
51 character looks like it has a mirror-image mate, where the opening
52 version is the beginning delimiter, and the closing one is the ending
57 Most times, the pattern is evaluated in double-quotish context, but it
58 is possible to choose delimiters to force single-quotish, like
62 If the pattern contains its delimiter within it, that delimiter must be
63 escaped. Prefixing it with a backslash (I<e.g.>, C<"/foo\/bar/">)
66 Any single character in a pattern matches that same character in the
67 target string, unless the character is a I<metacharacter> with a special
68 meaning described in this document. A sequence of non-metacharacters
69 matches the same sequence in the target string, as we saw above with
72 Only a few characters (all of them being ASCII punctuation characters)
73 are metacharacters. The most commonly used one is a dot C<".">, which
74 normally matches almost any character (including a dot itself).
76 You can cause characters that normally function as metacharacters to be
77 interpreted literally by prefixing them with a C<"\">, just like the
78 pattern's delimiter must be escaped if it also occurs within the
79 pattern. Thus, C<"\."> matches just a literal dot, C<"."> instead of
80 its normal meaning. This means that the backslash is also a
81 metacharacter, so C<"\\"> matches a single C<"\">. And a sequence that
82 contains an escaped metacharacter matches the same sequence (but without
83 the escape) in the target string. So, the pattern C</blur\\fl/> would
84 match any target string that contains the sequence C<"blur\fl">.
86 The metacharacter C<"|"> is used to match one thing or another. Thus
90 is TRUE if and only if C<$foo> contains either the sequence C<"this"> or
91 the sequence C<"that">. Like all metacharacters, prefixing the C<"|">
92 with a backslash makes it match the plain punctuation character; in its
93 case, the VERTICAL LINE.
97 is TRUE if and only if C<$foo> contains the sequence C<"this|that">.
99 You aren't limited to just a single C<"|">.
101 $foo =~ m/fee|fie|foe|fum/
103 is TRUE if and only if C<$foo> contains any of those 4 sequences from
104 the children's story "Jack and the Beanstalk".
106 As you can see, the C<"|"> binds less tightly than a sequence of
107 ordinary characters. We can override this by using the grouping
108 metacharacters, the parentheses C<"("> and C<")">.
110 $foo =~ m/th(is|at) thing/
112 is TRUE if and only if C<$foo> contains either the sequence S<C<"this
113 thing">> or the sequence S<C<"that thing">>. The portions of the string
114 that match the portions of the pattern enclosed in parentheses are
115 normally made available separately for use later in the pattern,
116 substitution, or program. This is called "capturing", and it can get
117 complicated. See L</Capture groups>.
119 The first alternative includes everything from the last pattern
120 delimiter (C<"(">, C<"(?:"> (described later), I<etc>. or the beginning
121 of the pattern) up to the first C<"|">, and the last alternative
122 contains everything from the last C<"|"> to the next closing pattern
123 delimiter. That's why it's common practice to include alternatives in
124 parentheses: to minimize confusion about where they start and end.
126 Alternatives are tried from left to right, so the first
127 alternative found for which the entire expression matches, is the one that
128 is chosen. This means that alternatives are not necessarily greedy. For
129 example: when matching C<foo|foot> against C<"barefoot">, only the C<"foo">
130 part will match, as that is the first alternative tried, and it successfully
131 matches the target string. (This might not seem important, but it is
132 important when you are capturing matched text using parentheses.)
134 Besides taking away the special meaning of a metacharacter, a prefixed
135 backslash changes some letter and digit characters away from matching
136 just themselves to instead have special meaning. These are called
137 "escape sequences", and all such are described in L<perlrebackslash>. A
138 backslash sequence (of a letter or digit) that doesn't currently have
139 special meaning to Perl will raise a warning if warnings are enabled,
140 as those are reserved for potential future use.
142 One such sequence is C<\b>, which matches a boundary of some sort.
143 C<\b{wb}> and a few others give specialized types of boundaries.
144 (They are all described in detail starting at
145 L<perlrebackslash/\b{}, \b, \B{}, \B>.) Note that these don't match
146 characters, but the zero-width spaces between characters. They are an
147 example of a L<zero-width assertion|/Assertions>. Consider again,
149 $foo =~ m/fee|fie|foe|fum/
151 It evaluates to TRUE if, besides those 4 words, any of the sequences
152 "feed", "field", "Defoe", "fume", and many others are in C<$foo>. By
153 judicious use of C<\b> (or better (because it is designed to handle
154 natural language) C<\b{wb}>), we can make sure that only the Giant's
157 $foo =~ m/\b(fee|fie|foe|fum)\b/
158 $foo =~ m/\b{wb}(fee|fie|foe|fum)\b{wb}/
160 The final example shows that the characters C<"{"> and C<"}"> are
163 Another use for escape sequences is to specify characters that cannot
164 (or which you prefer not to) be written literally. These are described
165 in detail in L<perlrebackslash/Character Escapes>, but the next three
166 paragraphs briefly describe some of them.
168 Various control characters can be written in C language style: C<"\n">
169 matches a newline, C<"\t"> a tab, C<"\r"> a carriage return, C<"\f"> a
172 More generally, C<\I<nnn>>, where I<nnn> is a string of three octal
173 digits, matches the character whose native code point is I<nnn>. You
174 can easily run into trouble if you don't have exactly three digits. So
175 always use three, or since Perl 5.14, you can use C<\o{...}> to specify
176 any number of octal digits.
178 Similarly, C<\xI<nn>>, where I<nn> are hexadecimal digits, matches the
179 character whose native ordinal is I<nn>. Again, not using exactly two
180 digits is a recipe for disaster, but you can use C<\x{...}> to specify
181 any number of hex digits.
183 Besides being a metacharacter, the C<"."> is an example of a "character
184 class", something that can match any single character of a given set of
185 them. In its case, the set is just about all possible characters. Perl
186 predefines several character classes besides the C<".">; there is a
187 separate reference page about just these, L<perlrecharclass>.
189 You can define your own custom character classes, by putting into your
190 pattern in the appropriate place(s), a list of all the characters you
191 want in the set. You do this by enclosing the list within C<[]> bracket
192 characters. These are called "bracketed character classes" when we are
193 being precise, but often the word "bracketed" is dropped. (Dropping it
194 usually doesn't cause confusion.) This means that the C<"["> character
195 is another metacharacter. It doesn't match anything just by itself; it
196 is used only to tell Perl that what follows it is a bracketed character
197 class. If you want to match a literal left square bracket, you must
198 escape it, like C<"\[">. The matching C<"]"> is also a metacharacter;
199 again it doesn't match anything by itself, but just marks the end of
200 your custom class to Perl. It is an example of a "sometimes
201 metacharacter". It isn't a metacharacter if there is no corresponding
202 C<"[">, and matches its literal self:
204 print "]" =~ /]/; # prints 1
206 The list of characters within the character class gives the set of
207 characters matched by the class. C<"[abc]"> matches a single "a" or "b"
208 or "c". But if the first character after the C<"["> is C<"^">, the
209 class instead matches any character not in the list. Within a list, the
210 C<"-"> character specifies a range of characters, so that C<a-z>
211 represents all characters between "a" and "z", inclusive. If you want
212 either C<"-"> or C<"]"> itself to be a member of a class, put it at the
213 start of the list (possibly after a C<"^">), or escape it with a
214 backslash. C<"-"> is also taken literally when it is at the end of the
215 list, just before the closing C<"]">. (The following all specify the
216 same class of three characters: C<[-az]>, C<[az-]>, and C<[a\-z]>. All
217 are different from C<[a-z]>, which specifies a class containing
218 twenty-six characters, even on EBCDIC-based character sets.)
220 There is lots more to bracketed character classes; full details are in
221 L<perlrecharclass/Bracketed Character Classes>.
223 =head3 Metacharacters
225 X<\> X<^> X<.> X<$> X<|> X<(> X<()> X<[> X<[]>
227 L</The Basics> introduced some of the metacharacters. This section
228 gives them all. Most of them have the same meaning as in the I<egrep>
231 Only the C<"\"> is always a metacharacter. The others are metacharacters
232 just sometimes. The following tables lists all of them, summarizes
233 their use, and gives the contexts where they are metacharacters.
234 Outside those contexts or if prefixed by a C<"\">, they match their
235 corresponding punctuation character. In some cases, their meaning
236 varies depending on various pattern modifiers that alter the default
237 behaviors. See L</Modifiers>.
241 \ Escape the next character Always, except when
243 ^ Match the beginning of the string Not in []
244 (or line, if /m is used)
245 ^ Complement the [] class At the beginning of []
246 . Match any single character except newline Not in []
247 (under /s, includes newline)
248 $ Match the end of the string Not in [], but can
249 (or before newline at the end of the mean interpolate a
250 string; or before any newline if /m is scalar
252 | Alternation Not in []
253 () Grouping Not in []
254 [ Start Bracketed Character class Not in []
255 ] End Bracketed Character class Only in [], and
257 * Matches the preceding element 0 or more Not in []
259 + Matches the preceding element 1 or more Not in []
261 ? Matches the preceding element 0 or 1 Not in []
263 { Starts a sequence that gives number(s) Not in []
264 of times the preceding element can be
266 { when following certain escape sequences
267 starts a modifier to the meaning of the
269 } End sequence started by {
270 - Indicates a range Only in [] interior
271 # Beginning of comment, extends to line end Only with /x modifier
273 Notice that most of the metacharacters lose their special meaning when
274 they occur in a bracketed character class, except C<"^"> has a different
275 meaning when it is at the beginning of such a class. And C<"-"> and C<"]">
276 are metacharacters only at restricted positions within bracketed
277 character classes; while C<"}"> is a metacharacter only when closing a
278 special construct started by C<"{">.
280 In double-quotish context, as is usually the case, you need to be
281 careful about C<"$"> and the non-metacharacter C<"@">. Those could
282 interpolate variables, which may or may not be what you intended.
284 These rules were designed for compactness of expression, rather than
285 legibility and maintainability. The L</E<sol>x and E<sol>xx> pattern
286 modifiers allow you to insert white space to improve readability. And
287 use of S<C<L<re 'strict'|re/'strict' mode>>> adds extra checking to
288 catch some typos that might silently compile into something unintended.
290 By default, the C<"^"> character is guaranteed to match only the
291 beginning of the string, the C<"$"> character only the end (or before the
292 newline at the end), and Perl does certain optimizations with the
293 assumption that the string contains only one line. Embedded newlines
294 will not be matched by C<"^"> or C<"$">. You may, however, wish to treat a
295 string as a multi-line buffer, such that the C<"^"> will match after any
296 newline within the string (except if the newline is the last character in
297 the string), and C<"$"> will match before any newline. At the
298 cost of a little more overhead, you can do this by using the
299 C<L</E<sol>m>> modifier on the pattern match operator. (Older programs
300 did this by setting C<$*>, but this option was removed in perl 5.10.)
303 To simplify multi-line substitutions, the C<"."> character never matches a
304 newline unless you use the L<C<E<sol>s>|/s> modifier, which in effect tells
305 Perl to pretend the string is a single line--even if it isn't.
312 The default behavior for matching can be changed, using various
313 modifiers. Modifiers that relate to the interpretation of the pattern
314 are listed just below. Modifiers that alter the way a pattern is used
315 by Perl are detailed in L<perlop/"Regexp Quote-Like Operators"> and
316 L<perlop/"Gory details of parsing quoted constructs">.
321 X</m> X<regex, multiline> X<regexp, multiline> X<regular expression, multiline>
323 Treat the string being matched against as multiple lines. That is, change C<"^"> and C<"$"> from matching
324 the start of the string's first line and the end of its last line to
325 matching the start and end of each line within the string.
328 X</s> X<regex, single-line> X<regexp, single-line>
329 X<regular expression, single-line>
331 Treat the string as single line. That is, change C<"."> to match any character
332 whatsoever, even a newline, which normally it would not match.
334 Used together, as C</ms>, they let the C<"."> match any character whatsoever,
335 while still allowing C<"^"> and C<"$"> to match, respectively, just after
336 and just before newlines within the string.
339 X</i> X<regex, case-insensitive> X<regexp, case-insensitive>
340 X<regular expression, case-insensitive>
342 Do case-insensitive pattern matching. For example, "A" will match "a"
345 If locale matching rules are in effect, the case map is taken from the
347 locale for code points less than 255, and from Unicode rules for larger
348 code points. However, matches that would cross the Unicode
349 rules/non-Unicode rules boundary (ords 255/256) will not succeed, unless
350 the locale is a UTF-8 one. See L<perllocale>.
352 There are a number of Unicode characters that match a sequence of
353 multiple characters under C</i>. For example,
354 C<LATIN SMALL LIGATURE FI> should match the sequence C<fi>. Perl is not
355 currently able to do this when the multiple characters are in the pattern and
356 are split between groupings, or when one or more are quantified. Thus
358 "\N{LATIN SMALL LIGATURE FI}" =~ /fi/i; # Matches
359 "\N{LATIN SMALL LIGATURE FI}" =~ /[fi][fi]/i; # Doesn't match!
360 "\N{LATIN SMALL LIGATURE FI}" =~ /fi*/i; # Doesn't match!
362 # The below doesn't match, and it isn't clear what $1 and $2 would
363 # be even if it did!!
364 "\N{LATIN SMALL LIGATURE FI}" =~ /(f)(i)/i; # Doesn't match!
366 Perl doesn't match multiple characters in a bracketed
367 character class unless the character that maps to them is explicitly
368 mentioned, and it doesn't match them at all if the character class is
369 inverted, which otherwise could be highly confusing. See
370 L<perlrecharclass/Bracketed Character Classes>, and
371 L<perlrecharclass/Negation>.
373 =item B<C<x>> and B<C<xx>>
376 Extend your pattern's legibility by permitting whitespace and comments.
377 Details in L</E<sol>x and E<sol>xx>
380 X</p> X<regex, preserve> X<regexp, preserve>
382 Preserve the string matched such that C<${^PREMATCH}>, C<${^MATCH}>, and
383 C<${^POSTMATCH}> are available for use after matching.
385 In Perl 5.20 and higher this is ignored. Due to a new copy-on-write
386 mechanism, C<${^PREMATCH}>, C<${^MATCH}>, and C<${^POSTMATCH}> will be available
387 after the match regardless of the modifier.
389 =item B<C<a>>, B<C<d>>, B<C<l>>, and B<C<u>>
390 X</a> X</d> X</l> X</u>
392 These modifiers, all new in 5.14, affect which character-set rules
393 (Unicode, I<etc>.) are used, as described below in
394 L</Character set modifiers>.
397 X</n> X<regex, non-capture> X<regexp, non-capture>
398 X<regular expression, non-capture>
400 Prevent the grouping metacharacters C<()> from capturing. This modifier,
401 new in 5.22, will stop C<$1>, C<$2>, I<etc>... from being filled in.
403 "hello" =~ /(hi|hello)/; # $1 is "hello"
404 "hello" =~ /(hi|hello)/n; # $1 is undef
406 This is equivalent to putting C<?:> at the beginning of every capturing group:
408 "hello" =~ /(?:hi|hello)/; # $1 is undef
410 C</n> can be negated on a per-group basis. Alternatively, named captures
413 "hello" =~ /(?-n:(hi|hello))/n; # $1 is "hello"
414 "hello" =~ /(?<greet>hi|hello)/n; # $1 is "hello", $+{greet} is
417 =item Other Modifiers
419 There are a number of flags that can be found at the end of regular
420 expression constructs that are I<not> generic regular expression flags, but
421 apply to the operation being performed, like matching or substitution (C<m//>
422 or C<s///> respectively).
424 Flags described further in
425 L<perlretut/"Using regular expressions in Perl"> are:
427 c - keep the current position during repeated matching
428 g - globally match the pattern repeatedly in the string
430 Substitution-specific modifiers described in
431 L<perlop/"s/PATTERN/REPLACEMENT/msixpodualngcer"> are:
433 e - evaluate the right-hand side as an expression
434 ee - evaluate the right side as a string then eval the result
435 o - pretend to optimize your code, but actually introduce bugs
436 r - perform non-destructive substitution and return the new value
440 Regular expression modifiers are usually written in documentation
441 as I<e.g.>, "the C</x> modifier", even though the delimiter
442 in question might not really be a slash. The modifiers C</imnsxadlup>
443 may also be embedded within the regular expression itself using
444 the C<(?...)> construct, see L</Extended Patterns> below.
446 =head3 Details on some modifiers
448 Some of the modifiers require more explanation than given in the
451 =head4 C</x> and C</xx>
454 the regular expression parser to ignore most whitespace that is neither
455 backslashed nor within a bracketed character class. You can use this to
456 break up your regular expression into more readable parts.
457 Also, the C<"#"> character is treated as a metacharacter introducing a
458 comment that runs up to the pattern's closing delimiter, or to the end
459 of the current line if the pattern extends onto the next line. Hence,
460 this is very much like an ordinary Perl code comment. (You can include
461 the closing delimiter within the comment only if you precede it with a
462 backslash, so be careful!)
464 Use of C</x> means that if you want real
465 whitespace or C<"#"> characters in the pattern (outside a bracketed character
466 class, which is unaffected by C</x>), then you'll either have to
467 escape them (using backslashes or C<\Q...\E>) or encode them using octal,
468 hex, or C<\N{}> or C<\p{name=...}> escapes.
469 It is ineffective to try to continue a comment onto the next line by
470 escaping the C<\n> with a backslash or C<\Q>.
472 You can use L</(?#text)> to create a comment that ends earlier than the
473 end of the current line, but C<text> also can't contain the closing
474 delimiter unless escaped with a backslash.
476 A common pitfall is to forget that C<"#"> characters begin a comment under
477 C</x> and are not matched literally. Just keep that in mind when trying
478 to puzzle out why a particular C</x> pattern isn't working as expected.
480 Starting in Perl v5.26, if the modifier has a second C<"x"> within it,
481 it does everything that a single C</x> does, but additionally
482 non-backslashed SPACE and TAB characters within bracketed character
483 classes are also generally ignored, and hence can be added to make the
484 classes more readable.
487 /[ ! @ " # $ % ^ & * () = ? <> ' ]/xx
489 may be easier to grasp than the squashed equivalents
494 Taken together, these features go a long way towards
495 making Perl's regular expressions more readable. Here's an example:
497 # Delete (most) C comments.
499 /\* # Match the opening delimiter.
500 .*? # Match a minimal number of characters.
501 \*/ # Match the closing delimiter.
504 Note that anything inside
505 a C<\Q...\E> stays unaffected by C</x>. And note that C</x> doesn't affect
506 space interpretation within a single multi-character construct. For
507 example in C<\x{...}>, regardless of the C</x> modifier, there can be no
508 spaces. Same for a L<quantifier|/Quantifiers> such as C<{3}> or
509 C<{5,}>. Similarly, C<(?:...)> can't have a space between the C<"(">,
510 C<"?">, and C<":">. Within any delimiters for such a
511 construct, allowed spaces are not affected by C</x>, and depend on the
512 construct. For example, C<\x{...}> can't have spaces because hexadecimal
513 numbers don't have spaces in them. But, Unicode properties can have spaces, so
514 in C<\p{...}> there can be spaces that follow the Unicode rules, for which see
515 L<perluniprops/Properties accessible through \p{} and \P{}>.
518 The set of characters that are deemed whitespace are those that Unicode
519 calls "Pattern White Space", namely:
521 U+0009 CHARACTER TABULATION
523 U+000B LINE TABULATION
525 U+000D CARRIAGE RETURN
528 U+200E LEFT-TO-RIGHT MARK
529 U+200F RIGHT-TO-LEFT MARK
530 U+2028 LINE SEPARATOR
531 U+2029 PARAGRAPH SEPARATOR
533 =head4 Character set modifiers
535 C</d>, C</u>, C</a>, and C</l>, available starting in 5.14, are called
536 the character set modifiers; they affect the character set rules
537 used for the regular expression.
539 The C</d>, C</u>, and C</l> modifiers are not likely to be of much use
540 to you, and so you need not worry about them very much. They exist for
541 Perl's internal use, so that complex regular expression data structures
542 can be automatically serialized and later exactly reconstituted,
543 including all their nuances. But, since Perl can't keep a secret, and
544 there may be rare instances where they are useful, they are documented
547 The C</a> modifier, on the other hand, may be useful. Its purpose is to
548 allow code that is to work mostly on ASCII data to not have to concern
551 Briefly, C</l> sets the character set to that of whatever B<L>ocale is in
552 effect at the time of the execution of the pattern match.
554 C</u> sets the character set to B<U>nicode.
556 C</a> also sets the character set to Unicode, BUT adds several
557 restrictions for B<A>SCII-safe matching.
559 C</d> is the old, problematic, pre-5.14 B<D>efault character set
560 behavior. Its only use is to force that old behavior.
562 At any given time, exactly one of these modifiers is in effect. Their
563 existence allows Perl to keep the originally compiled behavior of a
564 regular expression, regardless of what rules are in effect when it is
565 actually executed. And if it is interpolated into a larger regex, the
566 original's rules continue to apply to it, and don't affect the other
569 The C</l> and C</u> modifiers are automatically selected for
570 regular expressions compiled within the scope of various pragmas,
571 and we recommend that in general, you use those pragmas instead of
572 specifying these modifiers explicitly. For one thing, the modifiers
573 affect only pattern matching, and do not extend to even any replacement
574 done, whereas using the pragmas gives consistent results for all
575 appropriate operations within their scopes. For example,
579 will match "foo" using the locale's rules for case-insensitive matching,
580 but the C</l> does not affect how the C<\U> operates. Most likely you
581 want both of them to use locale rules. To do this, instead compile the
582 regular expression within the scope of C<use locale>. This both
583 implicitly adds the C</l>, and applies locale rules to the C<\U>. The
584 lesson is to C<use locale>, and not C</l> explicitly.
586 Similarly, it would be better to use C<use feature 'unicode_strings'>
591 to get Unicode rules, as the C<\L> in the former (but not necessarily
592 the latter) would also use Unicode rules.
594 More detail on each of the modifiers follows. Most likely you don't
595 need to know this detail for C</l>, C</u>, and C</d>, and can skip ahead
596 to L<E<sol>a|/E<sol>a (and E<sol>aa)>.
600 means to use the current locale's rules (see L<perllocale>) when pattern
601 matching. For example, C<\w> will match the "word" characters of that
602 locale, and C<"/i"> case-insensitive matching will match according to
603 the locale's case folding rules. The locale used will be the one in
604 effect at the time of execution of the pattern match. This may not be
605 the same as the compilation-time locale, and can differ from one match
606 to another if there is an intervening call of the
607 L<setlocale() function|perllocale/The setlocale function>.
609 Prior to v5.20, Perl did not support multi-byte locales. Starting then,
610 UTF-8 locales are supported. No other multi byte locales are ever
611 likely to be supported. However, in all locales, one can have code
612 points above 255 and these will always be treated as Unicode no matter
613 what locale is in effect.
615 Under Unicode rules, there are a few case-insensitive matches that cross
616 the 255/256 boundary. Except for UTF-8 locales in Perls v5.20 and
617 later, these are disallowed under C</l>. For example, 0xFF (on ASCII
618 platforms) does not caselessly match the character at 0x178, C<LATIN
619 CAPITAL LETTER Y WITH DIAERESIS>, because 0xFF may not be C<LATIN SMALL
620 LETTER Y WITH DIAERESIS> in the current locale, and Perl has no way of
621 knowing if that character even exists in the locale, much less what code
624 In a UTF-8 locale in v5.20 and later, the only visible difference
625 between locale and non-locale in regular expressions should be tainting
628 This modifier may be specified to be the default by C<use locale>, but
629 see L</Which character set modifier is in effect?>.
634 means to use Unicode rules when pattern matching. On ASCII platforms,
635 this means that the code points between 128 and 255 take on their
636 Latin-1 (ISO-8859-1) meanings (which are the same as Unicode's).
637 (Otherwise Perl considers their meanings to be undefined.) Thus,
638 under this modifier, the ASCII platform effectively becomes a Unicode
639 platform; and hence, for example, C<\w> will match any of the more than
640 100_000 word characters in Unicode.
642 Unlike most locales, which are specific to a language and country pair,
643 Unicode classifies all the characters that are letters I<somewhere> in
645 C<\w>. For example, your locale might not think that C<LATIN SMALL
646 LETTER ETH> is a letter (unless you happen to speak Icelandic), but
647 Unicode does. Similarly, all the characters that are decimal digits
648 somewhere in the world will match C<\d>; this is hundreds, not 10,
649 possible matches. And some of those digits look like some of the 10
650 ASCII digits, but mean a different number, so a human could easily think
651 a number is a different quantity than it really is. For example,
652 C<BENGALI DIGIT FOUR> (U+09EA) looks very much like an
653 C<ASCII DIGIT EIGHT> (U+0038), and C<LEPCHA DIGIT SIX> (U+1C46) looks
654 very much like an C<ASCII DIGIT FIVE> (U+0035). And, C<\d+>, may match
655 strings of digits that are a mixture from different writing systems,
656 creating a security issue. A fraudulent website, for example, could
657 display the price of something using U+1C46, and it would appear to the
658 user that something cost 500 units, but it really costs 600. A browser
659 that enforced script runs (L</Script Runs>) would prevent that
660 fraudulent display. L<Unicode::UCD/num()> can also be used to sort this
661 out. Or the C</a> modifier can be used to force C<\d> to match just the
664 Also, under this modifier, case-insensitive matching works on the full
666 characters. The C<KELVIN SIGN>, for example matches the letters "k" and
667 "K"; and C<LATIN SMALL LIGATURE FF> matches the sequence "ff", which,
668 if you're not prepared, might make it look like a hexadecimal constant,
669 presenting another potential security issue. See
670 L<https://unicode.org/reports/tr36> for a detailed discussion of Unicode
673 This modifier may be specified to be the default by C<use feature
674 'unicode_strings>, C<use locale ':not_characters'>, or
675 C<L<use 5.012|perlfunc/use VERSION>> (or higher),
676 but see L</Which character set modifier is in effect?>.
681 This modifier means to use the "Default" native rules of the platform
682 except when there is cause to use Unicode rules instead, as follows:
688 the target string is encoded in UTF-8; or
692 the pattern is encoded in UTF-8; or
696 the pattern explicitly mentions a code point that is above 255 (say by
701 the pattern uses a Unicode name (C<\N{...}>); or
705 the pattern uses a Unicode property (C<\p{...}> or C<\P{...}>); or
709 the pattern uses a Unicode break (C<\b{...}> or C<\B{...}>); or
713 the pattern uses C<L</(?[ ])>>
717 the pattern uses L<C<(*script_run: ...)>|/Script Runs>
721 Another mnemonic for this modifier is "Depends", as the rules actually
722 used depend on various things, and as a result you can get unexpected
723 results. See L<perlunicode/The "Unicode Bug">. The Unicode Bug has
724 become rather infamous, leading to yet another (without swearing) name
725 for this modifier, "Dodgy".
727 Unless the pattern or string are encoded in UTF-8, only ASCII characters
728 can match positively.
730 Here are some examples of how that works on an ASCII platform:
732 $str = "\xDF"; # $str is not in UTF-8 format.
733 $str =~ /^\w/; # No match, as $str isn't in UTF-8 format.
734 $str .= "\x{0e0b}"; # Now $str is in UTF-8 format.
735 $str =~ /^\w/; # Match! $str is now in UTF-8 format.
737 $str =~ /^\w/; # Still a match! $str remains in UTF-8 format.
739 This modifier is automatically selected by default when none of the
740 others are, so yet another name for it is "Default".
742 Because of the unexpected behaviors associated with this modifier, you
743 probably should only explicitly use it to maintain weird backward
748 This modifier stands for ASCII-restrict (or ASCII-safe). This modifier
749 may be doubled-up to increase its effect.
751 When it appears singly, it causes the sequences C<\d>, C<\s>, C<\w>, and
752 the Posix character classes to match only in the ASCII range. They thus
753 revert to their pre-5.6, pre-Unicode meanings. Under C</a>, C<\d>
754 always means precisely the digits C<"0"> to C<"9">; C<\s> means the five
755 characters C<[ \f\n\r\t]>, and starting in Perl v5.18, the vertical tab;
756 C<\w> means the 63 characters
757 C<[A-Za-z0-9_]>; and likewise, all the Posix classes such as
758 C<[[:print:]]> match only the appropriate ASCII-range characters.
760 This modifier is useful for people who only incidentally use Unicode,
761 and who do not wish to be burdened with its complexities and security
764 With C</a>, one can write C<\d> with confidence that it will only match
765 ASCII characters, and should the need arise to match beyond ASCII, you
766 can instead use C<\p{Digit}> (or C<\p{Word}> for C<\w>). There are
767 similar C<\p{...}> constructs that can match beyond ASCII both white
768 space (see L<perlrecharclass/Whitespace>), and Posix classes (see
769 L<perlrecharclass/POSIX Character Classes>). Thus, this modifier
770 doesn't mean you can't use Unicode, it means that to get Unicode
771 matching you must explicitly use a construct (C<\p{}>, C<\P{}>) that
774 As you would expect, this modifier causes, for example, C<\D> to mean
775 the same thing as C<[^0-9]>; in fact, all non-ASCII characters match
776 C<\D>, C<\S>, and C<\W>. C<\b> still means to match at the boundary
777 between C<\w> and C<\W>, using the C</a> definitions of them (similarly
780 Otherwise, C</a> behaves like the C</u> modifier, in that
781 case-insensitive matching uses Unicode rules; for example, "k" will
782 match the Unicode C<\N{KELVIN SIGN}> under C</i> matching, and code
783 points in the Latin1 range, above ASCII will have Unicode rules when it
784 comes to case-insensitive matching.
786 To forbid ASCII/non-ASCII matches (like "k" with C<\N{KELVIN SIGN}>),
787 specify the C<"a"> twice, for example C</aai> or C</aia>. (The first
788 occurrence of C<"a"> restricts the C<\d>, I<etc>., and the second occurrence
789 adds the C</i> restrictions.) But, note that code points outside the
790 ASCII range will use Unicode rules for C</i> matching, so the modifier
791 doesn't really restrict things to just ASCII; it just forbids the
792 intermixing of ASCII and non-ASCII.
794 To summarize, this modifier provides protection for applications that
795 don't wish to be exposed to all of Unicode. Specifying it twice
796 gives added protection.
798 This modifier may be specified to be the default by C<use re '/a'>
799 or C<use re '/aa'>. If you do so, you may actually have occasion to use
800 the C</u> modifier explicitly if there are a few regular expressions
801 where you do want full Unicode rules (but even here, it's best if
802 everything were under feature C<"unicode_strings">, along with the
803 C<use re '/aa'>). Also see L</Which character set modifier is in
808 =head4 Which character set modifier is in effect?
810 Which of these modifiers is in effect at any given point in a regular
811 expression depends on a fairly complex set of interactions. These have
812 been designed so that in general you don't have to worry about it, but
813 this section gives the gory details. As
814 explained below in L</Extended Patterns> it is possible to explicitly
815 specify modifiers that apply only to portions of a regular expression.
816 The innermost always has priority over any outer ones, and one applying
817 to the whole expression has priority over any of the default settings that are
818 described in the remainder of this section.
820 The C<L<use re 'E<sol>foo'|re/"'/flags' mode">> pragma can be used to set
821 default modifiers (including these) for regular expressions compiled
822 within its scope. This pragma has precedence over the other pragmas
823 listed below that also change the defaults.
825 Otherwise, C<L<use locale|perllocale>> sets the default modifier to C</l>;
826 and C<L<use feature 'unicode_strings|feature>>, or
827 C<L<use 5.012|perlfunc/use VERSION>> (or higher) set the default to
828 C</u> when not in the same scope as either C<L<use locale|perllocale>>
829 or C<L<use bytes|bytes>>.
830 (C<L<use locale ':not_characters'|perllocale/Unicode and UTF-8>> also
831 sets the default to C</u>, overriding any plain C<use locale>.)
832 Unlike the mechanisms mentioned above, these
833 affect operations besides regular expressions pattern matching, and so
834 give more consistent results with other operators, including using
835 C<\U>, C<\l>, I<etc>. in substitution replacements.
837 If none of the above apply, for backwards compatibility reasons, the
838 C</d> modifier is the one in effect by default. As this can lead to
839 unexpected results, it is best to specify which other rule set should be
842 =head4 Character set modifier behavior prior to Perl 5.14
844 Prior to 5.14, there were no explicit modifiers, but C</l> was implied
845 for regexes compiled within the scope of C<use locale>, and C</d> was
846 implied otherwise. However, interpolating a regex into a larger regex
847 would ignore the original compilation in favor of whatever was in effect
848 at the time of the second compilation. There were a number of
849 inconsistencies (bugs) with the C</d> modifier, where Unicode rules
850 would be used when inappropriate, and vice versa. C<\p{}> did not imply
851 Unicode rules, and neither did all occurrences of C<\N{}>, until 5.12.
853 =head2 Regular Expressions
857 Quantifiers are used when a particular portion of a pattern needs to
858 match a certain number (or numbers) of times. If there isn't a
859 quantifier the number of times to match is exactly one. The following
860 standard quantifiers are recognized:
861 X<metacharacter> X<quantifier> X<*> X<+> X<?> X<{n}> X<{n,}> X<{n,m}>
863 * Match 0 or more times
864 + Match 1 or more times
866 {n} Match exactly n times
867 {n,} Match at least n times
868 {n,m} Match at least n but not more than m times
870 (If a non-escaped curly bracket occurs in a context other than one of
871 the quantifiers listed above, where it does not form part of a
872 backslashed sequence like C<\x{...}>, it is either a fatal syntax error,
873 or treated as a regular character, generally with a deprecation warning
874 raised. To escape it, you can precede it with a backslash (C<"\{">) or
875 enclose it within square brackets (C<"[{]">).
876 This change will allow for future syntax extensions (like making the
877 lower bound of a quantifier optional), and better error checking of
880 The C<"*"> quantifier is equivalent to C<{0,}>, the C<"+">
881 quantifier to C<{1,}>, and the C<"?"> quantifier to C<{0,1}>. I<n> and I<m> are limited
882 to non-negative integral values less than a preset limit defined when perl is built.
883 This is usually 32766 on the most common platforms. The actual limit can
884 be seen in the error message generated by code such as this:
886 $_ **= $_ , / {$_} / for 2 .. 42;
888 By default, a quantified subpattern is "greedy", that is, it will match as
889 many times as possible (given a particular starting location) while still
890 allowing the rest of the pattern to match. If you want it to match the
891 minimum number of times possible, follow the quantifier with a C<"?">. Note
892 that the meanings don't change, just the "greediness":
893 X<metacharacter> X<greedy> X<greediness>
894 X<?> X<*?> X<+?> X<??> X<{n}?> X<{n,}?> X<{n,m}?>
896 *? Match 0 or more times, not greedily
897 +? Match 1 or more times, not greedily
898 ?? Match 0 or 1 time, not greedily
899 {n}? Match exactly n times, not greedily (redundant)
900 {n,}? Match at least n times, not greedily
901 {n,m}? Match at least n but not more than m times, not greedily
903 Normally when a quantified subpattern does not allow the rest of the
904 overall pattern to match, Perl will backtrack. However, this behaviour is
905 sometimes undesirable. Thus Perl provides the "possessive" quantifier form
908 *+ Match 0 or more times and give nothing back
909 ++ Match 1 or more times and give nothing back
910 ?+ Match 0 or 1 time and give nothing back
911 {n}+ Match exactly n times and give nothing back (redundant)
912 {n,}+ Match at least n times and give nothing back
913 {n,m}+ Match at least n but not more than m times and give nothing back
919 will never match, as the C<a++> will gobble up all the C<"a">'s in the
920 string and won't leave any for the remaining part of the pattern. This
921 feature can be extremely useful to give perl hints about where it
922 shouldn't backtrack. For instance, the typical "match a double-quoted
923 string" problem can be most efficiently performed when written as:
925 /"(?:[^"\\]++|\\.)*+"/
927 as we know that if the final quote does not match, backtracking will not
928 help. See the independent subexpression
929 C<L</(?E<gt>I<pattern>)>> for more details;
930 possessive quantifiers are just syntactic sugar for that construct. For
931 instance the above example could also be written as follows:
933 /"(?>(?:(?>[^"\\]+)|\\.)*)"/
935 Note that the possessive quantifier modifier can not be combined
936 with the non-greedy modifier. This is because it would make no sense.
937 Consider the follow equivalency table:
945 =head3 Escape sequences
947 Because patterns are processed as double-quoted strings, the following
954 \a alarm (bell) (BEL)
955 \e escape (think troff) (ESC)
956 \cK control char (example: VT)
957 \x{}, \x00 character whose ordinal is the given hexadecimal number
958 \N{name} named Unicode character or character sequence
959 \N{U+263D} Unicode character (example: FIRST QUARTER MOON)
960 \o{}, \000 character whose ordinal is the given octal number
961 \l lowercase next char (think vi)
962 \u uppercase next char (think vi)
963 \L lowercase until \E (think vi)
964 \U uppercase until \E (think vi)
965 \Q quote (disable) pattern metacharacters until \E
966 \E end either case modification or quoted section, think vi
968 Details are in L<perlop/Quote and Quote-like Operators>.
970 =head3 Character Classes and other Special Escapes
972 In addition, Perl defines the following:
973 X<\g> X<\k> X<\K> X<backreference>
975 Sequence Note Description
976 [...] [1] Match a character according to the rules of the
977 bracketed character class defined by the "...".
978 Example: [a-z] matches "a" or "b" or "c" ... or "z"
979 [[:...:]] [2] Match a character according to the rules of the POSIX
980 character class "..." within the outer bracketed
981 character class. Example: [[:upper:]] matches any
983 (?[...]) [8] Extended bracketed character class
984 \w [3] Match a "word" character (alphanumeric plus "_", plus
985 other connector punctuation chars plus Unicode
987 \W [3] Match a non-"word" character
988 \s [3] Match a whitespace character
989 \S [3] Match a non-whitespace character
990 \d [3] Match a decimal digit character
991 \D [3] Match a non-digit character
992 \pP [3] Match P, named property. Use \p{Prop} for longer names
994 \X [4] Match Unicode "eXtended grapheme cluster"
995 \1 [5] Backreference to a specific capture group or buffer.
996 '1' may actually be any positive integer.
997 \g1 [5] Backreference to a specific or previous group,
998 \g{-1} [5] The number may be negative indicating a relative
999 previous group and may optionally be wrapped in
1000 curly brackets for safer parsing.
1001 \g{name} [5] Named backreference
1002 \k<name> [5] Named backreference
1003 \K [6] Keep the stuff left of the \K, don't include it in $&
1004 \N [7] Any character but \n. Not affected by /s modifier
1005 \v [3] Vertical whitespace
1006 \V [3] Not vertical whitespace
1007 \h [3] Horizontal whitespace
1008 \H [3] Not horizontal whitespace
1015 See L<perlrecharclass/Bracketed Character Classes> for details.
1019 See L<perlrecharclass/POSIX Character Classes> for details.
1023 See L<perlunicode/Unicode Character Properties> for details
1027 See L<perlrebackslash/Misc> for details.
1031 See L</Capture groups> below for details.
1035 See L</Extended Patterns> below for details.
1039 Note that C<\N> has two meanings. When of the form C<\N{I<NAME>}>, it
1040 matches the character or character sequence whose name is I<NAME>; and
1042 when of the form C<\N{U+I<hex>}>, it matches the character whose Unicode
1043 code point is I<hex>. Otherwise it matches any character but C<\n>.
1047 See L<perlrecharclass/Extended Bracketed Character Classes> for details.
1053 Besides L<C<"^"> and C<"$">|/Metacharacters>, Perl defines the following
1054 zero-width assertions:
1055 X<zero-width assertion> X<assertion> X<regex, zero-width assertion>
1056 X<regexp, zero-width assertion>
1057 X<regular expression, zero-width assertion>
1058 X<\b> X<\B> X<\A> X<\Z> X<\z> X<\G>
1060 \b{} Match at Unicode boundary of specified type
1061 \B{} Match where corresponding \b{} doesn't match
1062 \b Match a \w\W or \W\w boundary
1063 \B Match except at a \w\W or \W\w boundary
1064 \A Match only at beginning of string
1065 \Z Match only at end of string, or before newline at the end
1066 \z Match only at end of string
1067 \G Match only at pos() (e.g. at the end-of-match position
1070 A Unicode boundary (C<\b{}>), available starting in v5.22, is a spot
1071 between two characters, or before the first character in the string, or
1072 after the final character in the string where certain criteria defined
1073 by Unicode are met. See L<perlrebackslash/\b{}, \b, \B{}, \B> for
1076 A word boundary (C<\b>) is a spot between two characters
1077 that has a C<\w> on one side of it and a C<\W> on the other side
1078 of it (in either order), counting the imaginary characters off the
1079 beginning and end of the string as matching a C<\W>. (Within
1080 character classes C<\b> represents backspace rather than a word
1081 boundary, just as it normally does in any double-quoted string.)
1082 The C<\A> and C<\Z> are just like C<"^"> and C<"$">, except that they
1083 won't match multiple times when the C</m> modifier is used, while
1084 C<"^"> and C<"$"> will match at every internal line boundary. To match
1085 the actual end of the string and not ignore an optional trailing
1087 X<\b> X<\A> X<\Z> X<\z> X</m>
1089 The C<\G> assertion can be used to chain global matches (using
1090 C<m//g>), as described in L<perlop/"Regexp Quote-Like Operators">.
1091 It is also useful when writing C<lex>-like scanners, when you have
1092 several patterns that you want to match against consequent substrings
1093 of your string; see the previous reference. The actual location
1094 where C<\G> will match can also be influenced by using C<pos()> as
1095 an lvalue: see L<perlfunc/pos>. Note that the rule for zero-length
1096 matches (see L</"Repeated Patterns Matching a Zero-length Substring">)
1097 is modified somewhat, in that contents to the left of C<\G> are
1098 not counted when determining the length of the match. Thus the following
1099 will not match forever:
1104 while ($string =~ /(.\G)/g) {
1108 It will print 'A' and then terminate, as it considers the match to
1109 be zero-width, and thus will not match at the same position twice in a
1112 It is worth noting that C<\G> improperly used can result in an infinite
1113 loop. Take care when using patterns that include C<\G> in an alternation.
1115 Note also that C<s///> will refuse to overwrite part of a substitution
1116 that has already been replaced; so for example this will stop after the
1117 first iteration, rather than iterating its way backwards through the
1123 print; # prints 1234X6789, not XXXXX6789
1126 =head3 Capture groups
1128 The grouping construct C<( ... )> creates capture groups (also referred to as
1129 capture buffers). To refer to the current contents of a group later on, within
1130 the same pattern, use C<\g1> (or C<\g{1}>) for the first, C<\g2> (or C<\g{2}>)
1131 for the second, and so on.
1132 This is called a I<backreference>.
1133 X<regex, capture buffer> X<regexp, capture buffer>
1134 X<regex, capture group> X<regexp, capture group>
1135 X<regular expression, capture buffer> X<backreference>
1136 X<regular expression, capture group> X<backreference>
1137 X<\g{1}> X<\g{-1}> X<\g{name}> X<relative backreference> X<named backreference>
1138 X<named capture buffer> X<regular expression, named capture buffer>
1139 X<named capture group> X<regular expression, named capture group>
1140 X<%+> X<$+{name}> X<< \k<name> >>
1141 There is no limit to the number of captured substrings that you may use.
1142 Groups are numbered with the leftmost open parenthesis being number 1, I<etc>. If
1143 a group did not match, the associated backreference won't match either. (This
1144 can happen if the group is optional, or in a different branch of an
1146 You can omit the C<"g">, and write C<"\1">, I<etc>, but there are some issues with
1147 this form, described below.
1149 You can also refer to capture groups relatively, by using a negative number, so
1150 that C<\g-1> and C<\g{-1}> both refer to the immediately preceding capture
1151 group, and C<\g-2> and C<\g{-2}> both refer to the group before it. For
1158 \g{-1} # backref to group 3
1159 \g{-3} # backref to group 1
1163 would match the same as C</(Y) ( (X) \g3 \g1 )/x>. This allows you to
1164 interpolate regexes into larger regexes and not have to worry about the
1165 capture groups being renumbered.
1167 You can dispense with numbers altogether and create named capture groups.
1168 The notation is C<(?E<lt>I<name>E<gt>...)> to declare and C<\g{I<name>}> to
1169 reference. (To be compatible with .Net regular expressions, C<\g{I<name>}> may
1170 also be written as C<\k{I<name>}>, C<\kE<lt>I<name>E<gt>> or C<\k'I<name>'>.)
1171 I<name> must not begin with a number, nor contain hyphens.
1172 When different groups within the same pattern have the same name, any reference
1173 to that name assumes the leftmost defined group. Named groups count in
1174 absolute and relative numbering, and so can also be referred to by those
1176 (It's possible to do things with named capture groups that would otherwise
1179 Capture group contents are dynamically scoped and available to you outside the
1180 pattern until the end of the enclosing block or until the next successful
1181 match, whichever comes first. (See L<perlsyn/"Compound Statements">.)
1182 You can refer to them by absolute number (using C<"$1"> instead of C<"\g1">,
1183 I<etc>); or by name via the C<%+> hash, using C<"$+{I<name>}">.
1185 Braces are required in referring to named capture groups, but are optional for
1186 absolute or relative numbered ones. Braces are safer when creating a regex by
1187 concatenating smaller strings. For example if you have C<qr/$a$b/>, and C<$a>
1188 contained C<"\g1">, and C<$b> contained C<"37">, you would get C</\g137/> which
1189 is probably not what you intended.
1191 The C<\g> and C<\k> notations were introduced in Perl 5.10.0. Prior to that
1192 there were no named nor relative numbered capture groups. Absolute numbered
1193 groups were referred to using C<\1>,
1194 C<\2>, I<etc>., and this notation is still
1195 accepted (and likely always will be). But it leads to some ambiguities if
1196 there are more than 9 capture groups, as C<\10> could mean either the tenth
1197 capture group, or the character whose ordinal in octal is 010 (a backspace in
1198 ASCII). Perl resolves this ambiguity by interpreting C<\10> as a backreference
1199 only if at least 10 left parentheses have opened before it. Likewise C<\11> is
1200 a backreference only if at least 11 left parentheses have opened before it.
1201 And so on. C<\1> through C<\9> are always interpreted as backreferences.
1202 There are several examples below that illustrate these perils. You can avoid
1203 the ambiguity by always using C<\g{}> or C<\g> if you mean capturing groups;
1204 and for octal constants always using C<\o{}>, or for C<\077> and below, using 3
1205 digits padded with leading zeros, since a leading zero implies an octal
1208 The C<\I<digit>> notation also works in certain circumstances outside
1209 the pattern. See L</Warning on \1 Instead of $1> below for details.
1213 s/^([^ ]*) *([^ ]*)/$2 $1/; # swap first two words
1215 /(.)\g1/ # find first doubled char
1216 and print "'$1' is the first doubled character\n";
1218 /(?<char>.)\k<char>/ # ... a different way
1219 and print "'$+{char}' is the first doubled character\n";
1221 /(?'char'.)\g1/ # ... mix and match
1222 and print "'$1' is the first doubled character\n";
1224 if (/Time: (..):(..):(..)/) { # parse out values
1230 /(.)(.)(.)(.)(.)(.)(.)(.)(.)\g10/ # \g10 is a backreference
1231 /(.)(.)(.)(.)(.)(.)(.)(.)(.)\10/ # \10 is octal
1232 /((.)(.)(.)(.)(.)(.)(.)(.)(.))\10/ # \10 is a backreference
1233 /((.)(.)(.)(.)(.)(.)(.)(.)(.))\010/ # \010 is octal
1235 $a = '(.)\1'; # Creates problems when concatenated.
1236 $b = '(.)\g{1}'; # Avoids the problems.
1237 "aa" =~ /${a}/; # True
1238 "aa" =~ /${b}/; # True
1239 "aa0" =~ /${a}0/; # False!
1240 "aa0" =~ /${b}0/; # True
1241 "aa\x08" =~ /${a}0/; # True!
1242 "aa\x08" =~ /${b}0/; # False
1244 Several special variables also refer back to portions of the previous
1245 match. C<$+> returns whatever the last bracket match matched.
1246 C<$&> returns the entire matched string. (At one point C<$0> did
1247 also, but now it returns the name of the program.) C<$`> returns
1248 everything before the matched string. C<$'> returns everything
1249 after the matched string. And C<$^N> contains whatever was matched by
1250 the most-recently closed group (submatch). C<$^N> can be used in
1251 extended patterns (see below), for example to assign a submatch to a
1253 X<$+> X<$^N> X<$&> X<$`> X<$'>
1255 These special variables, like the C<%+> hash and the numbered match variables
1256 (C<$1>, C<$2>, C<$3>, I<etc>.) are dynamically scoped
1257 until the end of the enclosing block or until the next successful
1258 match, whichever comes first. (See L<perlsyn/"Compound Statements">.)
1259 X<$+> X<$^N> X<$&> X<$`> X<$'>
1260 X<$1> X<$2> X<$3> X<$4> X<$5> X<$6> X<$7> X<$8> X<$9>
1262 B<NOTE>: Failed matches in Perl do not reset the match variables,
1263 which makes it easier to write code that tests for a series of more
1264 specific cases and remembers the best match.
1266 B<WARNING>: If your code is to run on Perl 5.16 or earlier,
1267 beware that once Perl sees that you need one of C<$&>, C<$`>, or
1268 C<$'> anywhere in the program, it has to provide them for every
1269 pattern match. This may substantially slow your program.
1271 Perl uses the same mechanism to produce C<$1>, C<$2>, I<etc>, so you also
1272 pay a price for each pattern that contains capturing parentheses.
1273 (To avoid this cost while retaining the grouping behaviour, use the
1274 extended regular expression C<(?: ... )> instead.) But if you never
1275 use C<$&>, C<$`> or C<$'>, then patterns I<without> capturing
1276 parentheses will not be penalized. So avoid C<$&>, C<$'>, and C<$`>
1277 if you can, but if you can't (and some algorithms really appreciate
1278 them), once you've used them once, use them at will, because you've
1279 already paid the price.
1282 Perl 5.16 introduced a slightly more efficient mechanism that notes
1283 separately whether each of C<$`>, C<$&>, and C<$'> have been seen, and
1284 thus may only need to copy part of the string. Perl 5.20 introduced a
1285 much more efficient copy-on-write mechanism which eliminates any slowdown.
1287 As another workaround for this problem, Perl 5.10.0 introduced C<${^PREMATCH}>,
1288 C<${^MATCH}> and C<${^POSTMATCH}>, which are equivalent to C<$`>, C<$&>
1289 and C<$'>, B<except> that they are only guaranteed to be defined after a
1290 successful match that was executed with the C</p> (preserve) modifier.
1291 The use of these variables incurs no global performance penalty, unlike
1292 their punctuation character equivalents, however at the trade-off that you
1293 have to tell perl when you want to use them. As of Perl 5.20, these three
1294 variables are equivalent to C<$`>, C<$&> and C<$'>, and C</p> is ignored.
1297 =head2 Quoting metacharacters
1299 Backslashed metacharacters in Perl are alphanumeric, such as C<\b>,
1300 C<\w>, C<\n>. Unlike some other regular expression languages, there
1301 are no backslashed symbols that aren't alphanumeric. So anything
1302 that looks like C<\\>, C<\(>, C<\)>, C<\[>, C<\]>, C<\{>, or C<\}> is
1304 interpreted as a literal character, not a metacharacter. This was
1305 once used in a common idiom to disable or quote the special meanings
1306 of regular expression metacharacters in a string that you want to
1307 use for a pattern. Simply quote all non-"word" characters:
1309 $pattern =~ s/(\W)/\\$1/g;
1311 (If C<use locale> is set, then this depends on the current locale.)
1312 Today it is more common to use the C<L<quotemeta()|perlfunc/quotemeta>>
1313 function or the C<\Q> metaquoting escape sequence to disable all
1314 metacharacters' special meanings like this:
1316 /$unquoted\Q$quoted\E$unquoted/
1318 Beware that if you put literal backslashes (those not inside
1319 interpolated variables) between C<\Q> and C<\E>, double-quotish
1320 backslash interpolation may lead to confusing results. If you
1321 I<need> to use literal backslashes within C<\Q...\E>,
1322 consult L<perlop/"Gory details of parsing quoted constructs">.
1324 C<quotemeta()> and C<\Q> are fully described in L<perlfunc/quotemeta>.
1326 =head2 Extended Patterns
1328 Perl also defines a consistent extension syntax for features not
1329 found in standard tools like B<awk> and
1330 B<lex>. The syntax for most of these is a
1331 pair of parentheses with a question mark as the first thing within
1332 the parentheses. The character after the question mark indicates
1335 A question mark was chosen for this and for the minimal-matching
1336 construct because 1) question marks are rare in older regular
1337 expressions, and 2) whenever you see one, you should stop and
1338 "question" exactly what is going on. That's psychology....
1342 =item C<(?#I<text>)>
1345 A comment. The I<text> is ignored.
1346 Note that Perl closes
1347 the comment as soon as it sees a C<")">, so there is no way to put a literal
1348 C<")"> in the comment. The pattern's closing delimiter must be escaped by
1349 a backslash if it appears in the comment.
1351 See L</E<sol>x> for another way to have comments in patterns.
1353 Note that a comment can go just about anywhere, except in the middle of
1354 an escape sequence. Examples:
1356 qr/foo(?#comment)bar/' # Matches 'foobar'
1358 # The pattern below matches 'abcd', 'abccd', or 'abcccd'
1359 qr/abc(?#comment between literal and its quantifier){1,3}d/
1361 # The pattern below generates a syntax error, because the '\p' must
1362 # be followed immediately by a '{'.
1363 qr/\p(?#comment between \p and its property name){Any}/
1365 # The pattern below generates a syntax error, because the initial
1366 # '\(' is a literal opening parenthesis, and so there is nothing
1367 # for the closing ')' to match
1368 qr/\(?#the backslash means this isn't a comment)p{Any}/
1370 # Comments can be used to fold long patterns into multiple lines
1371 qr/First part of a long regex(?#
1374 =item C<(?adlupimnsx-imnsx)>
1376 =item C<(?^alupimnsx)>
1379 Zero or more embedded pattern-match modifiers, to be turned on (or
1380 turned off if preceded by C<"-">) for the remainder of the pattern or
1381 the remainder of the enclosing pattern group (if any).
1383 This is particularly useful for dynamically-generated patterns,
1384 such as those read in from a
1385 configuration file, taken from an argument, or specified in a table
1386 somewhere. Consider the case where some patterns want to be
1387 case-sensitive and some do not: The case-insensitive ones merely need to
1388 include C<(?i)> at the front of the pattern. For example:
1390 $pattern = "foobar";
1391 if ( /$pattern/i ) { }
1395 $pattern = "(?i)foobar";
1396 if ( /$pattern/ ) { }
1398 These modifiers are restored at the end of the enclosing group. For example,
1400 ( (?i) blah ) \s+ \g1
1402 will match C<blah> in any case, some spaces, and an exact (I<including the case>!)
1403 repetition of the previous word, assuming the C</x> modifier, and no C</i>
1404 modifier outside this group.
1406 These modifiers do not carry over into named subpatterns called in the
1407 enclosing group. In other words, a pattern such as C<((?i)(?&I<NAME>))> does not
1408 change the case-sensitivity of the I<NAME> pattern.
1410 A modifier is overridden by later occurrences of this construct in the
1411 same scope containing the same modifier, so that
1413 /((?im)foo(?-m)bar)/
1415 matches all of C<foobar> case insensitively, but uses C</m> rules for
1416 only the C<foo> portion. The C<"a"> flag overrides C<aa> as well;
1417 likewise C<aa> overrides C<"a">. The same goes for C<"x"> and C<xx>.
1422 both C</x> and C</xx> are turned off during matching C<foo>. And in
1426 C</x> but NOT C</xx> is turned on for matching C<foo>. (One might
1427 mistakenly think that since the inner C<(?x)> is already in the scope of
1428 C</x>, that the result would effectively be the sum of them, yielding
1429 C</xx>. It doesn't work that way.) Similarly, doing something like
1430 C<(?xx-x)foo> turns off all C<"x"> behavior for matching C<foo>, it is not
1431 that you subtract 1 C<"x"> from 2 to get 1 C<"x"> remaining.
1433 Any of these modifiers can be set to apply globally to all regular
1434 expressions compiled within the scope of a C<use re>. See
1435 L<re/"'/flags' mode">.
1437 Starting in Perl 5.14, a C<"^"> (caret or circumflex accent) immediately
1438 after the C<"?"> is a shorthand equivalent to C<d-imnsx>. Flags (except
1439 C<"d">) may follow the caret to override it.
1440 But a minus sign is not legal with it.
1442 Note that the C<"a">, C<"d">, C<"l">, C<"p">, and C<"u"> modifiers are special in
1443 that they can only be enabled, not disabled, and the C<"a">, C<"d">, C<"l">, and
1444 C<"u"> modifiers are mutually exclusive: specifying one de-specifies the
1445 others, and a maximum of one (or two C<"a">'s) may appear in the
1446 construct. Thus, for
1447 example, C<(?-p)> will warn when compiled under C<use warnings>;
1448 C<(?-d:...)> and C<(?dl:...)> are fatal errors.
1450 Note also that the C<"p"> modifier is special in that its presence
1451 anywhere in a pattern has a global effect.
1453 Having zero modifiers makes this a no-op (so why did you specify it,
1454 unless it's generated code), and starting in v5.30, warns under L<C<use
1455 re 'strict'>|re/'strict' mode>.
1457 =item C<(?:I<pattern>)>
1460 =item C<(?adluimnsx-imnsx:I<pattern>)>
1462 =item C<(?^aluimnsx:I<pattern>)>
1465 This is for clustering, not capturing; it groups subexpressions like
1466 C<"()">, but doesn't make backreferences as C<"()"> does. So
1468 @fields = split(/\b(?:a|b|c)\b/)
1470 matches the same field delimiters as
1472 @fields = split(/\b(a|b|c)\b/)
1474 but doesn't spit out the delimiters themselves as extra fields (even though
1475 that's the behaviour of L<perlfunc/split> when its pattern contains capturing
1476 groups). It's also cheaper not to capture
1477 characters if you don't need to.
1479 Any letters between C<"?"> and C<":"> act as flags modifiers as with
1480 C<(?adluimnsx-imnsx)>. For example,
1482 /(?s-i:more.*than).*million/i
1484 is equivalent to the more verbose
1486 /(?:(?s-i)more.*than).*million/i
1488 Note that any C<()> constructs enclosed within this one will still
1489 capture unless the C</n> modifier is in effect.
1491 Like the L</(?adlupimnsx-imnsx)> construct, C<aa> and C<"a"> override each
1492 other, as do C<xx> and C<"x">. They are not additive. So, doing
1493 something like C<(?xx-x:foo)> turns off all C<"x"> behavior for matching
1496 Starting in Perl 5.14, a C<"^"> (caret or circumflex accent) immediately
1497 after the C<"?"> is a shorthand equivalent to C<d-imnsx>. Any positive
1498 flags (except C<"d">) may follow the caret, so
1506 The caret tells Perl that this cluster doesn't inherit the flags of any
1507 surrounding pattern, but uses the system defaults (C<d-imnsx>),
1508 modified by any flags specified.
1510 The caret allows for simpler stringification of compiled regular
1511 expressions. These look like
1515 with any non-default flags appearing between the caret and the colon.
1516 A test that looks at such stringification thus doesn't need to have the
1517 system default flags hard-coded in it, just the caret. If new flags are
1518 added to Perl, the meaning of the caret's expansion will change to include
1519 the default for those flags, so the test will still work, unchanged.
1521 Specifying a negative flag after the caret is an error, as the flag is
1524 Mnemonic for C<(?^...)>: A fresh beginning since the usual use of a caret is
1525 to match at the beginning.
1527 =item C<(?|I<pattern>)>
1528 X<(?|)> X<Branch reset>
1530 This is the "branch reset" pattern, which has the special property
1531 that the capture groups are numbered from the same starting point
1532 in each alternation branch. It is available starting from perl 5.10.0.
1534 Capture groups are numbered from left to right, but inside this
1535 construct the numbering is restarted for each branch.
1537 The numbering within each branch will be as normal, and any groups
1538 following this construct will be numbered as though the construct
1539 contained only one branch, that being the one with the most capture
1542 This construct is useful when you want to capture one of a
1543 number of alternative matches.
1545 Consider the following pattern. The numbers underneath show in
1546 which group the captured content will be stored.
1549 # before ---------------branch-reset----------- after
1550 / ( a ) (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x
1553 Be careful when using the branch reset pattern in combination with
1554 named captures. Named captures are implemented as being aliases to
1555 numbered groups holding the captures, and that interferes with the
1556 implementation of the branch reset pattern. If you are using named
1557 captures in a branch reset pattern, it's best to use the same names,
1558 in the same order, in each of the alternations:
1560 /(?| (?<a> x ) (?<b> y )
1561 | (?<a> z ) (?<b> w )) /x
1563 Not doing so may lead to surprises:
1565 "12" =~ /(?| (?<a> \d+ ) | (?<b> \D+))/x;
1566 say $+{a}; # Prints '12'
1567 say $+{b}; # *Also* prints '12'.
1569 The problem here is that both the group named C<< a >> and the group
1570 named C<< b >> are aliases for the group belonging to C<< $1 >>.
1572 =item Lookaround Assertions
1573 X<look-around assertion> X<lookaround assertion> X<look-around> X<lookaround>
1575 Lookaround assertions are zero-width patterns which match a specific
1576 pattern without including it in C<$&>. Positive assertions match when
1577 their subpattern matches, negative assertions match when their subpattern
1578 fails. Lookbehind matches text up to the current match position,
1579 lookahead matches text following the current match position.
1583 =item C<(?=I<pattern>)>
1585 =item C<(*pla:I<pattern>)>
1587 =item C<(*positive_lookahead:I<pattern>)>
1590 X<(*positive_lookahead>
1591 X<look-ahead, positive> X<lookahead, positive>
1593 A zero-width positive lookahead assertion. For example, C</\w+(?=\t)/>
1594 matches a word followed by a tab, without including the tab in C<$&>.
1596 =item C<(?!I<pattern>)>
1598 =item C<(*nla:I<pattern>)>
1600 =item C<(*negative_lookahead:I<pattern>)>
1603 X<(*negative_lookahead>
1604 X<look-ahead, negative> X<lookahead, negative>
1606 A zero-width negative lookahead assertion. For example C</foo(?!bar)/>
1607 matches any occurrence of "foo" that isn't followed by "bar". Note
1608 however that lookahead and lookbehind are NOT the same thing. You cannot
1609 use this for lookbehind.
1611 If you are looking for a "bar" that isn't preceded by a "foo", C</(?!foo)bar/>
1612 will not do what you want. That's because the C<(?!foo)> is just saying that
1613 the next thing cannot be "foo"--and it's not, it's a "bar", so "foobar" will
1614 match. Use lookbehind instead (see below).
1616 =item C<(?<=I<pattern>)>
1620 =item C<(*plb:I<pattern>)>
1622 =item C<(*positive_lookbehind:I<pattern>)>
1625 X<(*positive_lookbehind>
1626 X<look-behind, positive> X<lookbehind, positive> X<\K>
1628 A zero-width positive lookbehind assertion. For example, C</(?<=\t)\w+/>
1629 matches a word that follows a tab, without including the tab in C<$&>.
1631 Prior to Perl 5.30, it worked only for fixed-width lookbehind, but
1632 starting in that release, it can handle variable lengths from 1 to 255
1633 characters as an experimental feature. The feature is enabled
1634 automatically if you use a variable length lookbehind assertion, but
1635 will raise a warning at pattern compilation time, unless turned off, in
1636 the C<experimental::vlb> category. This is to warn you that the exact
1637 behavior is subject to change should feedback from actual use in the
1638 field indicate to do so; or even complete removal if the problems found
1639 are not practically surmountable. You can achieve close to pre-5.30
1640 behavior by fatalizing warnings in this category.
1642 There is a special form of this construct, called C<\K>
1643 (available since Perl 5.10.0), which causes the
1644 regex engine to "keep" everything it had matched prior to the C<\K> and
1645 not include it in C<$&>. This effectively provides non-experimental
1646 variable-length lookbehind of any length.
1648 And, there is a technique that can be used to handle variable length
1649 lookbehinds on earlier releases, and longer than 255 characters. It is
1651 L<http://www.drregex.com/2019/02/variable-length-lookbehinds-actually.html>.
1653 Note that under C</i>, a few single characters match two or three other
1654 characters. This makes them variable length, and the 255 length applies
1655 to the maximum number of characters in the match. For
1656 example C<qr/\N{LATIN SMALL LETTER SHARP S}/i> matches the sequence
1657 C<"ss">. Your lookbehind assertion could contain 127 Sharp S
1658 characters under C</i>, but adding a 128th would generate a compilation
1659 error, as that could match 256 C<"s"> characters in a row.
1661 The use of C<\K> inside of another lookaround assertion
1662 is allowed, but the behaviour is currently not well defined.
1664 For various reasons C<\K> may be significantly more efficient than the
1665 equivalent C<< (?<=...) >> construct, and it is especially useful in
1666 situations where you want to efficiently remove something following
1667 something else in a string. For instance
1671 can be rewritten as the much more efficient
1675 Use of the non-greedy modifier C<"?"> may not give you the expected
1676 results if it is within a capturing group within the construct.
1678 =item C<(?<!I<pattern>)>
1680 =item C<(*nlb:I<pattern>)>
1682 =item C<(*negative_lookbehind:I<pattern>)>
1685 X<(*negative_lookbehind>
1686 X<look-behind, negative> X<lookbehind, negative>
1688 A zero-width negative lookbehind assertion. For example C</(?<!bar)foo/>
1689 matches any occurrence of "foo" that does not follow "bar".
1691 Prior to Perl 5.30, it worked only for fixed-width lookbehind, but
1692 starting in that release, it can handle variable lengths from 1 to 255
1693 characters as an experimental feature. The feature is enabled
1694 automatically if you use a variable length lookbehind assertion, but
1695 will raise a warning at pattern compilation time, unless turned off, in
1696 the C<experimental::vlb> category. This is to warn you that the exact
1697 behavior is subject to change should feedback from actual use in the
1698 field indicate to do so; or even complete removal if the problems found
1699 are not practically surmountable. You can achieve close to pre-5.30
1700 behavior by fatalizing warnings in this category.
1702 There is a technique that can be used to handle variable length
1703 lookbehinds on earlier releases, and longer than 255 characters. It is
1705 L<http://www.drregex.com/2019/02/variable-length-lookbehinds-actually.html>.
1707 Note that under C</i>, a few single characters match two or three other
1708 characters. This makes them variable length, and the 255 length applies
1709 to the maximum number of characters in the match. For
1710 example C<qr/\N{LATIN SMALL LETTER SHARP S}/i> matches the sequence
1711 C<"ss">. Your lookbehind assertion could contain 127 Sharp S
1712 characters under C</i>, but adding a 128th would generate a compilation
1713 error, as that could match 256 C<"s"> characters in a row.
1715 Use of the non-greedy modifier C<"?"> may not give you the expected
1716 results if it is within a capturing group within the construct.
1720 =item C<< (?<I<NAME>>I<pattern>) >>
1722 =item C<(?'I<NAME>'I<pattern>)>
1723 X<< (?<NAME>) >> X<(?'NAME')> X<named capture> X<capture>
1725 A named capture group. Identical in every respect to normal capturing
1726 parentheses C<()> but for the additional fact that the group
1727 can be referred to by name in various regular expression
1728 constructs (like C<\g{I<NAME>}>) and can be accessed by name
1729 after a successful match via C<%+> or C<%->. See L<perlvar>
1730 for more details on the C<%+> and C<%-> hashes.
1732 If multiple distinct capture groups have the same name, then
1733 C<$+{I<NAME>}> will refer to the leftmost defined group in the match.
1735 The forms C<(?'I<NAME>'I<pattern>)> and C<< (?<I<NAME>>I<pattern>) >>
1738 B<NOTE:> While the notation of this construct is the same as the similar
1739 function in .NET regexes, the behavior is not. In Perl the groups are
1740 numbered sequentially regardless of being named or not. Thus in the
1745 C<$+{foo}> will be the same as C<$2>, and C<$3> will contain 'z' instead of
1746 the opposite which is what a .NET regex hacker might expect.
1748 Currently I<NAME> is restricted to simple identifiers only.
1749 In other words, it must match C</^[_A-Za-z][_A-Za-z0-9]*\z/> or
1750 its Unicode extension (see L<utf8>),
1751 though it isn't extended by the locale (see L<perllocale>).
1753 B<NOTE:> In order to make things easier for programmers with experience
1754 with the Python or PCRE regex engines, the pattern C<<
1755 (?PE<lt>I<NAME>E<gt>I<pattern>) >>
1756 may be used instead of C<< (?<I<NAME>>I<pattern>) >>; however this form does not
1757 support the use of single quotes as a delimiter for the name.
1759 =item C<< \k<I<NAME>> >>
1761 =item C<< \k'I<NAME>' >>
1763 Named backreference. Similar to numeric backreferences, except that
1764 the group is designated by name and not number. If multiple groups
1765 have the same name then it refers to the leftmost defined group in
1768 It is an error to refer to a name not defined by a C<< (?<I<NAME>>) >>
1769 earlier in the pattern.
1771 Both forms are equivalent.
1773 B<NOTE:> In order to make things easier for programmers with experience
1774 with the Python or PCRE regex engines, the pattern C<< (?P=I<NAME>) >>
1775 may be used instead of C<< \k<I<NAME>> >>.
1777 =item C<(?{ I<code> })>
1778 X<(?{})> X<regex, code in> X<regexp, code in> X<regular expression, code in>
1780 B<WARNING>: Using this feature safely requires that you understand its
1781 limitations. Code executed that has side effects may not perform identically
1782 from version to version due to the effect of future optimisations in the regex
1783 engine. For more information on this, see L</Embedded Code Execution
1786 This zero-width assertion executes any embedded Perl code. It always
1787 succeeds, and its return value is set as C<$^R>.
1789 In literal patterns, the code is parsed at the same time as the
1790 surrounding code. While within the pattern, control is passed temporarily
1791 back to the perl parser, until the logically-balancing closing brace is
1792 encountered. This is similar to the way that an array index expression in
1793 a literal string is handled, for example
1795 "abc$array[ 1 + f('[') + g()]def"
1797 In particular, braces do not need to be balanced:
1799 s/abc(?{ f('{'); })/def/
1801 Even in a pattern that is interpolated and compiled at run-time, literal
1802 code blocks will be compiled once, at perl compile time; the following
1806 my $qr = qr/(?{ BEGIN { print "A" } })/;
1808 /$foo$qr(?{ BEGIN { print "B" } })/;
1811 In patterns where the text of the code is derived from run-time
1812 information rather than appearing literally in a source code /pattern/,
1813 the code is compiled at the same time that the pattern is compiled, and
1814 for reasons of security, C<use re 'eval'> must be in scope. This is to
1815 stop user-supplied patterns containing code snippets from being
1818 In situations where you need to enable this with C<use re 'eval'>, you should
1819 also have taint checking enabled. Better yet, use the carefully
1820 constrained evaluation within a Safe compartment. See L<perlsec> for
1821 details about both these mechanisms.
1823 From the viewpoint of parsing, lexical variable scope and closures,
1827 behaves approximately like
1829 /AAA/ && do { BBB } && /CCC/
1833 qr/AAA(?{ BBB })CCC/
1835 behaves approximately like
1837 sub { /AAA/ && do { BBB } && /CCC/ }
1841 { my $i = 1; $r = qr/(?{ print $i })/ }
1845 Inside a C<(?{...})> block, C<$_> refers to the string the regular
1846 expression is matching against. You can also use C<pos()> to know what is
1847 the current position of matching within this string.
1849 The code block introduces a new scope from the perspective of lexical
1850 variable declarations, but B<not> from the perspective of C<local> and
1851 similar localizing behaviours. So later code blocks within the same
1852 pattern will still see the values which were localized in earlier blocks.
1853 These accumulated localizations are undone either at the end of a
1854 successful match, or if the assertion is backtracked (compare
1855 L</"Backtracking">). For example,
1859 (?{ $cnt = 0 }) # Initialize $cnt.
1863 local $cnt = $cnt + 1; # Update $cnt,
1864 # backtracking-safe.
1868 (?{ $res = $cnt }) # On success copy to
1869 # non-localized location.
1872 will initially increment C<$cnt> up to 8; then during backtracking, its
1873 value will be unwound back to 4, which is the value assigned to C<$res>.
1874 At the end of the regex execution, C<$cnt> will be wound back to its initial
1877 This assertion may be used as the condition in a
1879 (?(condition)yes-pattern|no-pattern)
1881 switch. If I<not> used in this way, the result of evaluation of I<code>
1882 is put into the special variable C<$^R>. This happens immediately, so
1883 C<$^R> can be used from other C<(?{ I<code> })> assertions inside the same
1886 The assignment to C<$^R> above is properly localized, so the old
1887 value of C<$^R> is restored if the assertion is backtracked; compare
1890 Note that the special variable C<$^N> is particularly useful with code
1891 blocks to capture the results of submatches in variables without having to
1892 keep track of the number of nested parentheses. For example:
1894 $_ = "The brown fox jumps over the lazy dog";
1895 /the (\S+)(?{ $color = $^N }) (\S+)(?{ $animal = $^N })/i;
1896 print "color = $color, animal = $animal\n";
1899 =item C<(??{ I<code> })>
1901 X<regex, postponed> X<regexp, postponed> X<regular expression, postponed>
1903 B<WARNING>: Using this feature safely requires that you understand its
1904 limitations. Code executed that has side effects may not perform
1905 identically from version to version due to the effect of future
1906 optimisations in the regex engine. For more information on this, see
1907 L</Embedded Code Execution Frequency>.
1909 This is a "postponed" regular subexpression. It behaves in I<exactly> the
1910 same way as a C<(?{ I<code> })> code block as described above, except that
1911 its return value, rather than being assigned to C<$^R>, is treated as a
1912 pattern, compiled if it's a string (or used as-is if its a qr// object),
1913 then matched as if it were inserted instead of this construct.
1915 During the matching of this sub-pattern, it has its own set of
1916 captures which are valid during the sub-match, but are discarded once
1917 control returns to the main pattern. For example, the following matches,
1918 with the inner pattern capturing "B" and matching "BB", while the outer
1919 pattern captures "A";
1921 my $inner = '(.)\1';
1922 "ABBA" =~ /^(.)(??{ $inner })\1/;
1923 print $1; # prints "A";
1925 Note that this means that there is no way for the inner pattern to refer
1926 to a capture group defined outside. (The code block itself can use C<$1>,
1927 I<etc>., to refer to the enclosing pattern's capture groups.) Thus, although
1929 ('a' x 100)=~/(??{'(.)' x 100})/
1931 I<will> match, it will I<not> set C<$1> on exit.
1933 The following pattern matches a parenthesized group:
1938 (?> [^()]+ ) # Non-parens without backtracking
1940 (??{ $re }) # Group with matching parens
1946 L<C<(?I<PARNO>)>|/(?I<PARNO>) (?-I<PARNO>) (?+I<PARNO>) (?R) (?0)>
1947 for a different, more efficient way to accomplish
1950 Executing a postponed regular expression too many times without
1951 consuming any input string will also result in a fatal error. The depth
1952 at which that happens is compiled into perl, so it can be changed with a
1955 =item C<(?I<PARNO>)> C<(?-I<PARNO>)> C<(?+I<PARNO>)> C<(?R)> C<(?0)>
1956 X<(?PARNO)> X<(?1)> X<(?R)> X<(?0)> X<(?-1)> X<(?+1)> X<(?-PARNO)> X<(?+PARNO)>
1957 X<regex, recursive> X<regexp, recursive> X<regular expression, recursive>
1958 X<regex, relative recursion> X<GOSUB> X<GOSTART>
1960 Recursive subpattern. Treat the contents of a given capture buffer in the
1961 current pattern as an independent subpattern and attempt to match it at
1962 the current position in the string. Information about capture state from
1963 the caller for things like backreferences is available to the subpattern,
1964 but capture buffers set by the subpattern are not visible to the caller.
1966 Similar to C<(??{ I<code> })> except that it does not involve executing any
1967 code or potentially compiling a returned pattern string; instead it treats
1968 the part of the current pattern contained within a specified capture group
1969 as an independent pattern that must match at the current position. Also
1970 different is the treatment of capture buffers, unlike C<(??{ I<code> })>
1971 recursive patterns have access to their caller's match state, so one can
1972 use backreferences safely.
1974 I<PARNO> is a sequence of digits (not starting with 0) whose value reflects
1975 the paren-number of the capture group to recurse to. C<(?R)> recurses to
1976 the beginning of the whole pattern. C<(?0)> is an alternate syntax for
1977 C<(?R)>. If I<PARNO> is preceded by a plus or minus sign then it is assumed
1978 to be relative, with negative numbers indicating preceding capture groups
1979 and positive ones following. Thus C<(?-1)> refers to the most recently
1980 declared group, and C<(?+1)> indicates the next group to be declared.
1981 Note that the counting for relative recursion differs from that of
1982 relative backreferences, in that with recursion unclosed groups B<are>
1985 The following pattern matches a function C<foo()> which may contain
1986 balanced parentheses as the argument.
1988 $re = qr{ ( # paren group 1 (full function)
1990 ( # paren group 2 (parens)
1992 ( # paren group 3 (contents of parens)
1994 (?> [^()]+ ) # Non-parens without backtracking
1996 (?2) # Recurse to start of paren group 2
2004 If the pattern was used as follows
2006 'foo(bar(baz)+baz(bop))'=~/$re/
2007 and print "\$1 = $1\n",
2011 the output produced should be the following:
2013 $1 = foo(bar(baz)+baz(bop))
2014 $2 = (bar(baz)+baz(bop))
2015 $3 = bar(baz)+baz(bop)
2017 If there is no corresponding capture group defined, then it is a
2018 fatal error. Recursing deeply without consuming any input string will
2019 also result in a fatal error. The depth at which that happens is
2020 compiled into perl, so it can be changed with a custom build.
2022 The following shows how using negative indexing can make it
2023 easier to embed recursive patterns inside of a C<qr//> construct
2026 my $parens = qr/(\((?:[^()]++|(?-1))*+\))/;
2027 if (/foo $parens \s+ \+ \s+ bar $parens/x) {
2028 # do something here...
2031 B<Note> that this pattern does not behave the same way as the equivalent
2032 PCRE or Python construct of the same form. In Perl you can backtrack into
2033 a recursed group, in PCRE and Python the recursed into group is treated
2034 as atomic. Also, modifiers are resolved at compile time, so constructs
2035 like C<(?i:(?1))> or C<(?:(?i)(?1))> do not affect how the sub-pattern will
2038 =item C<(?&I<NAME>)>
2041 Recurse to a named subpattern. Identical to C<(?I<PARNO>)> except that the
2042 parenthesis to recurse to is determined by name. If multiple parentheses have
2043 the same name, then it recurses to the leftmost.
2045 It is an error to refer to a name that is not declared somewhere in the
2048 B<NOTE:> In order to make things easier for programmers with experience
2049 with the Python or PCRE regex engines the pattern C<< (?P>I<NAME>) >>
2050 may be used instead of C<< (?&I<NAME>) >>.
2052 =item C<(?(I<condition>)I<yes-pattern>|I<no-pattern>)>
2055 =item C<(?(I<condition>)I<yes-pattern>)>
2057 Conditional expression. Matches I<yes-pattern> if I<condition> yields
2058 a true value, matches I<no-pattern> otherwise. A missing pattern always
2061 C<(I<condition>)> should be one of:
2065 =item an integer in parentheses
2067 (which is valid if the corresponding pair of parentheses
2070 =item a lookahead/lookbehind/evaluate zero-width assertion;
2072 =item a name in angle brackets or single quotes
2074 (which is valid if a group with the given name matched);
2076 =item the special symbol C<(R)>
2078 (true when evaluated inside of recursion or eval). Additionally the
2080 followed by a number, (which will be true when evaluated when recursing
2081 inside of the appropriate group), or by C<&I<NAME>>, in which case it will
2082 be true only when evaluated during recursion in the named group.
2086 Here's a summary of the possible predicates:
2090 =item C<(1)> C<(2)> ...
2092 Checks if the numbered capturing group has matched something.
2093 Full syntax: C<< (?(1)then|else) >>
2095 =item C<(E<lt>I<NAME>E<gt>)> C<('I<NAME>')>
2097 Checks if a group with the given name has matched something.
2098 Full syntax: C<< (?(<name>)then|else) >>
2100 =item C<(?=...)> C<(?!...)> C<(?<=...)> C<(?<!...)>
2102 Checks whether the pattern matches (or does not match, for the C<"!">
2104 Full syntax: C<< (?(?=I<lookahead>)I<then>|I<else>) >>
2106 =item C<(?{ I<CODE> })>
2108 Treats the return value of the code block as the condition.
2109 Full syntax: C<< (?(?{ I<code> })I<then>|I<else>) >>
2113 Checks if the expression has been evaluated inside of recursion.
2114 Full syntax: C<< (?(R)I<then>|I<else>) >>
2116 =item C<(R1)> C<(R2)> ...
2118 Checks if the expression has been evaluated while executing directly
2119 inside of the n-th capture group. This check is the regex equivalent of
2121 if ((caller(0))[3] eq 'subname') { ... }
2123 In other words, it does not check the full recursion stack.
2125 Full syntax: C<< (?(R1)I<then>|I<else>) >>
2127 =item C<(R&I<NAME>)>
2129 Similar to C<(R1)>, this predicate checks to see if we're executing
2130 directly inside of the leftmost group with a given name (this is the same
2131 logic used by C<(?&I<NAME>)> to disambiguate). It does not check the full
2132 stack, but only the name of the innermost active recursion.
2133 Full syntax: C<< (?(R&I<name>)I<then>|I<else>) >>
2137 In this case, the yes-pattern is never directly executed, and no
2138 no-pattern is allowed. Similar in spirit to C<(?{0})> but more efficient.
2139 See below for details.
2140 Full syntax: C<< (?(DEFINE)I<definitions>...) >>
2151 matches a chunk of non-parentheses, possibly included in parentheses
2154 A special form is the C<(DEFINE)> predicate, which never executes its
2155 yes-pattern directly, and does not allow a no-pattern. This allows one to
2156 define subpatterns which will be executed only by the recursion mechanism.
2157 This way, you can define a set of regular expression rules that can be
2158 bundled into any pattern you choose.
2160 It is recommended that for this usage you put the DEFINE block at the
2161 end of the pattern, and that you name any subpatterns defined within it.
2163 Also, it's worth noting that patterns defined this way probably will
2164 not be as efficient, as the optimizer is not very clever about
2167 An example of how this might be used is as follows:
2169 /(?<NAME>(?&NAME_PAT))(?<ADDR>(?&ADDRESS_PAT))
2172 (?<ADDRESS_PAT>....)
2175 Note that capture groups matched inside of recursion are not accessible
2176 after the recursion returns, so the extra layer of capturing groups is
2177 necessary. Thus C<$+{NAME_PAT}> would not be defined even though
2178 C<$+{NAME}> would be.
2180 Finally, keep in mind that subpatterns created inside a DEFINE block
2181 count towards the absolute and relative number of captures, so this:
2183 my @captures = "a" =~ /(.) # First capture
2185 (?<EXAMPLE> 1 ) # Second capture
2187 say scalar @captures;
2189 Will output 2, not 1. This is particularly important if you intend to
2190 compile the definitions with the C<qr//> operator, and later
2191 interpolate them in another pattern.
2193 =item C<< (?>I<pattern>) >>
2195 =item C<< (*atomic:I<pattern>) >>
2198 X<backtrack> X<backtracking> X<atomic> X<possessive>
2200 An "independent" subexpression, one which matches the substring
2201 that a standalone I<pattern> would match if anchored at the given
2202 position, and it matches I<nothing other than this substring>. This
2203 construct is useful for optimizations of what would otherwise be
2204 "eternal" matches, because it will not backtrack (see L</"Backtracking">).
2205 It may also be useful in places where the "grab all you can, and do not
2206 give anything back" semantic is desirable.
2208 For example: C<< ^(?>a*)ab >> will never match, since C<< (?>a*) >>
2209 (anchored at the beginning of string, as above) will match I<all>
2210 characters C<"a"> at the beginning of string, leaving no C<"a"> for
2211 C<ab> to match. In contrast, C<a*ab> will match the same as C<a+b>,
2212 since the match of the subgroup C<a*> is influenced by the following
2213 group C<ab> (see L</"Backtracking">). In particular, C<a*> inside
2214 C<a*ab> will match fewer characters than a standalone C<a*>, since
2215 this makes the tail match.
2217 C<< (?>I<pattern>) >> does not disable backtracking altogether once it has
2218 matched. It is still possible to backtrack past the construct, but not
2219 into it. So C<< ((?>a*)|(?>b*))ar >> will still match "bar".
2221 An effect similar to C<< (?>I<pattern>) >> may be achieved by writing
2222 C<(?=(I<pattern>))\g{-1}>. This matches the same substring as a standalone
2223 C<a+>, and the following C<\g{-1}> eats the matched string; it therefore
2224 makes a zero-length assertion into an analogue of C<< (?>...) >>.
2225 (The difference between these two constructs is that the second one
2226 uses a capturing group, thus shifting ordinals of backreferences
2227 in the rest of a regular expression.)
2229 Consider this pattern:
2240 That will efficiently match a nonempty group with matching parentheses
2241 two levels deep or less. However, if there is no such group, it
2242 will take virtually forever on a long string. That's because there
2243 are so many different ways to split a long string into several
2244 substrings. This is what C<(.+)+> is doing, and C<(.+)+> is similar
2245 to a subpattern of the above pattern. Consider how the pattern
2246 above detects no-match on C<((()aaaaaaaaaaaaaaaaaa> in several
2247 seconds, but that each extra letter doubles this time. This
2248 exponential performance will make it appear that your program has
2249 hung. However, a tiny change to this pattern
2253 (?> [^()]+ ) # change x+ above to (?> x+ )
2260 which uses C<< (?>...) >> matches exactly when the one above does (verifying
2261 this yourself would be a productive exercise), but finishes in a fourth
2262 the time when used on a similar string with 1000000 C<"a">s. Be aware,
2263 however, that, when this construct is followed by a
2264 quantifier, it currently triggers a warning message under
2265 the C<use warnings> pragma or B<-w> switch saying it
2266 C<"matches null string many times in regex">.
2268 On simple groups, such as the pattern C<< (?> [^()]+ ) >>, a comparable
2269 effect may be achieved by negative lookahead, as in C<[^()]+ (?! [^()] )>.
2270 This was only 4 times slower on a string with 1000000 C<"a">s.
2272 The "grab all you can, and do not give anything back" semantic is desirable
2273 in many situations where on the first sight a simple C<()*> looks like
2274 the correct solution. Suppose we parse text with comments being delimited
2275 by C<"#"> followed by some optional (horizontal) whitespace. Contrary to
2276 its appearance, C<#[ \t]*> I<is not> the correct subexpression to match
2277 the comment delimiter, because it may "give up" some whitespace if
2278 the remainder of the pattern can be made to match that way. The correct
2279 answer is either one of these:
2284 For example, to grab non-empty comments into C<$1>, one should use either
2287 / (?> \# [ \t]* ) ( .+ ) /x;
2288 / \# [ \t]* ( [^ \t] .* ) /x;
2290 Which one you pick depends on which of these expressions better reflects
2291 the above specification of comments.
2293 In some literature this construct is called "atomic matching" or
2294 "possessive matching".
2296 Possessive quantifiers are equivalent to putting the item they are applied
2297 to inside of one of these constructs. The following equivalences apply:
2299 Quantifier Form Bracketing Form
2300 --------------- ---------------
2304 PAT{min,max}+ (?>PAT{min,max})
2306 Nested C<(?E<gt>...)> constructs are not no-ops, even if at first glance
2307 they might seem to be. This is because the nested C<(?E<gt>...)> can
2308 restrict internal backtracking that otherwise might occur. For example,
2310 "abc" =~ /(?>a[bc]*c)/
2314 "abc" =~ /(?>a(?>[bc]*)c)/
2320 See L<perlrecharclass/Extended Bracketed Character Classes>.
2322 Note that this feature is currently L<experimental|perlpolicy/experimental>;
2323 using it yields a warning in the C<experimental::regex_sets> category.
2328 X<backtrack> X<backtracking>
2330 NOTE: This section presents an abstract approximation of regular
2331 expression behavior. For a more rigorous (and complicated) view of
2332 the rules involved in selecting a match among possible alternatives,
2333 see L</Combining RE Pieces>.
2335 A fundamental feature of regular expression matching involves the
2336 notion called I<backtracking>, which is currently used (when needed)
2337 by all regular non-possessive expression quantifiers, namely C<"*">, C<*?>, C<"+">,
2338 C<+?>, C<{n,m}>, and C<{n,m}?>. Backtracking is often optimized
2339 internally, but the general principle outlined here is valid.
2341 For a regular expression to match, the I<entire> regular expression must
2342 match, not just part of it. So if the beginning of a pattern containing a
2343 quantifier succeeds in a way that causes later parts in the pattern to
2344 fail, the matching engine backs up and recalculates the beginning
2345 part--that's why it's called backtracking.
2347 Here is an example of backtracking: Let's say you want to find the
2348 word following "foo" in the string "Food is on the foo table.":
2350 $_ = "Food is on the foo table.";
2351 if ( /\b(foo)\s+(\w+)/i ) {
2352 print "$2 follows $1.\n";
2355 When the match runs, the first part of the regular expression (C<\b(foo)>)
2356 finds a possible match right at the beginning of the string, and loads up
2357 C<$1> with "Foo". However, as soon as the matching engine sees that there's
2358 no whitespace following the "Foo" that it had saved in C<$1>, it realizes its
2359 mistake and starts over again one character after where it had the
2360 tentative match. This time it goes all the way until the next occurrence
2361 of "foo". The complete regular expression matches this time, and you get
2362 the expected output of "table follows foo."
2364 Sometimes minimal matching can help a lot. Imagine you'd like to match
2365 everything between "foo" and "bar". Initially, you write something
2368 $_ = "The food is under the bar in the barn.";
2369 if ( /foo(.*)bar/ ) {
2373 Which perhaps unexpectedly yields:
2375 got <d is under the bar in the >
2377 That's because C<.*> was greedy, so you get everything between the
2378 I<first> "foo" and the I<last> "bar". Here it's more effective
2379 to use minimal matching to make sure you get the text between a "foo"
2380 and the first "bar" thereafter.
2382 if ( /foo(.*?)bar/ ) { print "got <$1>\n" }
2383 got <d is under the >
2385 Here's another example. Let's say you'd like to match a number at the end
2386 of a string, and you also want to keep the preceding part of the match.
2389 $_ = "I have 2 numbers: 53147";
2390 if ( /(.*)(\d*)/ ) { # Wrong!
2391 print "Beginning is <$1>, number is <$2>.\n";
2394 That won't work at all, because C<.*> was greedy and gobbled up the
2395 whole string. As C<\d*> can match on an empty string the complete
2396 regular expression matched successfully.
2398 Beginning is <I have 2 numbers: 53147>, number is <>.
2400 Here are some variants, most of which don't work:
2402 $_ = "I have 2 numbers: 53147";
2415 printf "%-12s ", $pat;
2417 print "<$1> <$2>\n";
2423 That will print out:
2425 (.*)(\d*) <I have 2 numbers: 53147> <>
2426 (.*)(\d+) <I have 2 numbers: 5314> <7>
2428 (.*?)(\d+) <I have > <2>
2429 (.*)(\d+)$ <I have 2 numbers: 5314> <7>
2430 (.*?)(\d+)$ <I have 2 numbers: > <53147>
2431 (.*)\b(\d+)$ <I have 2 numbers: > <53147>
2432 (.*\D)(\d+)$ <I have 2 numbers: > <53147>
2434 As you see, this can be a bit tricky. It's important to realize that a
2435 regular expression is merely a set of assertions that gives a definition
2436 of success. There may be 0, 1, or several different ways that the
2437 definition might succeed against a particular string. And if there are
2438 multiple ways it might succeed, you need to understand backtracking to
2439 know which variety of success you will achieve.
2441 When using lookahead assertions and negations, this can all get even
2442 trickier. Imagine you'd like to find a sequence of non-digits not
2443 followed by "123". You might try to write that as
2446 if ( /^\D*(?!123)/ ) { # Wrong!
2447 print "Yup, no 123 in $_\n";
2450 But that isn't going to match; at least, not the way you're hoping. It
2451 claims that there is no 123 in the string. Here's a clearer picture of
2452 why that pattern matches, contrary to popular expectations:
2457 print "1: got $1\n" if $x =~ /^(ABC)(?!123)/;
2458 print "2: got $1\n" if $y =~ /^(ABC)(?!123)/;
2460 print "3: got $1\n" if $x =~ /^(\D*)(?!123)/;
2461 print "4: got $1\n" if $y =~ /^(\D*)(?!123)/;
2469 You might have expected test 3 to fail because it seems to a more
2470 general purpose version of test 1. The important difference between
2471 them is that test 3 contains a quantifier (C<\D*>) and so can use
2472 backtracking, whereas test 1 will not. What's happening is
2473 that you've asked "Is it true that at the start of C<$x>, following 0 or more
2474 non-digits, you have something that's not 123?" If the pattern matcher had
2475 let C<\D*> expand to "ABC", this would have caused the whole pattern to
2478 The search engine will initially match C<\D*> with "ABC". Then it will
2479 try to match C<(?!123)> with "123", which fails. But because
2480 a quantifier (C<\D*>) has been used in the regular expression, the
2481 search engine can backtrack and retry the match differently
2482 in the hope of matching the complete regular expression.
2484 The pattern really, I<really> wants to succeed, so it uses the
2485 standard pattern back-off-and-retry and lets C<\D*> expand to just "AB" this
2486 time. Now there's indeed something following "AB" that is not
2487 "123". It's "C123", which suffices.
2489 We can deal with this by using both an assertion and a negation.
2490 We'll say that the first part in C<$1> must be followed both by a digit
2491 and by something that's not "123". Remember that the lookaheads
2492 are zero-width expressions--they only look, but don't consume any
2493 of the string in their match. So rewriting this way produces what
2494 you'd expect; that is, case 5 will fail, but case 6 succeeds:
2496 print "5: got $1\n" if $x =~ /^(\D*)(?=\d)(?!123)/;
2497 print "6: got $1\n" if $y =~ /^(\D*)(?=\d)(?!123)/;
2501 In other words, the two zero-width assertions next to each other work as though
2502 they're ANDed together, just as you'd use any built-in assertions: C</^$/>
2503 matches only if you're at the beginning of the line AND the end of the
2504 line simultaneously. The deeper underlying truth is that juxtaposition in
2505 regular expressions always means AND, except when you write an explicit OR
2506 using the vertical bar. C</ab/> means match "a" AND (then) match "b",
2507 although the attempted matches are made at different positions because "a"
2508 is not a zero-width assertion, but a one-width assertion.
2510 B<WARNING>: Particularly complicated regular expressions can take
2511 exponential time to solve because of the immense number of possible
2512 ways they can use backtracking to try for a match. For example, without
2513 internal optimizations done by the regular expression engine, this will
2514 take a painfully long time to run:
2516 'aaaaaaaaaaaa' =~ /((a{0,5}){0,5})*[c]/
2518 And if you used C<"*">'s in the internal groups instead of limiting them
2519 to 0 through 5 matches, then it would take forever--or until you ran
2520 out of stack space. Moreover, these internal optimizations are not
2521 always applicable. For example, if you put C<{0,5}> instead of C<"*">
2522 on the external group, no current optimization is applicable, and the
2523 match takes a long time to finish.
2525 A powerful tool for optimizing such beasts is what is known as an
2526 "independent group",
2527 which does not backtrack (see C<L</(?E<gt>pattern)>>). Note also that
2528 zero-length lookahead/lookbehind assertions will not backtrack to make
2529 the tail match, since they are in "logical" context: only
2530 whether they match is considered relevant. For an example
2531 where side-effects of lookahead I<might> have influenced the
2532 following match, see C<L</(?E<gt>pattern)>>.
2535 X<(*script_run:...)> X<(sr:...)>
2536 X<(*atomic_script_run:...)> X<(asr:...)>
2538 A script run is basically a sequence of characters, all from the same
2539 Unicode script (see L<perlunicode/Scripts>), such as Latin or Greek. In
2540 most places a single word would never be written in multiple scripts,
2541 unless it is a spoofing attack. An infamous example, is
2545 Those letters could all be Latin (as in the example just above), or they
2546 could be all Cyrillic (except for the dot), or they could be a mixture
2547 of the two. In the case of an internet address the C<.com> would be in
2548 Latin, And any Cyrillic ones would cause it to be a mixture, not a
2549 script run. Someone clicking on such a link would not be directed to
2550 the real Paypal website, but an attacker would craft a look-alike one to
2551 attempt to gather sensitive information from the person.
2553 Starting in Perl 5.28, it is now easy to detect strings that aren't
2554 script runs. Simply enclose just about any pattern like either of
2557 (*script_run:pattern)
2560 What happens is that after I<pattern> succeeds in matching, it is
2561 subjected to the additional criterion that every character in it must be
2562 from the same script (see exceptions below). If this isn't true,
2563 backtracking occurs until something all in the same script is found that
2564 matches, or all possibilities are exhausted. This can cause a lot of
2565 backtracking, but generally, only malicious input will result in this,
2566 though the slow down could cause a denial of service attack. If your
2567 needs permit, it is best to make the pattern atomic to cut down on the
2568 amount of backtracking. This is so likely to be what you want, that
2569 instead of writing this:
2571 (*script_run:(?>pattern))
2573 you can write either of these:
2575 (*atomic_script_run:pattern)
2578 (See C<L</(?E<gt>I<pattern>)>>.)
2580 In Taiwan, Japan, and Korea, it is common for text to have a mixture of
2581 characters from their native scripts and base Chinese. Perl follows
2582 Unicode's UTS 39 (L<https://unicode.org/reports/tr39/>) Unicode Security
2583 Mechanisms in allowing such mixtures. For example, the Japanese scripts
2584 Katakana and Hiragana are commonly mixed together in practice, along
2585 with some Chinese characters, and hence are treated as being in a single
2588 The rules used for matching decimal digits are slightly stricter. Many
2589 scripts have their own sets of digits equivalent to the Western C<0>
2590 through C<9> ones. A few, such as Arabic, have more than one set. For
2591 a string to be considered a script run, all digits in it must come from
2592 the same set of ten, as determined by the first digit encountered.
2595 qr/(*script_run: \d+ \b )/x
2597 guarantees that the digits matched will all be from the same set of 10.
2598 You won't get a look-alike digit from a different script that has a
2599 different value than what it appears to be.
2601 Unicode has three pseudo scripts that are handled specially.
2603 "Unknown" is applied to code points whose meaning has yet to be
2604 determined. Perl currently will match as a script run, any single
2605 character string consisting of one of these code points. But any string
2606 longer than one code point containing one of these will not be
2607 considered a script run.
2609 "Inherited" is applied to characters that modify another, such as an
2610 accent of some type. These are considered to be in the script of the
2611 master character, and so never cause a script run to not match.
2613 The other one is "Common". This consists of mostly punctuation, emoji,
2614 and characters used in mathematics and music, the ASCII digits C<0>
2615 through C<9>, and full-width forms of these digits. These characters
2616 can appear intermixed in text in many of the world's scripts. These
2617 also don't cause a script run to not match. But like other scripts, all
2618 digits in a run must come from the same set of 10.
2620 This construct is non-capturing. You can add parentheses to I<pattern>
2621 to capture, if desired. You will have to do this if you plan to use
2622 L</(*ACCEPT) (*ACCEPT:arg)> and not have it bypass the script run
2625 The C<Script_Extensions> property as modified by UTS 39
2626 (L<https://unicode.org/reports/tr39/>) is used as the basis for this
2635 All length 0 or length 1 sequences are script runs.
2639 A longer sequence is a script run if and only if B<all> of the following
2648 No code point in the sequence has the C<Script_Extension> property of
2651 This currently means that all code points in the sequence have been
2652 assigned by Unicode to be characters that aren't private use nor
2653 surrogate code points.
2657 All characters in the sequence come from the Common script and/or the
2658 Inherited script and/or a single other script.
2660 The script of a character is determined by the C<Script_Extensions>
2661 property as modified by UTS 39 (L<https://unicode.org/reports/tr39/>), as
2666 All decimal digits in the sequence come from the same block of 10
2673 =head2 Special Backtracking Control Verbs
2675 These special patterns are generally of the form C<(*I<VERB>:I<arg>)>. Unless
2676 otherwise stated the I<arg> argument is optional; in some cases, it is
2679 Any pattern containing a special backtracking verb that allows an argument
2680 has the special behaviour that when executed it sets the current package's
2681 C<$REGERROR> and C<$REGMARK> variables. When doing so the following
2684 On failure, the C<$REGERROR> variable will be set to the I<arg> value of the
2685 verb pattern, if the verb was involved in the failure of the match. If the
2686 I<arg> part of the pattern was omitted, then C<$REGERROR> will be set to the
2687 name of the last C<(*MARK:I<NAME>)> pattern executed, or to TRUE if there was
2688 none. Also, the C<$REGMARK> variable will be set to FALSE.
2690 On a successful match, the C<$REGERROR> variable will be set to FALSE, and
2691 the C<$REGMARK> variable will be set to the name of the last
2692 C<(*MARK:I<NAME>)> pattern executed. See the explanation for the
2693 C<(*MARK:I<NAME>)> verb below for more details.
2695 B<NOTE:> C<$REGERROR> and C<$REGMARK> are not magic variables like C<$1>
2696 and most other regex-related variables. They are not local to a scope, nor
2697 readonly, but instead are volatile package variables similar to C<$AUTOLOAD>.
2698 They are set in the package containing the code that I<executed> the regex
2699 (rather than the one that compiled it, where those differ). If necessary, you
2700 can use C<local> to localize changes to these variables to a specific scope
2701 before executing a regex.
2703 If a pattern does not contain a special backtracking verb that allows an
2704 argument, then C<$REGERROR> and C<$REGMARK> are not touched at all.
2712 =item C<(*PRUNE)> C<(*PRUNE:I<NAME>)>
2713 X<(*PRUNE)> X<(*PRUNE:NAME)>
2715 This zero-width pattern prunes the backtracking tree at the current point
2716 when backtracked into on failure. Consider the pattern C</I<A> (*PRUNE) I<B>/>,
2717 where I<A> and I<B> are complex patterns. Until the C<(*PRUNE)> verb is reached,
2718 I<A> may backtrack as necessary to match. Once it is reached, matching
2719 continues in I<B>, which may also backtrack as necessary; however, should B
2720 not match, then no further backtracking will take place, and the pattern
2721 will fail outright at the current starting position.
2723 The following example counts all the possible matching strings in a
2724 pattern (without actually matching any of them).
2726 'aaab' =~ /a+b?(?{print "$&\n"; $count++})(*FAIL)/;
2727 print "Count=$count\n";
2742 If we add a C<(*PRUNE)> before the count like the following
2744 'aaab' =~ /a+b?(*PRUNE)(?{print "$&\n"; $count++})(*FAIL)/;
2745 print "Count=$count\n";
2747 we prevent backtracking and find the count of the longest matching string
2748 at each matching starting point like so:
2755 Any number of C<(*PRUNE)> assertions may be used in a pattern.
2757 See also C<<< L<< /(?>I<pattern>) >> >>> and possessive quantifiers for
2759 control backtracking. In some cases, the use of C<(*PRUNE)> can be
2760 replaced with a C<< (?>pattern) >> with no functional difference; however,
2761 C<(*PRUNE)> can be used to handle cases that cannot be expressed using a
2762 C<< (?>pattern) >> alone.
2764 =item C<(*SKIP)> C<(*SKIP:I<NAME>)>
2767 This zero-width pattern is similar to C<(*PRUNE)>, except that on
2768 failure it also signifies that whatever text that was matched leading up
2769 to the C<(*SKIP)> pattern being executed cannot be part of I<any> match
2770 of this pattern. This effectively means that the regex engine "skips" forward
2771 to this position on failure and tries to match again, (assuming that
2772 there is sufficient room to match).
2774 The name of the C<(*SKIP:I<NAME>)> pattern has special significance. If a
2775 C<(*MARK:I<NAME>)> was encountered while matching, then it is that position
2776 which is used as the "skip point". If no C<(*MARK)> of that name was
2777 encountered, then the C<(*SKIP)> operator has no effect. When used
2778 without a name the "skip point" is where the match point was when
2779 executing the C<(*SKIP)> pattern.
2781 Compare the following to the examples in C<(*PRUNE)>; note the string
2784 'aaabaaab' =~ /a+b?(*SKIP)(?{print "$&\n"; $count++})(*FAIL)/;
2785 print "Count=$count\n";
2793 Once the 'aaab' at the start of the string has matched, and the C<(*SKIP)>
2794 executed, the next starting point will be where the cursor was when the
2795 C<(*SKIP)> was executed.
2797 =item C<(*MARK:I<NAME>)> C<(*:I<NAME>)>
2798 X<(*MARK)> X<(*MARK:NAME)> X<(*:NAME)>
2800 This zero-width pattern can be used to mark the point reached in a string
2801 when a certain part of the pattern has been successfully matched. This
2802 mark may be given a name. A later C<(*SKIP)> pattern will then skip
2803 forward to that point if backtracked into on failure. Any number of
2804 C<(*MARK)> patterns are allowed, and the I<NAME> portion may be duplicated.
2806 In addition to interacting with the C<(*SKIP)> pattern, C<(*MARK:I<NAME>)>
2807 can be used to "label" a pattern branch, so that after matching, the
2808 program can determine which branches of the pattern were involved in the
2811 When a match is successful, the C<$REGMARK> variable will be set to the
2812 name of the most recently executed C<(*MARK:I<NAME>)> that was involved
2815 This can be used to determine which branch of a pattern was matched
2816 without using a separate capture group for each branch, which in turn
2817 can result in a performance improvement, as perl cannot optimize
2818 C</(?:(x)|(y)|(z))/> as efficiently as something like
2819 C</(?:x(*MARK:x)|y(*MARK:y)|z(*MARK:z))/>.
2821 When a match has failed, and unless another verb has been involved in
2822 failing the match and has provided its own name to use, the C<$REGERROR>
2823 variable will be set to the name of the most recently executed
2826 See L</(*SKIP)> for more details.
2828 As a shortcut C<(*MARK:I<NAME>)> can be written C<(*:I<NAME>)>.
2830 =item C<(*THEN)> C<(*THEN:I<NAME>)>
2832 This is similar to the "cut group" operator C<::> from Raku. Like
2833 C<(*PRUNE)>, this verb always matches, and when backtracked into on
2834 failure, it causes the regex engine to try the next alternation in the
2835 innermost enclosing group (capturing or otherwise) that has alternations.
2836 The two branches of a C<(?(I<condition>)I<yes-pattern>|I<no-pattern>)> do not
2837 count as an alternation, as far as C<(*THEN)> is concerned.
2839 Its name comes from the observation that this operation combined with the
2840 alternation operator (C<"|">) can be used to create what is essentially a
2841 pattern-based if/then/else block:
2843 ( COND (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ )
2845 Note that if this operator is used and NOT inside of an alternation then
2846 it acts exactly like the C<(*PRUNE)> operator.
2856 / ( A (*THEN) B | C ) /
2860 / ( A (*PRUNE) B | C ) /
2862 as after matching the I<A> but failing on the I<B> the C<(*THEN)> verb will
2863 backtrack and try I<C>; but the C<(*PRUNE)> verb will simply fail.
2865 =item C<(*COMMIT)> C<(*COMMIT:I<arg>)>
2868 This is the Raku "commit pattern" C<< <commit> >> or C<:::>. It's a
2869 zero-width pattern similar to C<(*SKIP)>, except that when backtracked
2870 into on failure it causes the match to fail outright. No further attempts
2871 to find a valid match by advancing the start pointer will occur again.
2874 'aaabaaab' =~ /a+b?(*COMMIT)(?{print "$&\n"; $count++})(*FAIL)/;
2875 print "Count=$count\n";
2882 In other words, once the C<(*COMMIT)> has been entered, and if the pattern
2883 does not match, the regex engine will not try any further matching on the
2886 =item C<(*FAIL)> C<(*F)> C<(*FAIL:I<arg>)>
2889 This pattern matches nothing and always fails. It can be used to force the
2890 engine to backtrack. It is equivalent to C<(?!)>, but easier to read. In
2891 fact, C<(?!)> gets optimised into C<(*FAIL)> internally. You can provide
2892 an argument so that if the match fails because of this C<FAIL> directive
2893 the argument can be obtained from C<$REGERROR>.
2895 It is probably useful only when combined with C<(?{})> or C<(??{})>.
2897 =item C<(*ACCEPT)> C<(*ACCEPT:I<arg>)>
2900 This pattern matches nothing and causes the end of successful matching at
2901 the point at which the C<(*ACCEPT)> pattern was encountered, regardless of
2902 whether there is actually more to match in the string. When inside of a
2903 nested pattern, such as recursion, or in a subpattern dynamically generated
2904 via C<(??{})>, only the innermost pattern is ended immediately.
2906 If the C<(*ACCEPT)> is inside of capturing groups then the groups are
2907 marked as ended at the point at which the C<(*ACCEPT)> was encountered.
2910 'AB' =~ /(A (A|B(*ACCEPT)|C) D)(E)/x;
2912 will match, and C<$1> will be C<AB> and C<$2> will be C<"B">, C<$3> will not
2913 be set. If another branch in the inner parentheses was matched, such as in the
2914 string 'ACDE', then the C<"D"> and C<"E"> would have to be matched as well.
2916 You can provide an argument, which will be available in the var
2917 C<$REGMARK> after the match completes.
2923 =head2 Warning on C<\1> Instead of C<$1>
2925 Some people get too used to writing things like:
2927 $pattern =~ s/(\W)/\\\1/g;
2929 This is grandfathered (for \1 to \9) for the RHS of a substitute to avoid
2931 B<sed> addicts, but it's a dirty habit to get into. That's because in
2932 PerlThink, the righthand side of an C<s///> is a double-quoted string. C<\1> in
2933 the usual double-quoted string means a control-A. The customary Unix
2934 meaning of C<\1> is kludged in for C<s///>. However, if you get into the habit
2935 of doing that, you get yourself into trouble if you then add an C</e>
2938 s/(\d+)/ \1 + 1 /eg; # causes warning under -w
2944 You can't disambiguate that by saying C<\{1}000>, whereas you can fix it with
2945 C<${1}000>. The operation of interpolation should not be confused
2946 with the operation of matching a backreference. Certainly they mean two
2947 different things on the I<left> side of the C<s///>.
2949 =head2 Repeated Patterns Matching a Zero-length Substring
2951 B<WARNING>: Difficult material (and prose) ahead. This section needs a rewrite.
2953 Regular expressions provide a terse and powerful programming language. As
2954 with most other power tools, power comes together with the ability
2957 A common abuse of this power stems from the ability to make infinite
2958 loops using regular expressions, with something as innocuous as:
2960 'foo' =~ m{ ( o? )* }x;
2962 The C<o?> matches at the beginning of "C<foo>", and since the position
2963 in the string is not moved by the match, C<o?> would match again and again
2964 because of the C<"*"> quantifier. Another common way to create a similar cycle
2965 is with the looping modifier C</g>:
2967 @matches = ( 'foo' =~ m{ o? }xg );
2971 print "match: <$&>\n" while 'foo' =~ m{ o? }xg;
2973 or the loop implied by C<split()>.
2975 However, long experience has shown that many programming tasks may
2976 be significantly simplified by using repeated subexpressions that
2977 may match zero-length substrings. Here's a simple example being:
2979 @chars = split //, $string; # // is not magic in split
2980 ($whitewashed = $string) =~ s/()/ /g; # parens avoid magic s// /
2982 Thus Perl allows such constructs, by I<forcefully breaking
2983 the infinite loop>. The rules for this are different for lower-level
2984 loops given by the greedy quantifiers C<*+{}>, and for higher-level
2985 ones like the C</g> modifier or C<split()> operator.
2987 The lower-level loops are I<interrupted> (that is, the loop is
2988 broken) when Perl detects that a repeated expression matched a
2989 zero-length substring. Thus
2991 m{ (?: NON_ZERO_LENGTH | ZERO_LENGTH )* }x;
2993 is made equivalent to
2995 m{ (?: NON_ZERO_LENGTH )* (?: ZERO_LENGTH )? }x;
2997 For example, this program
3004 (?{print "hello"}) # print hello whenever this
3006 (?=(b)) # zero-width assertion
3007 )* # any number of times
3018 Notice that "hello" is only printed once, as when Perl sees that the sixth
3019 iteration of the outermost C<(?:)*> matches a zero-length string, it stops
3022 The higher-level loops preserve an additional state between iterations:
3023 whether the last match was zero-length. To break the loop, the following
3024 match after a zero-length match is prohibited to have a length of zero.
3025 This prohibition interacts with backtracking (see L</"Backtracking">),
3026 and so the I<second best> match is chosen if the I<best> match is of
3034 results in C<< <><b><><a><><r><> >>. At each position of the string the best
3035 match given by non-greedy C<??> is the zero-length match, and the I<second
3036 best> match is what is matched by C<\w>. Thus zero-length matches
3037 alternate with one-character-long matches.
3039 Similarly, for repeated C<m/()/g> the second-best match is the match at the
3040 position one notch further in the string.
3042 The additional state of being I<matched with zero-length> is associated with
3043 the matched string, and is reset by each assignment to C<pos()>.
3044 Zero-length matches at the end of the previous match are ignored
3047 =head2 Combining RE Pieces
3049 Each of the elementary pieces of regular expressions which were described
3050 before (such as C<ab> or C<\Z>) could match at most one substring
3051 at the given position of the input string. However, in a typical regular
3052 expression these elementary pieces are combined into more complicated
3053 patterns using combining operators C<ST>, C<S|T>, C<S*> I<etc>.
3054 (in these examples C<"S"> and C<"T"> are regular subexpressions).
3056 Such combinations can include alternatives, leading to a problem of choice:
3057 if we match a regular expression C<a|ab> against C<"abc">, will it match
3058 substring C<"a"> or C<"ab">? One way to describe which substring is
3059 actually matched is the concept of backtracking (see L</"Backtracking">).
3060 However, this description is too low-level and makes you think
3061 in terms of a particular implementation.
3063 Another description starts with notions of "better"/"worse". All the
3064 substrings which may be matched by the given regular expression can be
3065 sorted from the "best" match to the "worst" match, and it is the "best"
3066 match which is chosen. This substitutes the question of "what is chosen?"
3067 by the question of "which matches are better, and which are worse?".
3069 Again, for elementary pieces there is no such question, since at most
3070 one match at a given position is possible. This section describes the
3071 notion of better/worse for combining operators. In the description
3072 below C<"S"> and C<"T"> are regular subexpressions.
3078 Consider two possible matches, C<AB> and C<A'B'>, C<"A"> and C<A'> are
3079 substrings which can be matched by C<"S">, C<"B"> and C<B'> are substrings
3080 which can be matched by C<"T">.
3082 If C<"A"> is a better match for C<"S"> than C<A'>, C<AB> is a better
3085 If C<"A"> and C<A'> coincide: C<AB> is a better match than C<AB'> if
3086 C<"B"> is a better match for C<"T"> than C<B'>.
3090 When C<"S"> can match, it is a better match than when only C<"T"> can match.
3092 Ordering of two matches for C<"S"> is the same as for C<"S">. Similar for
3093 two matches for C<"T">.
3095 =item C<S{REPEAT_COUNT}>
3097 Matches as C<SSS...S> (repeated as many times as necessary).
3101 Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>.
3103 =item C<S{min,max}?>
3105 Matches as C<S{min}|S{min+1}|...|S{max-1}|S{max}>.
3107 =item C<S?>, C<S*>, C<S+>
3109 Same as C<S{0,1}>, C<S{0,BIG_NUMBER}>, C<S{1,BIG_NUMBER}> respectively.
3111 =item C<S??>, C<S*?>, C<S+?>
3113 Same as C<S{0,1}?>, C<S{0,BIG_NUMBER}?>, C<S{1,BIG_NUMBER}?> respectively.
3117 Matches the best match for C<"S"> and only that.
3119 =item C<(?=S)>, C<(?<=S)>
3121 Only the best match for C<"S"> is considered. (This is important only if
3122 C<"S"> has capturing parentheses, and backreferences are used somewhere
3123 else in the whole regular expression.)
3125 =item C<(?!S)>, C<(?<!S)>
3127 For this grouping operator there is no need to describe the ordering, since
3128 only whether or not C<"S"> can match is important.
3130 =item C<(??{ I<EXPR> })>, C<(?I<PARNO>)>
3132 The ordering is the same as for the regular expression which is
3133 the result of I<EXPR>, or the pattern contained by capture group I<PARNO>.
3135 =item C<(?(I<condition>)I<yes-pattern>|I<no-pattern>)>
3137 Recall that which of I<yes-pattern> or I<no-pattern> actually matches is
3138 already determined. The ordering of the matches is the same as for the
3139 chosen subexpression.
3143 The above recipes describe the ordering of matches I<at a given position>.
3144 One more rule is needed to understand how a match is determined for the
3145 whole regular expression: a match at an earlier position is always better
3146 than a match at a later position.
3148 =head2 Creating Custom RE Engines
3150 As of Perl 5.10.0, one can create custom regular expression engines. This
3151 is not for the faint of heart, as they have to plug in at the C level. See
3152 L<perlreapi> for more details.
3154 As an alternative, overloaded constants (see L<overload>) provide a simple
3155 way to extend the functionality of the RE engine, by substituting one
3156 pattern for another.
3158 Suppose that we want to enable a new RE escape-sequence C<\Y|> which
3159 matches at a boundary between whitespace characters and non-whitespace
3160 characters. Note that C<(?=\S)(?<!\S)|(?!\S)(?<=\S)> matches exactly
3161 at these positions, so we want to have each C<\Y|> in the place of the
3162 more complicated version. We can create a module C<customre> to do
3170 die "No argument to customre::import allowed" if @_;
3171 overload::constant 'qr' => \&convert;
3174 sub invalid { die "/$_[0]/: invalid escape '\\$_[1]'"}
3176 # We must also take care of not escaping the legitimate \\Y|
3177 # sequence, hence the presence of '\\' in the conversion rules.
3178 my %rules = ( '\\' => '\\\\',
3179 'Y|' => qr/(?=\S)(?<!\S)|(?!\S)(?<=\S)/ );
3185 { $rules{$1} or invalid($re,$1) }sgex;
3189 Now C<use customre> enables the new escape in constant regular
3190 expressions, I<i.e.>, those without any runtime variable interpolations.
3191 As documented in L<overload>, this conversion will work only over
3192 literal parts of regular expressions. For C<\Y|$re\Y|> the variable
3193 part of this regular expression needs to be converted explicitly
3194 (but only if the special meaning of C<\Y|> should be enabled inside C<$re>):
3199 $re = customre::convert $re;
3202 =head2 Embedded Code Execution Frequency
3204 The exact rules for how often C<(??{})> and C<(?{})> are executed in a pattern
3205 are unspecified. In the case of a successful match you can assume that
3206 they DWIM and will be executed in left to right order the appropriate
3207 number of times in the accepting path of the pattern as would any other
3208 meta-pattern. How non-accepting pathways and match failures affect the
3209 number of times a pattern is executed is specifically unspecified and
3210 may vary depending on what optimizations can be applied to the pattern
3211 and is likely to change from version to version.
3215 "aaabcdeeeee"=~/a(?{print "a"})b(?{print "b"})cde/;
3217 the exact number of times "a" or "b" are printed out is unspecified for
3218 failure, but you may assume they will be printed at least once during
3219 a successful match, additionally you may assume that if "b" is printed,
3220 it will be preceded by at least one "a".
3222 In the case of branching constructs like the following:
3224 /a(b|(?{ print "a" }))c(?{ print "c" })/;
3226 you can assume that the input "ac" will output "ac", and that "abc"
3227 will output only "c".
3229 When embedded code is quantified, successful matches will call the
3230 code once for each matched iteration of the quantifier. For
3233 "good" =~ /g(?:o(?{print "o"}))*d/;
3235 will output "o" twice.
3237 =head2 PCRE/Python Support
3239 As of Perl 5.10.0, Perl supports several Python/PCRE-specific extensions
3240 to the regex syntax. While Perl programmers are encouraged to use the
3241 Perl-specific syntax, the following are also accepted:
3245 =item C<< (?PE<lt>I<NAME>E<gt>I<pattern>) >>
3247 Define a named capture group. Equivalent to C<< (?<I<NAME>>I<pattern>) >>.
3249 =item C<< (?P=I<NAME>) >>
3251 Backreference to a named capture group. Equivalent to C<< \g{I<NAME>} >>.
3253 =item C<< (?P>I<NAME>) >>
3255 Subroutine call to a named capture group. Equivalent to C<< (?&I<NAME>) >>.
3261 There are a number of issues with regard to case-insensitive matching
3262 in Unicode rules. See C<"i"> under L</Modifiers> above.
3264 This document varies from difficult to understand to completely
3265 and utterly opaque. The wandering prose riddled with jargon is
3266 hard to fathom in several places.
3268 This document needs a rewrite that separates the tutorial content
3269 from the reference content.
3273 The syntax of patterns used in Perl pattern matching evolved from those
3274 supplied in the Bell Labs Research Unix 8th Edition (Version 8) regex
3275 routines. (The code is actually derived (distantly) from Henry
3276 Spencer's freely redistributable reimplementation of those V8 routines.)
3282 L<perlop/"Regexp Quote-Like Operators">.
3284 L<perlop/"Gory details of parsing quoted constructs">.
3294 I<Mastering Regular Expressions> by Jeffrey Friedl, published
3295 by O'Reilly and Associates.