/[pcre]/code/trunk/doc/pcrepattern.3
ViewVC logotype

Contents of /code/trunk/doc/pcrepattern.3

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1298 - (show annotations)
Fri Mar 22 16:13:13 2013 UTC (6 years, 6 months ago) by ph10
File size: 128167 byte(s)
Error occurred while calculating annotation data.
Fix COMMIT in recursion; document backtracking verbs in assertions and 
subroutines.
1 .TH PCREPATTERN 3 "22 March 2013" "PCRE 8.33"
2 .SH NAME
3 PCRE - Perl-compatible regular expressions
4 .SH "PCRE REGULAR EXPRESSION DETAILS"
5 .rs
6 .sp
7 The syntax and semantics of the regular expressions that are supported by PCRE
8 are described in detail below. There is a quick-reference syntax summary in the
9 .\" HREF
10 \fBpcresyntax\fP
11 .\"
12 page. PCRE tries to match Perl syntax and semantics as closely as it can. PCRE
13 also supports some alternative regular expression syntax (which does not
14 conflict with the Perl syntax) in order to provide some compatibility with
15 regular expressions in Python, .NET, and Oniguruma.
16 .P
17 Perl's regular expressions are described in its own documentation, and
18 regular expressions in general are covered in a number of books, some of which
19 have copious examples. Jeffrey Friedl's "Mastering Regular Expressions",
20 published by O'Reilly, covers regular expressions in great detail. This
21 description of PCRE's regular expressions is intended as reference material.
22 .P
23 The original operation of PCRE was on strings of one-byte characters. However,
24 there is now also support for UTF-8 strings in the original library, an
25 extra library that supports 16-bit and UTF-16 character strings, and a
26 third library that supports 32-bit and UTF-32 character strings. To use these
27 features, PCRE must be built to include appropriate support. When using UTF
28 strings you must either call the compiling function with the PCRE_UTF8,
29 PCRE_UTF16, or PCRE_UTF32 option, or the pattern must start with one of
30 these special sequences:
31 .sp
32 (*UTF8)
33 (*UTF16)
34 (*UTF32)
35 (*UTF)
36 .sp
37 (*UTF) is a generic sequence that can be used with any of the libraries.
38 Starting a pattern with such a sequence is equivalent to setting the relevant
39 option. This feature is not Perl-compatible. How setting a UTF mode affects
40 pattern matching is mentioned in several places below. There is also a summary
41 of features in the
42 .\" HREF
43 \fBpcreunicode\fP
44 .\"
45 page.
46 .P
47 Another special sequence that may appear at the start of a pattern or in
48 combination with (*UTF8), (*UTF16), (*UTF32) or (*UTF) is:
49 .sp
50 (*UCP)
51 .sp
52 This has the same effect as setting the PCRE_UCP option: it causes sequences
53 such as \ed and \ew to use Unicode properties to determine character types,
54 instead of recognizing only characters with codes less than 128 via a lookup
55 table.
56 .P
57 If a pattern starts with (*NO_START_OPT), it has the same effect as setting the
58 PCRE_NO_START_OPTIMIZE option either at compile or matching time. There are
59 also some more of these special sequences that are concerned with the handling
60 of newlines; they are described below.
61 .P
62 The remainder of this document discusses the patterns that are supported by
63 PCRE when one its main matching functions, \fBpcre_exec()\fP (8-bit) or
64 \fBpcre[16|32]_exec()\fP (16- or 32-bit), is used. PCRE also has alternative
65 matching functions, \fBpcre_dfa_exec()\fP and \fBpcre[16|32_dfa_exec()\fP,
66 which match using a different algorithm that is not Perl-compatible. Some of
67 the features discussed below are not available when DFA matching is used. The
68 advantages and disadvantages of the alternative functions, and how they differ
69 from the normal functions, are discussed in the
70 .\" HREF
71 \fBpcrematching\fP
72 .\"
73 page.
74 .
75 .
76 .SH "EBCDIC CHARACTER CODES"
77 .rs
78 .sp
79 PCRE can be compiled to run in an environment that uses EBCDIC as its character
80 code rather than ASCII or Unicode (typically a mainframe system). In the
81 sections below, character code values are ASCII or Unicode; in an EBCDIC
82 environment these characters may have different code values, and there are no
83 code points greater than 255.
84 .
85 .
86 .\" HTML <a name="newlines"></a>
87 .SH "NEWLINE CONVENTIONS"
88 .rs
89 .sp
90 PCRE supports five different conventions for indicating line breaks in
91 strings: a single CR (carriage return) character, a single LF (linefeed)
92 character, the two-character sequence CRLF, any of the three preceding, or any
93 Unicode newline sequence. The
94 .\" HREF
95 \fBpcreapi\fP
96 .\"
97 page has
98 .\" HTML <a href="pcreapi.html#newlines">
99 .\" </a>
100 further discussion
101 .\"
102 about newlines, and shows how to set the newline convention in the
103 \fIoptions\fP arguments for the compiling and matching functions.
104 .P
105 It is also possible to specify a newline convention by starting a pattern
106 string with one of the following five sequences:
107 .sp
108 (*CR) carriage return
109 (*LF) linefeed
110 (*CRLF) carriage return, followed by linefeed
111 (*ANYCRLF) any of the three above
112 (*ANY) all Unicode newline sequences
113 .sp
114 These override the default and the options given to the compiling function. For
115 example, on a Unix system where LF is the default newline sequence, the pattern
116 .sp
117 (*CR)a.b
118 .sp
119 changes the convention to CR. That pattern matches "a\enb" because LF is no
120 longer a newline. Note that these special settings, which are not
121 Perl-compatible, are recognized only at the very start of a pattern, and that
122 they must be in upper case. If more than one of them is present, the last one
123 is used.
124 .P
125 The newline convention affects where the circumflex and dollar assertions are
126 true. It also affects the interpretation of the dot metacharacter when
127 PCRE_DOTALL is not set, and the behaviour of \eN. However, it does not affect
128 what the \eR escape sequence matches. By default, this is any Unicode newline
129 sequence, for Perl compatibility. However, this can be changed; see the
130 description of \eR in the section entitled
131 .\" HTML <a href="#newlineseq">
132 .\" </a>
133 "Newline sequences"
134 .\"
135 below. A change of \eR setting can be combined with a change of newline
136 convention.
137 .
138 .
139 .SH "CHARACTERS AND METACHARACTERS"
140 .rs
141 .sp
142 A regular expression is a pattern that is matched against a subject string from
143 left to right. Most characters stand for themselves in a pattern, and match the
144 corresponding characters in the subject. As a trivial example, the pattern
145 .sp
146 The quick brown fox
147 .sp
148 matches a portion of a subject string that is identical to itself. When
149 caseless matching is specified (the PCRE_CASELESS option), letters are matched
150 independently of case. In a UTF mode, PCRE always understands the concept of
151 case for characters whose values are less than 128, so caseless matching is
152 always possible. For characters with higher values, the concept of case is
153 supported if PCRE is compiled with Unicode property support, but not otherwise.
154 If you want to use caseless matching for characters 128 and above, you must
155 ensure that PCRE is compiled with Unicode property support as well as with
156 UTF support.
157 .P
158 The power of regular expressions comes from the ability to include alternatives
159 and repetitions in the pattern. These are encoded in the pattern by the use of
160 \fImetacharacters\fP, which do not stand for themselves but instead are
161 interpreted in some special way.
162 .P
163 There are two different sets of metacharacters: those that are recognized
164 anywhere in the pattern except within square brackets, and those that are
165 recognized within square brackets. Outside square brackets, the metacharacters
166 are as follows:
167 .sp
168 \e general escape character with several uses
169 ^ assert start of string (or line, in multiline mode)
170 $ assert end of string (or line, in multiline mode)
171 . match any character except newline (by default)
172 [ start character class definition
173 | start of alternative branch
174 ( start subpattern
175 ) end subpattern
176 ? extends the meaning of (
177 also 0 or 1 quantifier
178 also quantifier minimizer
179 * 0 or more quantifier
180 + 1 or more quantifier
181 also "possessive quantifier"
182 { start min/max quantifier
183 .sp
184 Part of a pattern that is in square brackets is called a "character class". In
185 a character class the only metacharacters are:
186 .sp
187 \e general escape character
188 ^ negate the class, but only if the first character
189 - indicates character range
190 .\" JOIN
191 [ POSIX character class (only if followed by POSIX
192 syntax)
193 ] terminates the character class
194 .sp
195 The following sections describe the use of each of the metacharacters.
196 .
197 .
198 .SH BACKSLASH
199 .rs
200 .sp
201 The backslash character has several uses. Firstly, if it is followed by a
202 character that is not a number or a letter, it takes away any special meaning
203 that character may have. This use of backslash as an escape character applies
204 both inside and outside character classes.
205 .P
206 For example, if you want to match a * character, you write \e* in the pattern.
207 This escaping action applies whether or not the following character would
208 otherwise be interpreted as a metacharacter, so it is always safe to precede a
209 non-alphanumeric with backslash to specify that it stands for itself. In
210 particular, if you want to match a backslash, you write \e\e.
211 .P
212 In a UTF mode, only ASCII numbers and letters have any special meaning after a
213 backslash. All other characters (in particular, those whose codepoints are
214 greater than 127) are treated as literals.
215 .P
216 If a pattern is compiled with the PCRE_EXTENDED option, white space in the
217 pattern (other than in a character class) and characters between a # outside
218 a character class and the next newline are ignored. An escaping backslash can
219 be used to include a white space or # character as part of the pattern.
220 .P
221 If you want to remove the special meaning from a sequence of characters, you
222 can do so by putting them between \eQ and \eE. This is different from Perl in
223 that $ and @ are handled as literals in \eQ...\eE sequences in PCRE, whereas in
224 Perl, $ and @ cause variable interpolation. Note the following examples:
225 .sp
226 Pattern PCRE matches Perl matches
227 .sp
228 .\" JOIN
229 \eQabc$xyz\eE abc$xyz abc followed by the
230 contents of $xyz
231 \eQabc\e$xyz\eE abc\e$xyz abc\e$xyz
232 \eQabc\eE\e$\eQxyz\eE abc$xyz abc$xyz
233 .sp
234 The \eQ...\eE sequence is recognized both inside and outside character classes.
235 An isolated \eE that is not preceded by \eQ is ignored. If \eQ is not followed
236 by \eE later in the pattern, the literal interpretation continues to the end of
237 the pattern (that is, \eE is assumed at the end). If the isolated \eQ is inside
238 a character class, this causes an error, because the character class is not
239 terminated.
240 .
241 .
242 .\" HTML <a name="digitsafterbackslash"></a>
243 .SS "Non-printing characters"
244 .rs
245 .sp
246 A second use of backslash provides a way of encoding non-printing characters
247 in patterns in a visible manner. There is no restriction on the appearance of
248 non-printing characters, apart from the binary zero that terminates a pattern,
249 but when a pattern is being prepared by text editing, it is often easier to use
250 one of the following escape sequences than the binary character it represents:
251 .sp
252 \ea alarm, that is, the BEL character (hex 07)
253 \ecx "control-x", where x is any ASCII character
254 \ee escape (hex 1B)
255 \ef form feed (hex 0C)
256 \en linefeed (hex 0A)
257 \er carriage return (hex 0D)
258 \et tab (hex 09)
259 \eddd character with octal code ddd, or back reference
260 \exhh character with hex code hh
261 \ex{hhh..} character with hex code hhh.. (non-JavaScript mode)
262 \euhhhh character with hex code hhhh (JavaScript mode only)
263 .sp
264 The precise effect of \ecx on ASCII characters is as follows: if x is a lower
265 case letter, it is converted to upper case. Then bit 6 of the character (hex
266 40) is inverted. Thus \ecA to \ecZ become hex 01 to hex 1A (A is 41, Z is 5A),
267 but \ec{ becomes hex 3B ({ is 7B), and \ec; becomes hex 7B (; is 3B). If the
268 data item (byte or 16-bit value) following \ec has a value greater than 127, a
269 compile-time error occurs. This locks out non-ASCII characters in all modes.
270 .P
271 The \ec facility was designed for use with ASCII characters, but with the
272 extension to Unicode it is even less useful than it once was. It is, however,
273 recognized when PCRE is compiled in EBCDIC mode, where data items are always
274 bytes. In this mode, all values are valid after \ec. If the next character is a
275 lower case letter, it is converted to upper case. Then the 0xc0 bits of the
276 byte are inverted. Thus \ecA becomes hex 01, as in ASCII (A is C1), but because
277 the EBCDIC letters are disjoint, \ecZ becomes hex 29 (Z is E9), and other
278 characters also generate different values.
279 .P
280 By default, after \ex, from zero to two hexadecimal digits are read (letters
281 can be in upper or lower case). Any number of hexadecimal digits may appear
282 between \ex{ and }, but the character code is constrained as follows:
283 .sp
284 8-bit non-UTF mode less than 0x100
285 8-bit UTF-8 mode less than 0x10ffff and a valid codepoint
286 16-bit non-UTF mode less than 0x10000
287 16-bit UTF-16 mode less than 0x10ffff and a valid codepoint
288 32-bit non-UTF mode less than 0x80000000
289 32-bit UTF-32 mode less than 0x10ffff and a valid codepoint
290 .sp
291 Invalid Unicode codepoints are the range 0xd800 to 0xdfff (the so-called
292 "surrogate" codepoints), and 0xffef.
293 .P
294 If characters other than hexadecimal digits appear between \ex{ and }, or if
295 there is no terminating }, this form of escape is not recognized. Instead, the
296 initial \ex will be interpreted as a basic hexadecimal escape, with no
297 following digits, giving a character whose value is zero.
298 .P
299 If the PCRE_JAVASCRIPT_COMPAT option is set, the interpretation of \ex is
300 as just described only when it is followed by two hexadecimal digits.
301 Otherwise, it matches a literal "x" character. In JavaScript mode, support for
302 code points greater than 256 is provided by \eu, which must be followed by
303 four hexadecimal digits; otherwise it matches a literal "u" character.
304 Character codes specified by \eu in JavaScript mode are constrained in the same
305 was as those specified by \ex in non-JavaScript mode.
306 .P
307 Characters whose value is less than 256 can be defined by either of the two
308 syntaxes for \ex (or by \eu in JavaScript mode). There is no difference in the
309 way they are handled. For example, \exdc is exactly the same as \ex{dc} (or
310 \eu00dc in JavaScript mode).
311 .P
312 After \e0 up to two further octal digits are read. If there are fewer than two
313 digits, just those that are present are used. Thus the sequence \e0\ex\e07
314 specifies two binary zeros followed by a BEL character (code value 7). Make
315 sure you supply two digits after the initial zero if the pattern character that
316 follows is itself an octal digit.
317 .P
318 The handling of a backslash followed by a digit other than 0 is complicated.
319 Outside a character class, PCRE reads it and any following digits as a decimal
320 number. If the number is less than 10, or if there have been at least that many
321 previous capturing left parentheses in the expression, the entire sequence is
322 taken as a \fIback reference\fP. A description of how this works is given
323 .\" HTML <a href="#backreferences">
324 .\" </a>
325 later,
326 .\"
327 following the discussion of
328 .\" HTML <a href="#subpattern">
329 .\" </a>
330 parenthesized subpatterns.
331 .\"
332 .P
333 Inside a character class, or if the decimal number is greater than 9 and there
334 have not been that many capturing subpatterns, PCRE re-reads up to three octal
335 digits following the backslash, and uses them to generate a data character. Any
336 subsequent digits stand for themselves. The value of the character is
337 constrained in the same way as characters specified in hexadecimal.
338 For example:
339 .sp
340 \e040 is another way of writing an ASCII space
341 .\" JOIN
342 \e40 is the same, provided there are fewer than 40
343 previous capturing subpatterns
344 \e7 is always a back reference
345 .\" JOIN
346 \e11 might be a back reference, or another way of
347 writing a tab
348 \e011 is always a tab
349 \e0113 is a tab followed by the character "3"
350 .\" JOIN
351 \e113 might be a back reference, otherwise the
352 character with octal code 113
353 .\" JOIN
354 \e377 might be a back reference, otherwise
355 the value 255 (decimal)
356 .\" JOIN
357 \e81 is either a back reference, or a binary zero
358 followed by the two characters "8" and "1"
359 .sp
360 Note that octal values of 100 or greater must not be introduced by a leading
361 zero, because no more than three octal digits are ever read.
362 .P
363 All the sequences that define a single character value can be used both inside
364 and outside character classes. In addition, inside a character class, \eb is
365 interpreted as the backspace character (hex 08).
366 .P
367 \eN is not allowed in a character class. \eB, \eR, and \eX are not special
368 inside a character class. Like other unrecognized escape sequences, they are
369 treated as the literal characters "B", "R", and "X" by default, but cause an
370 error if the PCRE_EXTRA option is set. Outside a character class, these
371 sequences have different meanings.
372 .
373 .
374 .SS "Unsupported escape sequences"
375 .rs
376 .sp
377 In Perl, the sequences \el, \eL, \eu, and \eU are recognized by its string
378 handler and used to modify the case of following characters. By default, PCRE
379 does not support these escape sequences. However, if the PCRE_JAVASCRIPT_COMPAT
380 option is set, \eU matches a "U" character, and \eu can be used to define a
381 character by code point, as described in the previous section.
382 .
383 .
384 .SS "Absolute and relative back references"
385 .rs
386 .sp
387 The sequence \eg followed by an unsigned or a negative number, optionally
388 enclosed in braces, is an absolute or relative back reference. A named back
389 reference can be coded as \eg{name}. Back references are discussed
390 .\" HTML <a href="#backreferences">
391 .\" </a>
392 later,
393 .\"
394 following the discussion of
395 .\" HTML <a href="#subpattern">
396 .\" </a>
397 parenthesized subpatterns.
398 .\"
399 .
400 .
401 .SS "Absolute and relative subroutine calls"
402 .rs
403 .sp
404 For compatibility with Oniguruma, the non-Perl syntax \eg followed by a name or
405 a number enclosed either in angle brackets or single quotes, is an alternative
406 syntax for referencing a subpattern as a "subroutine". Details are discussed
407 .\" HTML <a href="#onigurumasubroutines">
408 .\" </a>
409 later.
410 .\"
411 Note that \eg{...} (Perl syntax) and \eg<...> (Oniguruma syntax) are \fInot\fP
412 synonymous. The former is a back reference; the latter is a
413 .\" HTML <a href="#subpatternsassubroutines">
414 .\" </a>
415 subroutine
416 .\"
417 call.
418 .
419 .
420 .\" HTML <a name="genericchartypes"></a>
421 .SS "Generic character types"
422 .rs
423 .sp
424 Another use of backslash is for specifying generic character types:
425 .sp
426 \ed any decimal digit
427 \eD any character that is not a decimal digit
428 \eh any horizontal white space character
429 \eH any character that is not a horizontal white space character
430 \es any white space character
431 \eS any character that is not a white space character
432 \ev any vertical white space character
433 \eV any character that is not a vertical white space character
434 \ew any "word" character
435 \eW any "non-word" character
436 .sp
437 There is also the single sequence \eN, which matches a non-newline character.
438 This is the same as
439 .\" HTML <a href="#fullstopdot">
440 .\" </a>
441 the "." metacharacter
442 .\"
443 when PCRE_DOTALL is not set. Perl also uses \eN to match characters by name;
444 PCRE does not support this.
445 .P
446 Each pair of lower and upper case escape sequences partitions the complete set
447 of characters into two disjoint sets. Any given character matches one, and only
448 one, of each pair. The sequences can appear both inside and outside character
449 classes. They each match one character of the appropriate type. If the current
450 matching point is at the end of the subject string, all of them fail, because
451 there is no character to match.
452 .P
453 For compatibility with Perl, \es does not match the VT character (code 11).
454 This makes it different from the the POSIX "space" class. The \es characters
455 are HT (9), LF (10), FF (12), CR (13), and space (32). If "use locale;" is
456 included in a Perl script, \es may match the VT character. In PCRE, it never
457 does.
458 .P
459 A "word" character is an underscore or any character that is a letter or digit.
460 By default, the definition of letters and digits is controlled by PCRE's
461 low-valued character tables, and may vary if locale-specific matching is taking
462 place (see
463 .\" HTML <a href="pcreapi.html#localesupport">
464 .\" </a>
465 "Locale support"
466 .\"
467 in the
468 .\" HREF
469 \fBpcreapi\fP
470 .\"
471 page). For example, in a French locale such as "fr_FR" in Unix-like systems,
472 or "french" in Windows, some character codes greater than 128 are used for
473 accented letters, and these are then matched by \ew. The use of locales with
474 Unicode is discouraged.
475 .P
476 By default, in a UTF mode, characters with values greater than 128 never match
477 \ed, \es, or \ew, and always match \eD, \eS, and \eW. These sequences retain
478 their original meanings from before UTF support was available, mainly for
479 efficiency reasons. However, if PCRE is compiled with Unicode property support,
480 and the PCRE_UCP option is set, the behaviour is changed so that Unicode
481 properties are used to determine character types, as follows:
482 .sp
483 \ed any character that \ep{Nd} matches (decimal digit)
484 \es any character that \ep{Z} matches, plus HT, LF, FF, CR
485 \ew any character that \ep{L} or \ep{N} matches, plus underscore
486 .sp
487 The upper case escapes match the inverse sets of characters. Note that \ed
488 matches only decimal digits, whereas \ew matches any Unicode digit, as well as
489 any Unicode letter, and underscore. Note also that PCRE_UCP affects \eb, and
490 \eB because they are defined in terms of \ew and \eW. Matching these sequences
491 is noticeably slower when PCRE_UCP is set.
492 .P
493 The sequences \eh, \eH, \ev, and \eV are features that were added to Perl at
494 release 5.10. In contrast to the other sequences, which match only ASCII
495 characters by default, these always match certain high-valued codepoints,
496 whether or not PCRE_UCP is set. The horizontal space characters are:
497 .sp
498 U+0009 Horizontal tab (HT)
499 U+0020 Space
500 U+00A0 Non-break space
501 U+1680 Ogham space mark
502 U+180E Mongolian vowel separator
503 U+2000 En quad
504 U+2001 Em quad
505 U+2002 En space
506 U+2003 Em space
507 U+2004 Three-per-em space
508 U+2005 Four-per-em space
509 U+2006 Six-per-em space
510 U+2007 Figure space
511 U+2008 Punctuation space
512 U+2009 Thin space
513 U+200A Hair space
514 U+202F Narrow no-break space
515 U+205F Medium mathematical space
516 U+3000 Ideographic space
517 .sp
518 The vertical space characters are:
519 .sp
520 U+000A Linefeed (LF)
521 U+000B Vertical tab (VT)
522 U+000C Form feed (FF)
523 U+000D Carriage return (CR)
524 U+0085 Next line (NEL)
525 U+2028 Line separator
526 U+2029 Paragraph separator
527 .sp
528 In 8-bit, non-UTF-8 mode, only the characters with codepoints less than 256 are
529 relevant.
530 .
531 .
532 .\" HTML <a name="newlineseq"></a>
533 .SS "Newline sequences"
534 .rs
535 .sp
536 Outside a character class, by default, the escape sequence \eR matches any
537 Unicode newline sequence. In 8-bit non-UTF-8 mode \eR is equivalent to the
538 following:
539 .sp
540 (?>\er\en|\en|\ex0b|\ef|\er|\ex85)
541 .sp
542 This is an example of an "atomic group", details of which are given
543 .\" HTML <a href="#atomicgroup">
544 .\" </a>
545 below.
546 .\"
547 This particular group matches either the two-character sequence CR followed by
548 LF, or one of the single characters LF (linefeed, U+000A), VT (vertical tab,
549 U+000B), FF (form feed, U+000C), CR (carriage return, U+000D), or NEL (next
550 line, U+0085). The two-character sequence is treated as a single unit that
551 cannot be split.
552 .P
553 In other modes, two additional characters whose codepoints are greater than 255
554 are added: LS (line separator, U+2028) and PS (paragraph separator, U+2029).
555 Unicode character property support is not needed for these characters to be
556 recognized.
557 .P
558 It is possible to restrict \eR to match only CR, LF, or CRLF (instead of the
559 complete set of Unicode line endings) by setting the option PCRE_BSR_ANYCRLF
560 either at compile time or when the pattern is matched. (BSR is an abbrevation
561 for "backslash R".) This can be made the default when PCRE is built; if this is
562 the case, the other behaviour can be requested via the PCRE_BSR_UNICODE option.
563 It is also possible to specify these settings by starting a pattern string with
564 one of the following sequences:
565 .sp
566 (*BSR_ANYCRLF) CR, LF, or CRLF only
567 (*BSR_UNICODE) any Unicode newline sequence
568 .sp
569 These override the default and the options given to the compiling function, but
570 they can themselves be overridden by options given to a matching function. Note
571 that these special settings, which are not Perl-compatible, are recognized only
572 at the very start of a pattern, and that they must be in upper case. If more
573 than one of them is present, the last one is used. They can be combined with a
574 change of newline convention; for example, a pattern can start with:
575 .sp
576 (*ANY)(*BSR_ANYCRLF)
577 .sp
578 They can also be combined with the (*UTF8), (*UTF16), (*UTF32), (*UTF) or
579 (*UCP) special sequences. Inside a character class, \eR is treated as an
580 unrecognized escape sequence, and so matches the letter "R" by default, but
581 causes an error if PCRE_EXTRA is set.
582 .
583 .
584 .\" HTML <a name="uniextseq"></a>
585 .SS Unicode character properties
586 .rs
587 .sp
588 When PCRE is built with Unicode character property support, three additional
589 escape sequences that match characters with specific properties are available.
590 When in 8-bit non-UTF-8 mode, these sequences are of course limited to testing
591 characters whose codepoints are less than 256, but they do work in this mode.
592 The extra escape sequences are:
593 .sp
594 \ep{\fIxx\fP} a character with the \fIxx\fP property
595 \eP{\fIxx\fP} a character without the \fIxx\fP property
596 \eX a Unicode extended grapheme cluster
597 .sp
598 The property names represented by \fIxx\fP above are limited to the Unicode
599 script names, the general category properties, "Any", which matches any
600 character (including newline), and some special PCRE properties (described
601 in the
602 .\" HTML <a href="#extraprops">
603 .\" </a>
604 next section).
605 .\"
606 Other Perl properties such as "InMusicalSymbols" are not currently supported by
607 PCRE. Note that \eP{Any} does not match any characters, so always causes a
608 match failure.
609 .P
610 Sets of Unicode characters are defined as belonging to certain scripts. A
611 character from one of these sets can be matched using a script name. For
612 example:
613 .sp
614 \ep{Greek}
615 \eP{Han}
616 .sp
617 Those that are not part of an identified script are lumped together as
618 "Common". The current list of scripts is:
619 .P
620 Arabic,
621 Armenian,
622 Avestan,
623 Balinese,
624 Bamum,
625 Batak,
626 Bengali,
627 Bopomofo,
628 Brahmi,
629 Braille,
630 Buginese,
631 Buhid,
632 Canadian_Aboriginal,
633 Carian,
634 Chakma,
635 Cham,
636 Cherokee,
637 Common,
638 Coptic,
639 Cuneiform,
640 Cypriot,
641 Cyrillic,
642 Deseret,
643 Devanagari,
644 Egyptian_Hieroglyphs,
645 Ethiopic,
646 Georgian,
647 Glagolitic,
648 Gothic,
649 Greek,
650 Gujarati,
651 Gurmukhi,
652 Han,
653 Hangul,
654 Hanunoo,
655 Hebrew,
656 Hiragana,
657 Imperial_Aramaic,
658 Inherited,
659 Inscriptional_Pahlavi,
660 Inscriptional_Parthian,
661 Javanese,
662 Kaithi,
663 Kannada,
664 Katakana,
665 Kayah_Li,
666 Kharoshthi,
667 Khmer,
668 Lao,
669 Latin,
670 Lepcha,
671 Limbu,
672 Linear_B,
673 Lisu,
674 Lycian,
675 Lydian,
676 Malayalam,
677 Mandaic,
678 Meetei_Mayek,
679 Meroitic_Cursive,
680 Meroitic_Hieroglyphs,
681 Miao,
682 Mongolian,
683 Myanmar,
684 New_Tai_Lue,
685 Nko,
686 Ogham,
687 Old_Italic,
688 Old_Persian,
689 Old_South_Arabian,
690 Old_Turkic,
691 Ol_Chiki,
692 Oriya,
693 Osmanya,
694 Phags_Pa,
695 Phoenician,
696 Rejang,
697 Runic,
698 Samaritan,
699 Saurashtra,
700 Sharada,
701 Shavian,
702 Sinhala,
703 Sora_Sompeng,
704 Sundanese,
705 Syloti_Nagri,
706 Syriac,
707 Tagalog,
708 Tagbanwa,
709 Tai_Le,
710 Tai_Tham,
711 Tai_Viet,
712 Takri,
713 Tamil,
714 Telugu,
715 Thaana,
716 Thai,
717 Tibetan,
718 Tifinagh,
719 Ugaritic,
720 Vai,
721 Yi.
722 .P
723 Each character has exactly one Unicode general category property, specified by
724 a two-letter abbreviation. For compatibility with Perl, negation can be
725 specified by including a circumflex between the opening brace and the property
726 name. For example, \ep{^Lu} is the same as \eP{Lu}.
727 .P
728 If only one letter is specified with \ep or \eP, it includes all the general
729 category properties that start with that letter. In this case, in the absence
730 of negation, the curly brackets in the escape sequence are optional; these two
731 examples have the same effect:
732 .sp
733 \ep{L}
734 \epL
735 .sp
736 The following general category property codes are supported:
737 .sp
738 C Other
739 Cc Control
740 Cf Format
741 Cn Unassigned
742 Co Private use
743 Cs Surrogate
744 .sp
745 L Letter
746 Ll Lower case letter
747 Lm Modifier letter
748 Lo Other letter
749 Lt Title case letter
750 Lu Upper case letter
751 .sp
752 M Mark
753 Mc Spacing mark
754 Me Enclosing mark
755 Mn Non-spacing mark
756 .sp
757 N Number
758 Nd Decimal number
759 Nl Letter number
760 No Other number
761 .sp
762 P Punctuation
763 Pc Connector punctuation
764 Pd Dash punctuation
765 Pe Close punctuation
766 Pf Final punctuation
767 Pi Initial punctuation
768 Po Other punctuation
769 Ps Open punctuation
770 .sp
771 S Symbol
772 Sc Currency symbol
773 Sk Modifier symbol
774 Sm Mathematical symbol
775 So Other symbol
776 .sp
777 Z Separator
778 Zl Line separator
779 Zp Paragraph separator
780 Zs Space separator
781 .sp
782 The special property L& is also supported: it matches a character that has
783 the Lu, Ll, or Lt property, in other words, a letter that is not classified as
784 a modifier or "other".
785 .P
786 The Cs (Surrogate) property applies only to characters in the range U+D800 to
787 U+DFFF. Such characters are not valid in Unicode strings and so
788 cannot be tested by PCRE, unless UTF validity checking has been turned off
789 (see the discussion of PCRE_NO_UTF8_CHECK, PCRE_NO_UTF16_CHECK and
790 PCRE_NO_UTF32_CHECK in the
791 .\" HREF
792 \fBpcreapi\fP
793 .\"
794 page). Perl does not support the Cs property.
795 .P
796 The long synonyms for property names that Perl supports (such as \ep{Letter})
797 are not supported by PCRE, nor is it permitted to prefix any of these
798 properties with "Is".
799 .P
800 No character that is in the Unicode table has the Cn (unassigned) property.
801 Instead, this property is assumed for any code point that is not in the
802 Unicode table.
803 .P
804 Specifying caseless matching does not affect these escape sequences. For
805 example, \ep{Lu} always matches only upper case letters. This is different from
806 the behaviour of current versions of Perl.
807 .P
808 Matching characters by Unicode property is not fast, because PCRE has to do a
809 multistage table lookup in order to find a character's property. That is why
810 the traditional escape sequences such as \ed and \ew do not use Unicode
811 properties in PCRE by default, though you can make them do so by setting the
812 PCRE_UCP option or by starting the pattern with (*UCP).
813 .
814 .
815 .SS Extended grapheme clusters
816 .rs
817 .sp
818 The \eX escape matches any number of Unicode characters that form an "extended
819 grapheme cluster", and treats the sequence as an atomic group
820 .\" HTML <a href="#atomicgroup">
821 .\" </a>
822 (see below).
823 .\"
824 Up to and including release 8.31, PCRE matched an earlier, simpler definition
825 that was equivalent to
826 .sp
827 (?>\ePM\epM*)
828 .sp
829 That is, it matched a character without the "mark" property, followed by zero
830 or more characters with the "mark" property. Characters with the "mark"
831 property are typically non-spacing accents that affect the preceding character.
832 .P
833 This simple definition was extended in Unicode to include more complicated
834 kinds of composite character by giving each character a grapheme breaking
835 property, and creating rules that use these properties to define the boundaries
836 of extended grapheme clusters. In releases of PCRE later than 8.31, \eX matches
837 one of these clusters.
838 .P
839 \eX always matches at least one character. Then it decides whether to add
840 additional characters according to the following rules for ending a cluster:
841 .P
842 1. End at the end of the subject string.
843 .P
844 2. Do not end between CR and LF; otherwise end after any control character.
845 .P
846 3. Do not break Hangul (a Korean script) syllable sequences. Hangul characters
847 are of five types: L, V, T, LV, and LVT. An L character may be followed by an
848 L, V, LV, or LVT character; an LV or V character may be followed by a V or T
849 character; an LVT or T character may be follwed only by a T character.
850 .P
851 4. Do not end before extending characters or spacing marks. Characters with
852 the "mark" property always have the "extend" grapheme breaking property.
853 .P
854 5. Do not end after prepend characters.
855 .P
856 6. Otherwise, end the cluster.
857 .
858 .
859 .\" HTML <a name="extraprops"></a>
860 .SS PCRE's additional properties
861 .rs
862 .sp
863 As well as the standard Unicode properties described above, PCRE supports four
864 more that make it possible to convert traditional escape sequences such as \ew
865 and \es and POSIX character classes to use Unicode properties. PCRE uses these
866 non-standard, non-Perl properties internally when PCRE_UCP is set. However,
867 they may also be used explicitly. These properties are:
868 .sp
869 Xan Any alphanumeric character
870 Xps Any POSIX space character
871 Xsp Any Perl space character
872 Xwd Any Perl "word" character
873 .sp
874 Xan matches characters that have either the L (letter) or the N (number)
875 property. Xps matches the characters tab, linefeed, vertical tab, form feed, or
876 carriage return, and any other character that has the Z (separator) property.
877 Xsp is the same as Xps, except that vertical tab is excluded. Xwd matches the
878 same characters as Xan, plus underscore.
879 .P
880 There is another non-standard property, Xuc, which matches any character that
881 can be represented by a Universal Character Name in C++ and other programming
882 languages. These are the characters $, @, ` (grave accent), and all characters
883 with Unicode code points greater than or equal to U+00A0, except for the
884 surrogates U+D800 to U+DFFF. Note that most base (ASCII) characters are
885 excluded. (Universal Character Names are of the form \euHHHH or \eUHHHHHHHH
886 where H is a hexadecimal digit. Note that the Xuc property does not match these
887 sequences but the characters that they represent.)
888 .
889 .
890 .\" HTML <a name="resetmatchstart"></a>
891 .SS "Resetting the match start"
892 .rs
893 .sp
894 The escape sequence \eK causes any previously matched characters not to be
895 included in the final matched sequence. For example, the pattern:
896 .sp
897 foo\eKbar
898 .sp
899 matches "foobar", but reports that it has matched "bar". This feature is
900 similar to a lookbehind assertion
901 .\" HTML <a href="#lookbehind">
902 .\" </a>
903 (described below).
904 .\"
905 However, in this case, the part of the subject before the real match does not
906 have to be of fixed length, as lookbehind assertions do. The use of \eK does
907 not interfere with the setting of
908 .\" HTML <a href="#subpattern">
909 .\" </a>
910 captured substrings.
911 .\"
912 For example, when the pattern
913 .sp
914 (foo)\eKbar
915 .sp
916 matches "foobar", the first substring is still set to "foo".
917 .P
918 Perl documents that the use of \eK within assertions is "not well defined". In
919 PCRE, \eK is acted upon when it occurs inside positive assertions, but is
920 ignored in negative assertions.
921 .
922 .
923 .\" HTML <a name="smallassertions"></a>
924 .SS "Simple assertions"
925 .rs
926 .sp
927 The final use of backslash is for certain simple assertions. An assertion
928 specifies a condition that has to be met at a particular point in a match,
929 without consuming any characters from the subject string. The use of
930 subpatterns for more complicated assertions is described
931 .\" HTML <a href="#bigassertions">
932 .\" </a>
933 below.
934 .\"
935 The backslashed assertions are:
936 .sp
937 \eb matches at a word boundary
938 \eB matches when not at a word boundary
939 \eA matches at the start of the subject
940 \eZ matches at the end of the subject
941 also matches before a newline at the end of the subject
942 \ez matches only at the end of the subject
943 \eG matches at the first matching position in the subject
944 .sp
945 Inside a character class, \eb has a different meaning; it matches the backspace
946 character. If any other of these assertions appears in a character class, by
947 default it matches the corresponding literal character (for example, \eB
948 matches the letter B). However, if the PCRE_EXTRA option is set, an "invalid
949 escape sequence" error is generated instead.
950 .P
951 A word boundary is a position in the subject string where the current character
952 and the previous character do not both match \ew or \eW (i.e. one matches
953 \ew and the other matches \eW), or the start or end of the string if the
954 first or last character matches \ew, respectively. In a UTF mode, the meanings
955 of \ew and \eW can be changed by setting the PCRE_UCP option. When this is
956 done, it also affects \eb and \eB. Neither PCRE nor Perl has a separate "start
957 of word" or "end of word" metasequence. However, whatever follows \eb normally
958 determines which it is. For example, the fragment \eba matches "a" at the start
959 of a word.
960 .P
961 The \eA, \eZ, and \ez assertions differ from the traditional circumflex and
962 dollar (described in the next section) in that they only ever match at the very
963 start and end of the subject string, whatever options are set. Thus, they are
964 independent of multiline mode. These three assertions are not affected by the
965 PCRE_NOTBOL or PCRE_NOTEOL options, which affect only the behaviour of the
966 circumflex and dollar metacharacters. However, if the \fIstartoffset\fP
967 argument of \fBpcre_exec()\fP is non-zero, indicating that matching is to start
968 at a point other than the beginning of the subject, \eA can never match. The
969 difference between \eZ and \ez is that \eZ matches before a newline at the end
970 of the string as well as at the very end, whereas \ez matches only at the end.
971 .P
972 The \eG assertion is true only when the current matching position is at the
973 start point of the match, as specified by the \fIstartoffset\fP argument of
974 \fBpcre_exec()\fP. It differs from \eA when the value of \fIstartoffset\fP is
975 non-zero. By calling \fBpcre_exec()\fP multiple times with appropriate
976 arguments, you can mimic Perl's /g option, and it is in this kind of
977 implementation where \eG can be useful.
978 .P
979 Note, however, that PCRE's interpretation of \eG, as the start of the current
980 match, is subtly different from Perl's, which defines it as the end of the
981 previous match. In Perl, these can be different when the previously matched
982 string was empty. Because PCRE does just one match at a time, it cannot
983 reproduce this behaviour.
984 .P
985 If all the alternatives of a pattern begin with \eG, the expression is anchored
986 to the starting match position, and the "anchored" flag is set in the compiled
987 regular expression.
988 .
989 .
990 .SH "CIRCUMFLEX AND DOLLAR"
991 .rs
992 .sp
993 The circumflex and dollar metacharacters are zero-width assertions. That is,
994 they test for a particular condition being true without consuming any
995 characters from the subject string.
996 .P
997 Outside a character class, in the default matching mode, the circumflex
998 character is an assertion that is true only if the current matching point is at
999 the start of the subject string. If the \fIstartoffset\fP argument of
1000 \fBpcre_exec()\fP is non-zero, circumflex can never match if the PCRE_MULTILINE
1001 option is unset. Inside a character class, circumflex has an entirely different
1002 meaning
1003 .\" HTML <a href="#characterclass">
1004 .\" </a>
1005 (see below).
1006 .\"
1007 .P
1008 Circumflex need not be the first character of the pattern if a number of
1009 alternatives are involved, but it should be the first thing in each alternative
1010 in which it appears if the pattern is ever to match that branch. If all
1011 possible alternatives start with a circumflex, that is, if the pattern is
1012 constrained to match only at the start of the subject, it is said to be an
1013 "anchored" pattern. (There are also other constructs that can cause a pattern
1014 to be anchored.)
1015 .P
1016 The dollar character is an assertion that is true only if the current matching
1017 point is at the end of the subject string, or immediately before a newline at
1018 the end of the string (by default). Note, however, that it does not actually
1019 match the newline. Dollar need not be the last character of the pattern if a
1020 number of alternatives are involved, but it should be the last item in any
1021 branch in which it appears. Dollar has no special meaning in a character class.
1022 .P
1023 The meaning of dollar can be changed so that it matches only at the very end of
1024 the string, by setting the PCRE_DOLLAR_ENDONLY option at compile time. This
1025 does not affect the \eZ assertion.
1026 .P
1027 The meanings of the circumflex and dollar characters are changed if the
1028 PCRE_MULTILINE option is set. When this is the case, a circumflex matches
1029 immediately after internal newlines as well as at the start of the subject
1030 string. It does not match after a newline that ends the string. A dollar
1031 matches before any newlines in the string, as well as at the very end, when
1032 PCRE_MULTILINE is set. When newline is specified as the two-character
1033 sequence CRLF, isolated CR and LF characters do not indicate newlines.
1034 .P
1035 For example, the pattern /^abc$/ matches the subject string "def\enabc" (where
1036 \en represents a newline) in multiline mode, but not otherwise. Consequently,
1037 patterns that are anchored in single line mode because all branches start with
1038 ^ are not anchored in multiline mode, and a match for circumflex is possible
1039 when the \fIstartoffset\fP argument of \fBpcre_exec()\fP is non-zero. The
1040 PCRE_DOLLAR_ENDONLY option is ignored if PCRE_MULTILINE is set.
1041 .P
1042 Note that the sequences \eA, \eZ, and \ez can be used to match the start and
1043 end of the subject in both modes, and if all branches of a pattern start with
1044 \eA it is always anchored, whether or not PCRE_MULTILINE is set.
1045 .
1046 .
1047 .\" HTML <a name="fullstopdot"></a>
1048 .SH "FULL STOP (PERIOD, DOT) AND \eN"
1049 .rs
1050 .sp
1051 Outside a character class, a dot in the pattern matches any one character in
1052 the subject string except (by default) a character that signifies the end of a
1053 line.
1054 .P
1055 When a line ending is defined as a single character, dot never matches that
1056 character; when the two-character sequence CRLF is used, dot does not match CR
1057 if it is immediately followed by LF, but otherwise it matches all characters
1058 (including isolated CRs and LFs). When any Unicode line endings are being
1059 recognized, dot does not match CR or LF or any of the other line ending
1060 characters.
1061 .P
1062 The behaviour of dot with regard to newlines can be changed. If the PCRE_DOTALL
1063 option is set, a dot matches any one character, without exception. If the
1064 two-character sequence CRLF is present in the subject string, it takes two dots
1065 to match it.
1066 .P
1067 The handling of dot is entirely independent of the handling of circumflex and
1068 dollar, the only relationship being that they both involve newlines. Dot has no
1069 special meaning in a character class.
1070 .P
1071 The escape sequence \eN behaves like a dot, except that it is not affected by
1072 the PCRE_DOTALL option. In other words, it matches any character except one
1073 that signifies the end of a line. Perl also uses \eN to match characters by
1074 name; PCRE does not support this.
1075 .
1076 .
1077 .SH "MATCHING A SINGLE DATA UNIT"
1078 .rs
1079 .sp
1080 Outside a character class, the escape sequence \eC matches any one data unit,
1081 whether or not a UTF mode is set. In the 8-bit library, one data unit is one
1082 byte; in the 16-bit library it is a 16-bit unit; in the 32-bit library it is
1083 a 32-bit unit. Unlike a dot, \eC always
1084 matches line-ending characters. The feature is provided in Perl in order to
1085 match individual bytes in UTF-8 mode, but it is unclear how it can usefully be
1086 used. Because \eC breaks up characters into individual data units, matching one
1087 unit with \eC in a UTF mode means that the rest of the string may start with a
1088 malformed UTF character. This has undefined results, because PCRE assumes that
1089 it is dealing with valid UTF strings (and by default it checks this at the
1090 start of processing unless the PCRE_NO_UTF8_CHECK, PCRE_NO_UTF16_CHECK or
1091 PCRE_NO_UTF32_CHECK option is used).
1092 .P
1093 PCRE does not allow \eC to appear in lookbehind assertions
1094 .\" HTML <a href="#lookbehind">
1095 .\" </a>
1096 (described below)
1097 .\"
1098 in a UTF mode, because this would make it impossible to calculate the length of
1099 the lookbehind.
1100 .P
1101 In general, the \eC escape sequence is best avoided. However, one
1102 way of using it that avoids the problem of malformed UTF characters is to use a
1103 lookahead to check the length of the next character, as in this pattern, which
1104 could be used with a UTF-8 string (ignore white space and line breaks):
1105 .sp
1106 (?| (?=[\ex00-\ex7f])(\eC) |
1107 (?=[\ex80-\ex{7ff}])(\eC)(\eC) |
1108 (?=[\ex{800}-\ex{ffff}])(\eC)(\eC)(\eC) |
1109 (?=[\ex{10000}-\ex{1fffff}])(\eC)(\eC)(\eC)(\eC))
1110 .sp
1111 A group that starts with (?| resets the capturing parentheses numbers in each
1112 alternative (see
1113 .\" HTML <a href="#dupsubpatternnumber">
1114 .\" </a>
1115 "Duplicate Subpattern Numbers"
1116 .\"
1117 below). The assertions at the start of each branch check the next UTF-8
1118 character for values whose encoding uses 1, 2, 3, or 4 bytes, respectively. The
1119 character's individual bytes are then captured by the appropriate number of
1120 groups.
1121 .
1122 .
1123 .\" HTML <a name="characterclass"></a>
1124 .SH "SQUARE BRACKETS AND CHARACTER CLASSES"
1125 .rs
1126 .sp
1127 An opening square bracket introduces a character class, terminated by a closing
1128 square bracket. A closing square bracket on its own is not special by default.
1129 However, if the PCRE_JAVASCRIPT_COMPAT option is set, a lone closing square
1130 bracket causes a compile-time error. If a closing square bracket is required as
1131 a member of the class, it should be the first data character in the class
1132 (after an initial circumflex, if present) or escaped with a backslash.
1133 .P
1134 A character class matches a single character in the subject. In a UTF mode, the
1135 character may be more than one data unit long. A matched character must be in
1136 the set of characters defined by the class, unless the first character in the
1137 class definition is a circumflex, in which case the subject character must not
1138 be in the set defined by the class. If a circumflex is actually required as a
1139 member of the class, ensure it is not the first character, or escape it with a
1140 backslash.
1141 .P
1142 For example, the character class [aeiou] matches any lower case vowel, while
1143 [^aeiou] matches any character that is not a lower case vowel. Note that a
1144 circumflex is just a convenient notation for specifying the characters that
1145 are in the class by enumerating those that are not. A class that starts with a
1146 circumflex is not an assertion; it still consumes a character from the subject
1147 string, and therefore it fails if the current pointer is at the end of the
1148 string.
1149 .P
1150 In UTF-8 (UTF-16, UTF-32) mode, characters with values greater than 255 (0xffff)
1151 can be included in a class as a literal string of data units, or by using the
1152 \ex{ escaping mechanism.
1153 .P
1154 When caseless matching is set, any letters in a class represent both their
1155 upper case and lower case versions, so for example, a caseless [aeiou] matches
1156 "A" as well as "a", and a caseless [^aeiou] does not match "A", whereas a
1157 caseful version would. In a UTF mode, PCRE always understands the concept of
1158 case for characters whose values are less than 128, so caseless matching is
1159 always possible. For characters with higher values, the concept of case is
1160 supported if PCRE is compiled with Unicode property support, but not otherwise.
1161 If you want to use caseless matching in a UTF mode for characters 128 and
1162 above, you must ensure that PCRE is compiled with Unicode property support as
1163 well as with UTF support.
1164 .P
1165 Characters that might indicate line breaks are never treated in any special way
1166 when matching character classes, whatever line-ending sequence is in use, and
1167 whatever setting of the PCRE_DOTALL and PCRE_MULTILINE options is used. A class
1168 such as [^a] always matches one of these characters.
1169 .P
1170 The minus (hyphen) character can be used to specify a range of characters in a
1171 character class. For example, [d-m] matches any letter between d and m,
1172 inclusive. If a minus character is required in a class, it must be escaped with
1173 a backslash or appear in a position where it cannot be interpreted as
1174 indicating a range, typically as the first or last character in the class.
1175 .P
1176 It is not possible to have the literal character "]" as the end character of a
1177 range. A pattern such as [W-]46] is interpreted as a class of two characters
1178 ("W" and "-") followed by a literal string "46]", so it would match "W46]" or
1179 "-46]". However, if the "]" is escaped with a backslash it is interpreted as
1180 the end of range, so [W-\e]46] is interpreted as a class containing a range
1181 followed by two other characters. The octal or hexadecimal representation of
1182 "]" can also be used to end a range.
1183 .P
1184 Ranges operate in the collating sequence of character values. They can also be
1185 used for characters specified numerically, for example [\e000-\e037]. Ranges
1186 can include any characters that are valid for the current mode.
1187 .P
1188 If a range that includes letters is used when caseless matching is set, it
1189 matches the letters in either case. For example, [W-c] is equivalent to
1190 [][\e\e^_`wxyzabc], matched caselessly, and in a non-UTF mode, if character
1191 tables for a French locale are in use, [\exc8-\excb] matches accented E
1192 characters in both cases. In UTF modes, PCRE supports the concept of case for
1193 characters with values greater than 128 only when it is compiled with Unicode
1194 property support.
1195 .P
1196 The character escape sequences \ed, \eD, \eh, \eH, \ep, \eP, \es, \eS, \ev,
1197 \eV, \ew, and \eW may appear in a character class, and add the characters that
1198 they match to the class. For example, [\edABCDEF] matches any hexadecimal
1199 digit. In UTF modes, the PCRE_UCP option affects the meanings of \ed, \es, \ew
1200 and their upper case partners, just as it does when they appear outside a
1201 character class, as described in the section entitled
1202 .\" HTML <a href="#genericchartypes">
1203 .\" </a>
1204 "Generic character types"
1205 .\"
1206 above. The escape sequence \eb has a different meaning inside a character
1207 class; it matches the backspace character. The sequences \eB, \eN, \eR, and \eX
1208 are not special inside a character class. Like any other unrecognized escape
1209 sequences, they are treated as the literal characters "B", "N", "R", and "X" by
1210 default, but cause an error if the PCRE_EXTRA option is set.
1211 .P
1212 A circumflex can conveniently be used with the upper case character types to
1213 specify a more restricted set of characters than the matching lower case type.
1214 For example, the class [^\eW_] matches any letter or digit, but not underscore,
1215 whereas [\ew] includes underscore. A positive character class should be read as
1216 "something OR something OR ..." and a negative class as "NOT something AND NOT
1217 something AND NOT ...".
1218 .P
1219 The only metacharacters that are recognized in character classes are backslash,
1220 hyphen (only where it can be interpreted as specifying a range), circumflex
1221 (only at the start), opening square bracket (only when it can be interpreted as
1222 introducing a POSIX class name - see the next section), and the terminating
1223 closing square bracket. However, escaping other non-alphanumeric characters
1224 does no harm.
1225 .
1226 .
1227 .SH "POSIX CHARACTER CLASSES"
1228 .rs
1229 .sp
1230 Perl supports the POSIX notation for character classes. This uses names
1231 enclosed by [: and :] within the enclosing square brackets. PCRE also supports
1232 this notation. For example,
1233 .sp
1234 [01[:alpha:]%]
1235 .sp
1236 matches "0", "1", any alphabetic character, or "%". The supported class names
1237 are:
1238 .sp
1239 alnum letters and digits
1240 alpha letters
1241 ascii character codes 0 - 127
1242 blank space or tab only
1243 cntrl control characters
1244 digit decimal digits (same as \ed)
1245 graph printing characters, excluding space
1246 lower lower case letters
1247 print printing characters, including space
1248 punct printing characters, excluding letters and digits and space
1249 space white space (not quite the same as \es)
1250 upper upper case letters
1251 word "word" characters (same as \ew)
1252 xdigit hexadecimal digits
1253 .sp
1254 The "space" characters are HT (9), LF (10), VT (11), FF (12), CR (13), and
1255 space (32). Notice that this list includes the VT character (code 11). This
1256 makes "space" different to \es, which does not include VT (for Perl
1257 compatibility).
1258 .P
1259 The name "word" is a Perl extension, and "blank" is a GNU extension from Perl
1260 5.8. Another Perl extension is negation, which is indicated by a ^ character
1261 after the colon. For example,
1262 .sp
1263 [12[:^digit:]]
1264 .sp
1265 matches "1", "2", or any non-digit. PCRE (and Perl) also recognize the POSIX
1266 syntax [.ch.] and [=ch=] where "ch" is a "collating element", but these are not
1267 supported, and an error is given if they are encountered.
1268 .P
1269 By default, in UTF modes, characters with values greater than 128 do not match
1270 any of the POSIX character classes. However, if the PCRE_UCP option is passed
1271 to \fBpcre_compile()\fP, some of the classes are changed so that Unicode
1272 character properties are used. This is achieved by replacing the POSIX classes
1273 by other sequences, as follows:
1274 .sp
1275 [:alnum:] becomes \ep{Xan}
1276 [:alpha:] becomes \ep{L}
1277 [:blank:] becomes \eh
1278 [:digit:] becomes \ep{Nd}
1279 [:lower:] becomes \ep{Ll}
1280 [:space:] becomes \ep{Xps}
1281 [:upper:] becomes \ep{Lu}
1282 [:word:] becomes \ep{Xwd}
1283 .sp
1284 Negated versions, such as [:^alpha:] use \eP instead of \ep. The other POSIX
1285 classes are unchanged, and match only characters with code points less than
1286 128.
1287 .
1288 .
1289 .SH "VERTICAL BAR"
1290 .rs
1291 .sp
1292 Vertical bar characters are used to separate alternative patterns. For example,
1293 the pattern
1294 .sp
1295 gilbert|sullivan
1296 .sp
1297 matches either "gilbert" or "sullivan". Any number of alternatives may appear,
1298 and an empty alternative is permitted (matching the empty string). The matching
1299 process tries each alternative in turn, from left to right, and the first one
1300 that succeeds is used. If the alternatives are within a subpattern
1301 .\" HTML <a href="#subpattern">
1302 .\" </a>
1303 (defined below),
1304 .\"
1305 "succeeds" means matching the rest of the main pattern as well as the
1306 alternative in the subpattern.
1307 .
1308 .
1309 .SH "INTERNAL OPTION SETTING"
1310 .rs
1311 .sp
1312 The settings of the PCRE_CASELESS, PCRE_MULTILINE, PCRE_DOTALL, and
1313 PCRE_EXTENDED options (which are Perl-compatible) can be changed from within
1314 the pattern by a sequence of Perl option letters enclosed between "(?" and ")".
1315 The option letters are
1316 .sp
1317 i for PCRE_CASELESS
1318 m for PCRE_MULTILINE
1319 s for PCRE_DOTALL
1320 x for PCRE_EXTENDED
1321 .sp
1322 For example, (?im) sets caseless, multiline matching. It is also possible to
1323 unset these options by preceding the letter with a hyphen, and a combined
1324 setting and unsetting such as (?im-sx), which sets PCRE_CASELESS and
1325 PCRE_MULTILINE while unsetting PCRE_DOTALL and PCRE_EXTENDED, is also
1326 permitted. If a letter appears both before and after the hyphen, the option is
1327 unset.
1328 .P
1329 The PCRE-specific options PCRE_DUPNAMES, PCRE_UNGREEDY, and PCRE_EXTRA can be
1330 changed in the same way as the Perl-compatible options by using the characters
1331 J, U and X respectively.
1332 .P
1333 When one of these option changes occurs at top level (that is, not inside
1334 subpattern parentheses), the change applies to the remainder of the pattern
1335 that follows. If the change is placed right at the start of a pattern, PCRE
1336 extracts it into the global options (and it will therefore show up in data
1337 extracted by the \fBpcre_fullinfo()\fP function).
1338 .P
1339 An option change within a subpattern (see below for a description of
1340 subpatterns) affects only that part of the subpattern that follows it, so
1341 .sp
1342 (a(?i)b)c
1343 .sp
1344 matches abc and aBc and no other strings (assuming PCRE_CASELESS is not used).
1345 By this means, options can be made to have different settings in different
1346 parts of the pattern. Any changes made in one alternative do carry on
1347 into subsequent branches within the same subpattern. For example,
1348 .sp
1349 (a(?i)b|c)
1350 .sp
1351 matches "ab", "aB", "c", and "C", even though when matching "C" the first
1352 branch is abandoned before the option setting. This is because the effects of
1353 option settings happen at compile time. There would be some very weird
1354 behaviour otherwise.
1355 .P
1356 \fBNote:\fP There are other PCRE-specific options that can be set by the
1357 application when the compiling or matching functions are called. In some cases
1358 the pattern can contain special leading sequences such as (*CRLF) to override
1359 what the application has set or what has been defaulted. Details are given in
1360 the section entitled
1361 .\" HTML <a href="#newlineseq">
1362 .\" </a>
1363 "Newline sequences"
1364 .\"
1365 above. There are also the (*UTF8), (*UTF16),(*UTF32), and (*UCP) leading
1366 sequences that can be used to set UTF and Unicode property modes; they are
1367 equivalent to setting the PCRE_UTF8, PCRE_UTF16, PCRE_UTF32 and the PCRE_UCP
1368 options, respectively. The (*UTF) sequence is a generic version that can be
1369 used with any of the libraries.
1370 .
1371 .
1372 .\" HTML <a name="subpattern"></a>
1373 .SH SUBPATTERNS
1374 .rs
1375 .sp
1376 Subpatterns are delimited by parentheses (round brackets), which can be nested.
1377 Turning part of a pattern into a subpattern does two things:
1378 .sp
1379 1. It localizes a set of alternatives. For example, the pattern
1380 .sp
1381 cat(aract|erpillar|)
1382 .sp
1383 matches "cataract", "caterpillar", or "cat". Without the parentheses, it would
1384 match "cataract", "erpillar" or an empty string.
1385 .sp
1386 2. It sets up the subpattern as a capturing subpattern. This means that, when
1387 the whole pattern matches, that portion of the subject string that matched the
1388 subpattern is passed back to the caller via the \fIovector\fP argument of the
1389 matching function. (This applies only to the traditional matching functions;
1390 the DFA matching functions do not support capturing.)
1391 .P
1392 Opening parentheses are counted from left to right (starting from 1) to obtain
1393 numbers for the capturing subpatterns. For example, if the string "the red
1394 king" is matched against the pattern
1395 .sp
1396 the ((red|white) (king|queen))
1397 .sp
1398 the captured substrings are "red king", "red", and "king", and are numbered 1,
1399 2, and 3, respectively.
1400 .P
1401 The fact that plain parentheses fulfil two functions is not always helpful.
1402 There are often times when a grouping subpattern is required without a
1403 capturing requirement. If an opening parenthesis is followed by a question mark
1404 and a colon, the subpattern does not do any capturing, and is not counted when
1405 computing the number of any subsequent capturing subpatterns. For example, if
1406 the string "the white queen" is matched against the pattern
1407 .sp
1408 the ((?:red|white) (king|queen))
1409 .sp
1410 the captured substrings are "white queen" and "queen", and are numbered 1 and
1411 2. The maximum number of capturing subpatterns is 65535.
1412 .P
1413 As a convenient shorthand, if any option settings are required at the start of
1414 a non-capturing subpattern, the option letters may appear between the "?" and
1415 the ":". Thus the two patterns
1416 .sp
1417 (?i:saturday|sunday)
1418 (?:(?i)saturday|sunday)
1419 .sp
1420 match exactly the same set of strings. Because alternative branches are tried
1421 from left to right, and options are not reset until the end of the subpattern
1422 is reached, an option setting in one branch does affect subsequent branches, so
1423 the above patterns match "SUNDAY" as well as "Saturday".
1424 .
1425 .
1426 .\" HTML <a name="dupsubpatternnumber"></a>
1427 .SH "DUPLICATE SUBPATTERN NUMBERS"
1428 .rs
1429 .sp
1430 Perl 5.10 introduced a feature whereby each alternative in a subpattern uses
1431 the same numbers for its capturing parentheses. Such a subpattern starts with
1432 (?| and is itself a non-capturing subpattern. For example, consider this
1433 pattern:
1434 .sp
1435 (?|(Sat)ur|(Sun))day
1436 .sp
1437 Because the two alternatives are inside a (?| group, both sets of capturing
1438 parentheses are numbered one. Thus, when the pattern matches, you can look
1439 at captured substring number one, whichever alternative matched. This construct
1440 is useful when you want to capture part, but not all, of one of a number of
1441 alternatives. Inside a (?| group, parentheses are numbered as usual, but the
1442 number is reset at the start of each branch. The numbers of any capturing
1443 parentheses that follow the subpattern start after the highest number used in
1444 any branch. The following example is taken from the Perl documentation. The
1445 numbers underneath show in which buffer the captured content will be stored.
1446 .sp
1447 # before ---------------branch-reset----------- after
1448 / ( a ) (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x
1449 # 1 2 2 3 2 3 4
1450 .sp
1451 A back reference to a numbered subpattern uses the most recent value that is
1452 set for that number by any subpattern. The following pattern matches "abcabc"
1453 or "defdef":
1454 .sp
1455 /(?|(abc)|(def))\e1/
1456 .sp
1457 In contrast, a subroutine call to a numbered subpattern always refers to the
1458 first one in the pattern with the given number. The following pattern matches
1459 "abcabc" or "defabc":
1460 .sp
1461 /(?|(abc)|(def))(?1)/
1462 .sp
1463 If a
1464 .\" HTML <a href="#conditions">
1465 .\" </a>
1466 condition test
1467 .\"
1468 for a subpattern's having matched refers to a non-unique number, the test is
1469 true if any of the subpatterns of that number have matched.
1470 .P
1471 An alternative approach to using this "branch reset" feature is to use
1472 duplicate named subpatterns, as described in the next section.
1473 .
1474 .
1475 .SH "NAMED SUBPATTERNS"
1476 .rs
1477 .sp
1478 Identifying capturing parentheses by number is simple, but it can be very hard
1479 to keep track of the numbers in complicated regular expressions. Furthermore,
1480 if an expression is modified, the numbers may change. To help with this
1481 difficulty, PCRE supports the naming of subpatterns. This feature was not
1482 added to Perl until release 5.10. Python had the feature earlier, and PCRE
1483 introduced it at release 4.0, using the Python syntax. PCRE now supports both
1484 the Perl and the Python syntax. Perl allows identically numbered subpatterns to
1485 have different names, but PCRE does not.
1486 .P
1487 In PCRE, a subpattern can be named in one of three ways: (?<name>...) or
1488 (?'name'...) as in Perl, or (?P<name>...) as in Python. References to capturing
1489 parentheses from other parts of the pattern, such as
1490 .\" HTML <a href="#backreferences">
1491 .\" </a>
1492 back references,
1493 .\"
1494 .\" HTML <a href="#recursion">
1495 .\" </a>
1496 recursion,
1497 .\"
1498 and
1499 .\" HTML <a href="#conditions">
1500 .\" </a>
1501 conditions,
1502 .\"
1503 can be made by name as well as by number.
1504 .P
1505 Names consist of up to 32 alphanumeric characters and underscores. Named
1506 capturing parentheses are still allocated numbers as well as names, exactly as
1507 if the names were not present. The PCRE API provides function calls for
1508 extracting the name-to-number translation table from a compiled pattern. There
1509 is also a convenience function for extracting a captured substring by name.
1510 .P
1511 By default, a name must be unique within a pattern, but it is possible to relax
1512 this constraint by setting the PCRE_DUPNAMES option at compile time. (Duplicate
1513 names are also always permitted for subpatterns with the same number, set up as
1514 described in the previous section.) Duplicate names can be useful for patterns
1515 where only one instance of the named parentheses can match. Suppose you want to
1516 match the name of a weekday, either as a 3-letter abbreviation or as the full
1517 name, and in both cases you want to extract the abbreviation. This pattern
1518 (ignoring the line breaks) does the job:
1519 .sp
1520 (?<DN>Mon|Fri|Sun)(?:day)?|
1521 (?<DN>Tue)(?:sday)?|
1522 (?<DN>Wed)(?:nesday)?|
1523 (?<DN>Thu)(?:rsday)?|
1524 (?<DN>Sat)(?:urday)?
1525 .sp
1526 There are five capturing substrings, but only one is ever set after a match.
1527 (An alternative way of solving this problem is to use a "branch reset"
1528 subpattern, as described in the previous section.)
1529 .P
1530 The convenience function for extracting the data by name returns the substring
1531 for the first (and in this example, the only) subpattern of that name that
1532 matched. This saves searching to find which numbered subpattern it was.
1533 .P
1534 If you make a back reference to a non-unique named subpattern from elsewhere in
1535 the pattern, the one that corresponds to the first occurrence of the name is
1536 used. In the absence of duplicate numbers (see the previous section) this is
1537 the one with the lowest number. If you use a named reference in a condition
1538 test (see the
1539 .\"
1540 .\" HTML <a href="#conditions">
1541 .\" </a>
1542 section about conditions
1543 .\"
1544 below), either to check whether a subpattern has matched, or to check for
1545 recursion, all subpatterns with the same name are tested. If the condition is
1546 true for any one of them, the overall condition is true. This is the same
1547 behaviour as testing by number. For further details of the interfaces for
1548 handling named subpatterns, see the
1549 .\" HREF
1550 \fBpcreapi\fP
1551 .\"
1552 documentation.
1553 .P
1554 \fBWarning:\fP You cannot use different names to distinguish between two
1555 subpatterns with the same number because PCRE uses only the numbers when
1556 matching. For this reason, an error is given at compile time if different names
1557 are given to subpatterns with the same number. However, you can give the same
1558 name to subpatterns with the same number, even when PCRE_DUPNAMES is not set.
1559 .
1560 .
1561 .SH REPETITION
1562 .rs
1563 .sp
1564 Repetition is specified by quantifiers, which can follow any of the following
1565 items:
1566 .sp
1567 a literal data character
1568 the dot metacharacter
1569 the \eC escape sequence
1570 the \eX escape sequence
1571 the \eR escape sequence
1572 an escape such as \ed or \epL that matches a single character
1573 a character class
1574 a back reference (see next section)
1575 a parenthesized subpattern (including assertions)
1576 a subroutine call to a subpattern (recursive or otherwise)
1577 .sp
1578 The general repetition quantifier specifies a minimum and maximum number of
1579 permitted matches, by giving the two numbers in curly brackets (braces),
1580 separated by a comma. The numbers must be less than 65536, and the first must
1581 be less than or equal to the second. For example:
1582 .sp
1583 z{2,4}
1584 .sp
1585 matches "zz", "zzz", or "zzzz". A closing brace on its own is not a special
1586 character. If the second number is omitted, but the comma is present, there is
1587 no upper limit; if the second number and the comma are both omitted, the
1588 quantifier specifies an exact number of required matches. Thus
1589 .sp
1590 [aeiou]{3,}
1591 .sp
1592 matches at least 3 successive vowels, but may match many more, while
1593 .sp
1594 \ed{8}
1595 .sp
1596 matches exactly 8 digits. An opening curly bracket that appears in a position
1597 where a quantifier is not allowed, or one that does not match the syntax of a
1598 quantifier, is taken as a literal character. For example, {,6} is not a
1599 quantifier, but a literal string of four characters.
1600 .P
1601 In UTF modes, quantifiers apply to characters rather than to individual data
1602 units. Thus, for example, \ex{100}{2} matches two characters, each of
1603 which is represented by a two-byte sequence in a UTF-8 string. Similarly,
1604 \eX{3} matches three Unicode extended grapheme clusters, each of which may be
1605 several data units long (and they may be of different lengths).
1606 .P
1607 The quantifier {0} is permitted, causing the expression to behave as if the
1608 previous item and the quantifier were not present. This may be useful for
1609 subpatterns that are referenced as
1610 .\" HTML <a href="#subpatternsassubroutines">
1611 .\" </a>
1612 subroutines
1613 .\"
1614 from elsewhere in the pattern (but see also the section entitled
1615 .\" HTML <a href="#subdefine">
1616 .\" </a>
1617 "Defining subpatterns for use by reference only"
1618 .\"
1619 below). Items other than subpatterns that have a {0} quantifier are omitted
1620 from the compiled pattern.
1621 .P
1622 For convenience, the three most common quantifiers have single-character
1623 abbreviations:
1624 .sp
1625 * is equivalent to {0,}
1626 + is equivalent to {1,}
1627 ? is equivalent to {0,1}
1628 .sp
1629 It is possible to construct infinite loops by following a subpattern that can
1630 match no characters with a quantifier that has no upper limit, for example:
1631 .sp
1632 (a?)*
1633 .sp
1634 Earlier versions of Perl and PCRE used to give an error at compile time for
1635 such patterns. However, because there are cases where this can be useful, such
1636 patterns are now accepted, but if any repetition of the subpattern does in fact
1637 match no characters, the loop is forcibly broken.
1638 .P
1639 By default, the quantifiers are "greedy", that is, they match as much as
1640 possible (up to the maximum number of permitted times), without causing the
1641 rest of the pattern to fail. The classic example of where this gives problems
1642 is in trying to match comments in C programs. These appear between /* and */
1643 and within the comment, individual * and / characters may appear. An attempt to
1644 match C comments by applying the pattern
1645 .sp
1646 /\e*.*\e*/
1647 .sp
1648 to the string
1649 .sp
1650 /* first comment */ not comment /* second comment */
1651 .sp
1652 fails, because it matches the entire string owing to the greediness of the .*
1653 item.
1654 .P
1655 However, if a quantifier is followed by a question mark, it ceases to be
1656 greedy, and instead matches the minimum number of times possible, so the
1657 pattern
1658 .sp
1659 /\e*.*?\e*/
1660 .sp
1661 does the right thing with the C comments. The meaning of the various
1662 quantifiers is not otherwise changed, just the preferred number of matches.
1663 Do not confuse this use of question mark with its use as a quantifier in its
1664 own right. Because it has two uses, it can sometimes appear doubled, as in
1665 .sp
1666 \ed??\ed
1667 .sp
1668 which matches one digit by preference, but can match two if that is the only
1669 way the rest of the pattern matches.
1670 .P
1671 If the PCRE_UNGREEDY option is set (an option that is not available in Perl),
1672 the quantifiers are not greedy by default, but individual ones can be made
1673 greedy by following them with a question mark. In other words, it inverts the
1674 default behaviour.
1675 .P
1676 When a parenthesized subpattern is quantified with a minimum repeat count that
1677 is greater than 1 or with a limited maximum, more memory is required for the
1678 compiled pattern, in proportion to the size of the minimum or maximum.
1679 .P
1680 If a pattern starts with .* or .{0,} and the PCRE_DOTALL option (equivalent
1681 to Perl's /s) is set, thus allowing the dot to match newlines, the pattern is
1682 implicitly anchored, because whatever follows will be tried against every
1683 character position in the subject string, so there is no point in retrying the
1684 overall match at any position after the first. PCRE normally treats such a
1685 pattern as though it were preceded by \eA.
1686 .P
1687 In cases where it is known that the subject string contains no newlines, it is
1688 worth setting PCRE_DOTALL in order to obtain this optimization, or
1689 alternatively using ^ to indicate anchoring explicitly.
1690 .P
1691 However, there are some cases where the optimization cannot be used. When .*
1692 is inside capturing parentheses that are the subject of a back reference
1693 elsewhere in the pattern, a match at the start may fail where a later one
1694 succeeds. Consider, for example:
1695 .sp
1696 (.*)abc\e1
1697 .sp
1698 If the subject is "xyz123abc123" the match point is the fourth character. For
1699 this reason, such a pattern is not implicitly anchored.
1700 .P
1701 Another case where implicit anchoring is not applied is when the leading .* is
1702 inside an atomic group. Once again, a match at the start may fail where a later
1703 one succeeds. Consider this pattern:
1704 .sp
1705 (?>.*?a)b
1706 .sp
1707 It matches "ab" in the subject "aab". The use of the backtracking control verbs
1708 (*PRUNE) and (*SKIP) also disable this optimization.
1709 .P
1710 When a capturing subpattern is repeated, the value captured is the substring
1711 that matched the final iteration. For example, after
1712 .sp
1713 (tweedle[dume]{3}\es*)+
1714 .sp
1715 has matched "tweedledum tweedledee" the value of the captured substring is
1716 "tweedledee". However, if there are nested capturing subpatterns, the
1717 corresponding captured values may have been set in previous iterations. For
1718 example, after
1719 .sp
1720 /(a|(b))+/
1721 .sp
1722 matches "aba" the value of the second captured substring is "b".
1723 .
1724 .
1725 .\" HTML <a name="atomicgroup"></a>
1726 .SH "ATOMIC GROUPING AND POSSESSIVE QUANTIFIERS"
1727 .rs
1728 .sp
1729 With both maximizing ("greedy") and minimizing ("ungreedy" or "lazy")
1730 repetition, failure of what follows normally causes the repeated item to be
1731 re-evaluated to see if a different number of repeats allows the rest of the
1732 pattern to match. Sometimes it is useful to prevent this, either to change the
1733 nature of the match, or to cause it fail earlier than it otherwise might, when
1734 the author of the pattern knows there is no point in carrying on.
1735 .P
1736 Consider, for example, the pattern \ed+foo when applied to the subject line
1737 .sp
1738 123456bar
1739 .sp
1740 After matching all 6 digits and then failing to match "foo", the normal
1741 action of the matcher is to try again with only 5 digits matching the \ed+
1742 item, and then with 4, and so on, before ultimately failing. "Atomic grouping"
1743 (a term taken from Jeffrey Friedl's book) provides the means for specifying
1744 that once a subpattern has matched, it is not to be re-evaluated in this way.
1745 .P
1746 If we use atomic grouping for the previous example, the matcher gives up
1747 immediately on failing to match "foo" the first time. The notation is a kind of
1748 special parenthesis, starting with (?> as in this example:
1749 .sp
1750 (?>\ed+)foo
1751 .sp
1752 This kind of parenthesis "locks up" the part of the pattern it contains once
1753 it has matched, and a failure further into the pattern is prevented from
1754 backtracking into it. Backtracking past it to previous items, however, works as
1755 normal.
1756 .P
1757 An alternative description is that a subpattern of this type matches the string
1758 of characters that an identical standalone pattern would match, if anchored at
1759 the current point in the subject string.
1760 .P
1761 Atomic grouping subpatterns are not capturing subpatterns. Simple cases such as
1762 the above example can be thought of as a maximizing repeat that must swallow
1763 everything it can. So, while both \ed+ and \ed+? are prepared to adjust the
1764 number of digits they match in order to make the rest of the pattern match,
1765 (?>\ed+) can only match an entire sequence of digits.
1766 .P
1767 Atomic groups in general can of course contain arbitrarily complicated
1768 subpatterns, and can be nested. However, when the subpattern for an atomic
1769 group is just a single repeated item, as in the example above, a simpler
1770 notation, called a "possessive quantifier" can be used. This consists of an
1771 additional + character following a quantifier. Using this notation, the
1772 previous example can be rewritten as
1773 .sp
1774 \ed++foo
1775 .sp
1776 Note that a possessive quantifier can be used with an entire group, for
1777 example:
1778 .sp
1779 (abc|xyz){2,3}+
1780 .sp
1781 Possessive quantifiers are always greedy; the setting of the PCRE_UNGREEDY
1782 option is ignored. They are a convenient notation for the simpler forms of
1783 atomic group. However, there is no difference in the meaning of a possessive
1784 quantifier and the equivalent atomic group, though there may be a performance
1785 difference; possessive quantifiers should be slightly faster.
1786 .P
1787 The possessive quantifier syntax is an extension to the Perl 5.8 syntax.
1788 Jeffrey Friedl originated the idea (and the name) in the first edition of his
1789 book. Mike McCloskey liked it, so implemented it when he built Sun's Java
1790 package, and PCRE copied it from there. It ultimately found its way into Perl
1791 at release 5.10.
1792 .P
1793 PCRE has an optimization that automatically "possessifies" certain simple
1794 pattern constructs. For example, the sequence A+B is treated as A++B because
1795 there is no point in backtracking into a sequence of A's when B must follow.
1796 .P
1797 When a pattern contains an unlimited repeat inside a subpattern that can itself
1798 be repeated an unlimited number of times, the use of an atomic group is the
1799 only way to avoid some failing matches taking a very long time indeed. The
1800 pattern
1801 .sp
1802 (\eD+|<\ed+>)*[!?]
1803 .sp
1804 matches an unlimited number of substrings that either consist of non-digits, or
1805 digits enclosed in <>, followed by either ! or ?. When it matches, it runs
1806 quickly. However, if it is applied to
1807 .sp
1808 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
1809 .sp
1810 it takes a long time before reporting failure. This is because the string can
1811 be divided between the internal \eD+ repeat and the external * repeat in a
1812 large number of ways, and all have to be tried. (The example uses [!?] rather
1813 than a single character at the end, because both PCRE and Perl have an
1814 optimization that allows for fast failure when a single character is used. They
1815 remember the last single character that is required for a match, and fail early
1816 if it is not present in the string.) If the pattern is changed so that it uses
1817 an atomic group, like this:
1818 .sp
1819 ((?>\eD+)|<\ed+>)*[!?]
1820 .sp
1821 sequences of non-digits cannot be broken, and failure happens quickly.
1822 .
1823 .
1824 .\" HTML <a name="backreferences"></a>
1825 .SH "BACK REFERENCES"
1826 .rs
1827 .sp
1828 Outside a character class, a backslash followed by a digit greater than 0 (and
1829 possibly further digits) is a back reference to a capturing subpattern earlier
1830 (that is, to its left) in the pattern, provided there have been that many
1831 previous capturing left parentheses.
1832 .P
1833 However, if the decimal number following the backslash is less than 10, it is
1834 always taken as a back reference, and causes an error only if there are not
1835 that many capturing left parentheses in the entire pattern. In other words, the
1836 parentheses that are referenced need not be to the left of the reference for
1837 numbers less than 10. A "forward back reference" of this type can make sense
1838 when a repetition is involved and the subpattern to the right has participated
1839 in an earlier iteration.
1840 .P
1841 It is not possible to have a numerical "forward back reference" to a subpattern
1842 whose number is 10 or more using this syntax because a sequence such as \e50 is
1843 interpreted as a character defined in octal. See the subsection entitled
1844 "Non-printing characters"
1845 .\" HTML <a href="#digitsafterbackslash">
1846 .\" </a>
1847 above
1848 .\"
1849 for further details of the handling of digits following a backslash. There is
1850 no such problem when named parentheses are used. A back reference to any
1851 subpattern is possible using named parentheses (see below).
1852 .P
1853 Another way of avoiding the ambiguity inherent in the use of digits following a
1854 backslash is to use the \eg escape sequence. This escape must be followed by an
1855 unsigned number or a negative number, optionally enclosed in braces. These
1856 examples are all identical:
1857 .sp
1858 (ring), \e1
1859 (ring), \eg1
1860 (ring), \eg{1}
1861 .sp
1862 An unsigned number specifies an absolute reference without the ambiguity that
1863 is present in the older syntax. It is also useful when literal digits follow
1864 the reference. A negative number is a relative reference. Consider this
1865 example:
1866 .sp
1867 (abc(def)ghi)\eg{-1}
1868 .sp
1869 The sequence \eg{-1} is a reference to the most recently started capturing
1870 subpattern before \eg, that is, is it equivalent to \e2 in this example.
1871 Similarly, \eg{-2} would be equivalent to \e1. The use of relative references
1872 can be helpful in long patterns, and also in patterns that are created by
1873 joining together fragments that contain references within themselves.
1874 .P
1875 A back reference matches whatever actually matched the capturing subpattern in
1876 the current subject string, rather than anything matching the subpattern
1877 itself (see
1878 .\" HTML <a href="#subpatternsassubroutines">
1879 .\" </a>
1880 "Subpatterns as subroutines"
1881 .\"
1882 below for a way of doing that). So the pattern
1883 .sp
1884 (sens|respons)e and \e1ibility
1885 .sp
1886 matches "sense and sensibility" and "response and responsibility", but not
1887 "sense and responsibility". If caseful matching is in force at the time of the
1888 back reference, the case of letters is relevant. For example,
1889 .sp
1890 ((?i)rah)\es+\e1
1891 .sp
1892 matches "rah rah" and "RAH RAH", but not "RAH rah", even though the original
1893 capturing subpattern is matched caselessly.
1894 .P
1895 There are several different ways of writing back references to named
1896 subpatterns. The .NET syntax \ek{name} and the Perl syntax \ek<name> or
1897 \ek'name' are supported, as is the Python syntax (?P=name). Perl 5.10's unified
1898 back reference syntax, in which \eg can be used for both numeric and named
1899 references, is also supported. We could rewrite the above example in any of
1900 the following ways:
1901 .sp
1902 (?<p1>(?i)rah)\es+\ek<p1>
1903 (?'p1'(?i)rah)\es+\ek{p1}
1904 (?P<p1>(?i)rah)\es+(?P=p1)
1905 (?<p1>(?i)rah)\es+\eg{p1}
1906 .sp
1907 A subpattern that is referenced by name may appear in the pattern before or
1908 after the reference.
1909 .P
1910 There may be more than one back reference to the same subpattern. If a
1911 subpattern has not actually been used in a particular match, any back
1912 references to it always fail by default. For example, the pattern
1913 .sp
1914 (a|(bc))\e2
1915 .sp
1916 always fails if it starts to match "a" rather than "bc". However, if the
1917 PCRE_JAVASCRIPT_COMPAT option is set at compile time, a back reference to an
1918 unset value matches an empty string.
1919 .P
1920 Because there may be many capturing parentheses in a pattern, all digits
1921 following a backslash are taken as part of a potential back reference number.
1922 If the pattern continues with a digit character, some delimiter must be used to
1923 terminate the back reference. If the PCRE_EXTENDED option is set, this can be
1924 white space. Otherwise, the \eg{ syntax or an empty comment (see
1925 .\" HTML <a href="#comments">
1926 .\" </a>
1927 "Comments"
1928 .\"
1929 below) can be used.
1930 .
1931 .SS "Recursive back references"
1932 .rs
1933 .sp
1934 A back reference that occurs inside the parentheses to which it refers fails
1935 when the subpattern is first used, so, for example, (a\e1) never matches.
1936 However, such references can be useful inside repeated subpatterns. For
1937 example, the pattern
1938 .sp
1939 (a|b\e1)+
1940 .sp
1941 matches any number of "a"s and also "aba", "ababbaa" etc. At each iteration of
1942 the subpattern, the back reference matches the character string corresponding
1943 to the previous iteration. In order for this to work, the pattern must be such
1944 that the first iteration does not need to match the back reference. This can be
1945 done using alternation, as in the example above, or by a quantifier with a
1946 minimum of zero.
1947 .P
1948 Back references of this type cause the group that they reference to be treated
1949 as an
1950 .\" HTML <a href="#atomicgroup">
1951 .\" </a>
1952 atomic group.
1953 .\"
1954 Once the whole group has been matched, a subsequent matching failure cannot
1955 cause backtracking into the middle of the group.
1956 .
1957 .
1958 .\" HTML <a name="bigassertions"></a>
1959 .SH ASSERTIONS
1960 .rs
1961 .sp
1962 An assertion is a test on the characters following or preceding the current
1963 matching point that does not actually consume any characters. The simple
1964 assertions coded as \eb, \eB, \eA, \eG, \eZ, \ez, ^ and $ are described
1965 .\" HTML <a href="#smallassertions">
1966 .\" </a>
1967 above.
1968 .\"
1969 .P
1970 More complicated assertions are coded as subpatterns. There are two kinds:
1971 those that look ahead of the current position in the subject string, and those
1972 that look behind it. An assertion subpattern is matched in the normal way,
1973 except that it does not cause the current matching position to be changed.
1974 .P
1975 Assertion subpatterns are not capturing subpatterns. If such an assertion
1976 contains capturing subpatterns within it, these are counted for the purposes of
1977 numbering the capturing subpatterns in the whole pattern. However, substring
1978 capturing is carried out only for positive assertions. (Perl sometimes, but not
1979 always, does do capturing in negative assertions.)
1980 .P
1981 For compatibility with Perl, assertion subpatterns may be repeated; though
1982 it makes no sense to assert the same thing several times, the side effect of
1983 capturing parentheses may occasionally be useful. In practice, there only three
1984 cases:
1985 .sp
1986 (1) If the quantifier is {0}, the assertion is never obeyed during matching.
1987 However, it may contain internal capturing parenthesized groups that are called
1988 from elsewhere via the
1989 .\" HTML <a href="#subpatternsassubroutines">
1990 .\" </a>
1991 subroutine mechanism.
1992 .\"
1993 .sp
1994 (2) If quantifier is {0,n} where n is greater than zero, it is treated as if it
1995 were {0,1}. At run time, the rest of the pattern match is tried with and
1996 without the assertion, the order depending on the greediness of the quantifier.
1997 .sp
1998 (3) If the minimum repetition is greater than zero, the quantifier is ignored.
1999 The assertion is obeyed just once when encountered during matching.
2000 .
2001 .
2002 .SS "Lookahead assertions"
2003 .rs
2004 .sp
2005 Lookahead assertions start with (?= for positive assertions and (?! for
2006 negative assertions. For example,
2007 .sp
2008 \ew+(?=;)
2009 .sp
2010 matches a word followed by a semicolon, but does not include the semicolon in
2011 the match, and
2012 .sp
2013 foo(?!bar)
2014 .sp
2015 matches any occurrence of "foo" that is not followed by "bar". Note that the
2016 apparently similar pattern
2017 .sp
2018 (?!foo)bar
2019 .sp
2020 does not find an occurrence of "bar" that is preceded by something other than
2021 "foo"; it finds any occurrence of "bar" whatsoever, because the assertion
2022 (?!foo) is always true when the next three characters are "bar". A
2023 lookbehind assertion is needed to achieve the other effect.
2024 .P
2025 If you want to force a matching failure at some point in a pattern, the most
2026 convenient way to do it is with (?!) because an empty string always matches, so
2027 an assertion that requires there not to be an empty string must always fail.
2028 The backtracking control verb (*FAIL) or (*F) is a synonym for (?!).
2029 .
2030 .
2031 .\" HTML <a name="lookbehind"></a>
2032 .SS "Lookbehind assertions"
2033 .rs
2034 .sp
2035 Lookbehind assertions start with (?<= for positive assertions and (?<! for
2036 negative assertions. For example,
2037 .sp
2038 (?<!foo)bar
2039 .sp
2040 does find an occurrence of "bar" that is not preceded by "foo". The contents of
2041 a lookbehind assertion are restricted such that all the strings it matches must
2042 have a fixed length. However, if there are several top-level alternatives, they
2043 do not all have to have the same fixed length. Thus
2044 .sp
2045 (?<=bullock|donkey)
2046 .sp
2047 is permitted, but
2048 .sp
2049 (?<!dogs?|cats?)
2050 .sp
2051 causes an error at compile time. Branches that match different length strings
2052 are permitted only at the top level of a lookbehind assertion. This is an
2053 extension compared with Perl, which requires all branches to match the same
2054 length of string. An assertion such as
2055 .sp
2056 (?<=ab(c|de))
2057 .sp
2058 is not permitted, because its single top-level branch can match two different
2059 lengths, but it is acceptable to PCRE if rewritten to use two top-level
2060 branches:
2061 .sp
2062 (?<=abc|abde)
2063 .sp
2064 In some cases, the escape sequence \eK
2065 .\" HTML <a href="#resetmatchstart">
2066 .\" </a>
2067 (see above)
2068 .\"
2069 can be used instead of a lookbehind assertion to get round the fixed-length
2070 restriction.
2071 .P
2072 The implementation of lookbehind assertions is, for each alternative, to
2073 temporarily move the current position back by the fixed length and then try to
2074 match. If there are insufficient characters before the current position, the
2075 assertion fails.
2076 .P
2077 In a UTF mode, PCRE does not allow the \eC escape (which matches a single data
2078 unit even in a UTF mode) to appear in lookbehind assertions, because it makes
2079 it impossible to calculate the length of the lookbehind. The \eX and \eR
2080 escapes, which can match different numbers of data units, are also not
2081 permitted.
2082 .P
2083 .\" HTML <a href="#subpatternsassubroutines">
2084 .\" </a>
2085 "Subroutine"
2086 .\"
2087 calls (see below) such as (?2) or (?&X) are permitted in lookbehinds, as long
2088 as the subpattern matches a fixed-length string.
2089 .\" HTML <a href="#recursion">
2090 .\" </a>
2091 Recursion,
2092 .\"
2093 however, is not supported.
2094 .P
2095 Possessive quantifiers can be used in conjunction with lookbehind assertions to
2096 specify efficient matching of fixed-length strings at the end of subject
2097 strings. Consider a simple pattern such as
2098 .sp
2099 abcd$
2100 .sp
2101 when applied to a long string that does not match. Because matching proceeds
2102 from left to right, PCRE will look for each "a" in the subject and then see if
2103 what follows matches the rest of the pattern. If the pattern is specified as
2104 .sp
2105 ^.*abcd$
2106 .sp
2107 the initial .* matches the entire string at first, but when this fails (because
2108 there is no following "a"), it backtracks to match all but the last character,
2109 then all but the last two characters, and so on. Once again the search for "a"
2110 covers the entire string, from right to left, so we are no better off. However,
2111 if the pattern is written as
2112 .sp
2113 ^.*+(?<=abcd)
2114 .sp
2115 there can be no backtracking for the .*+ item; it can match only the entire
2116 string. The subsequent lookbehind assertion does a single test on the last four
2117 characters. If it fails, the match fails immediately. For long strings, this
2118 approach makes a significant difference to the processing time.
2119 .
2120 .
2121 .SS "Using multiple assertions"
2122 .rs
2123 .sp
2124 Several assertions (of any sort) may occur in succession. For example,
2125 .sp
2126 (?<=\ed{3})(?<!999)foo
2127 .sp
2128 matches "foo" preceded by three digits that are not "999". Notice that each of
2129 the assertions is applied independently at the same point in the subject
2130 string. First there is a check that the previous three characters are all
2131 digits, and then there is a check that the same three characters are not "999".
2132 This pattern does \fInot\fP match "foo" preceded by six characters, the first
2133 of which are digits and the last three of which are not "999". For example, it
2134 doesn't match "123abcfoo". A pattern to do that is
2135 .sp
2136 (?<=\ed{3}...)(?<!999)foo
2137 .sp
2138 This time the first assertion looks at the preceding six characters, checking
2139 that the first three are digits, and then the second assertion checks that the
2140 preceding three characters are not "999".
2141 .P
2142 Assertions can be nested in any combination. For example,
2143 .sp
2144 (?<=(?<!foo)bar)baz
2145 .sp
2146 matches an occurrence of "baz" that is preceded by "bar" which in turn is not
2147 preceded by "foo", while
2148 .sp
2149 (?<=\ed{3}(?!999)...)foo
2150 .sp
2151 is another pattern that matches "foo" preceded by three digits and any three
2152 characters that are not "999".
2153 .
2154 .
2155 .\" HTML <a name="conditions"></a>
2156 .SH "CONDITIONAL SUBPATTERNS"
2157 .rs
2158 .sp
2159 It is possible to cause the matching process to obey a subpattern
2160 conditionally or to choose between two alternative subpatterns, depending on
2161 the result of an assertion, or whether a specific capturing subpattern has
2162 already been matched. The two possible forms of conditional subpattern are:
2163 .sp
2164 (?(condition)yes-pattern)
2165 (?(condition)yes-pattern|no-pattern)
2166 .sp
2167 If the condition is satisfied, the yes-pattern is used; otherwise the
2168 no-pattern (if present) is used. If there are more than two alternatives in the
2169 subpattern, a compile-time error occurs. Each of the two alternatives may
2170 itself contain nested subpatterns of any form, including conditional
2171 subpatterns; the restriction to two alternatives applies only at the level of
2172 the condition. This pattern fragment is an example where the alternatives are
2173 complex:
2174 .sp
2175 (?(1) (A|B|C) | (D | (?(2)E|F) | E) )
2176 .sp
2177 .P
2178 There are four kinds of condition: references to subpatterns, references to
2179 recursion, a pseudo-condition called DEFINE, and assertions.
2180 .
2181 .SS "Checking for a used subpattern by number"
2182 .rs
2183 .sp
2184 If the text between the parentheses consists of a sequence of digits, the
2185 condition is true if a capturing subpattern of that number has previously
2186 matched. If there is more than one capturing subpattern with the same number
2187 (see the earlier
2188 .\"
2189 .\" HTML <a href="#recursion">
2190 .\" </a>
2191 section about duplicate subpattern numbers),
2192 .\"
2193 the condition is true if any of them have matched. An alternative notation is
2194 to precede the digits with a plus or minus sign. In this case, the subpattern
2195 number is relative rather than absolute. The most recently opened parentheses
2196 can be referenced by (?(-1), the next most recent by (?(-2), and so on. Inside
2197 loops it can also make sense to refer to subsequent groups. The next
2198 parentheses to be opened can be referenced as (?(+1), and so on. (The value
2199 zero in any of these forms is not used; it provokes a compile-time error.)
2200 .P
2201 Consider the following pattern, which contains non-significant white space to
2202 make it more readable (assume the PCRE_EXTENDED option) and to divide it into
2203 three parts for ease of discussion:
2204 .sp
2205 ( \e( )? [^()]+ (?(1) \e) )
2206 .sp
2207 The first part matches an optional opening parenthesis, and if that
2208 character is present, sets it as the first captured substring. The second part
2209 matches one or more characters that are not parentheses. The third part is a
2210 conditional subpattern that tests whether or not the first set of parentheses
2211 matched. If they did, that is, if subject started with an opening parenthesis,
2212 the condition is true, and so the yes-pattern is executed and a closing
2213 parenthesis is required. Otherwise, since no-pattern is not present, the
2214 subpattern matches nothing. In other words, this pattern matches a sequence of
2215 non-parentheses, optionally enclosed in parentheses.
2216 .P
2217 If you were embedding this pattern in a larger one, you could use a relative
2218 reference:
2219 .sp
2220 ...other stuff... ( \e( )? [^()]+ (?(-1) \e) ) ...
2221 .sp
2222 This makes the fragment independent of the parentheses in the larger pattern.
2223 .
2224 .SS "Checking for a used subpattern by name"
2225 .rs
2226 .sp
2227 Perl uses the syntax (?(<name>)...) or (?('name')...) to test for a used
2228 subpattern by name. For compatibility with earlier versions of PCRE, which had
2229 this facility before Perl, the syntax (?(name)...) is also recognized. However,
2230 there is a possible ambiguity with this syntax, because subpattern names may
2231 consist entirely of digits. PCRE looks first for a named subpattern; if it
2232 cannot find one and the name consists entirely of digits, PCRE looks for a
2233 subpattern of that number, which must be greater than zero. Using subpattern
2234 names that consist entirely of digits is not recommended.
2235 .P
2236 Rewriting the above example to use a named subpattern gives this:
2237 .sp
2238 (?<OPEN> \e( )? [^()]+ (?(<OPEN>) \e) )
2239 .sp
2240 If the name used in a condition of this kind is a duplicate, the test is
2241 applied to all subpatterns of the same name, and is true if any one of them has
2242 matched.
2243 .
2244 .SS "Checking for pattern recursion"
2245 .rs
2246 .sp
2247 If the condition is the string (R), and there is no subpattern with the name R,
2248 the condition is true if a recursive call to the whole pattern or any
2249 subpattern has been made. If digits or a name preceded by ampersand follow the
2250 letter R, for example:
2251 .sp
2252 (?(R3)...) or (?(R&name)...)
2253 .sp
2254 the condition is true if the most recent recursion is into a subpattern whose
2255 number or name is given. This condition does not check the entire recursion
2256 stack. If the name used in a condition of this kind is a duplicate, the test is
2257 applied to all subpatterns of the same name, and is true if any one of them is
2258 the most recent recursion.
2259 .P
2260 At "top level", all these recursion test conditions are false.
2261 .\" HTML <a href="#recursion">
2262 .\" </a>
2263 The syntax for recursive patterns
2264 .\"
2265 is described below.
2266 .
2267 .\" HTML <a name="subdefine"></a>
2268 .SS "Defining subpatterns for use by reference only"
2269 .rs
2270 .sp
2271 If the condition is the string (DEFINE), and there is no subpattern with the
2272 name DEFINE, the condition is always false. In this case, there may be only one
2273 alternative in the subpattern. It is always skipped if control reaches this
2274 point in the pattern; the idea of DEFINE is that it can be used to define
2275 subroutines that can be referenced from elsewhere. (The use of
2276 .\" HTML <a href="#subpatternsassubroutines">
2277 .\" </a>
2278 subroutines
2279 .\"
2280 is described below.) For example, a pattern to match an IPv4 address such as
2281 "192.168.23.245" could be written like this (ignore white space and line
2282 breaks):
2283 .sp
2284 (?(DEFINE) (?<byte> 2[0-4]\ed | 25[0-5] | 1\ed\ed | [1-9]?\ed) )
2285 \eb (?&byte) (\e.(?&byte)){3} \eb
2286 .sp
2287 The first part of the pattern is a DEFINE group inside which a another group
2288 named "byte" is defined. This matches an individual component of an IPv4
2289 address (a number less than 256). When matching takes place, this part of the
2290 pattern is skipped because DEFINE acts like a false condition. The rest of the
2291 pattern uses references to the named group to match the four dot-separated
2292 components of an IPv4 address, insisting on a word boundary at each end.
2293 .
2294 .SS "Assertion conditions"
2295 .rs
2296 .sp
2297 If the condition is not in any of the above formats, it must be an assertion.
2298 This may be a positive or negative lookahead or lookbehind assertion. Consider
2299 this pattern, again containing non-significant white space, and with the two
2300 alternatives on the second line:
2301 .sp
2302 (?(?=[^a-z]*[a-z])
2303 \ed{2}-[a-z]{3}-\ed{2} | \ed{2}-\ed{2}-\ed{2} )
2304 .sp
2305 The condition is a positive lookahead assertion that matches an optional
2306 sequence of non-letters followed by a letter. In other words, it tests for the
2307 presence of at least one letter in the subject. If a letter is found, the
2308 subject is matched against the first alternative; otherwise it is matched
2309 against the second. This pattern matches strings in one of the two forms
2310 dd-aaa-dd or dd-dd-dd, where aaa are letters and dd are digits.
2311 .
2312 .
2313 .\" HTML <a name="comments"></a>
2314 .SH COMMENTS
2315 .rs
2316 .sp
2317 There are two ways of including comments in patterns that are processed by
2318 PCRE. In both cases, the start of the comment must not be in a character class,
2319 nor in the middle of any other sequence of related characters such as (?: or a
2320 subpattern name or number. The characters that make up a comment play no part
2321 in the pattern matching.
2322 .P
2323 The sequence (?# marks the start of a comment that continues up to the next
2324 closing parenthesis. Nested parentheses are not permitted. If the PCRE_EXTENDED
2325 option is set, an unescaped # character also introduces a comment, which in
2326 this case continues to immediately after the next newline character or
2327 character sequence in the pattern. Which characters are interpreted as newlines
2328 is controlled by the options passed to a compiling function or by a special
2329 sequence at the start of the pattern, as described in the section entitled
2330 .\" HTML <a href="#newlines">
2331 .\" </a>
2332 "Newline conventions"
2333 .\"
2334 above. Note that the end of this type of comment is a literal newline sequence
2335 in the pattern; escape sequences that happen to represent a newline do not
2336 count. For example, consider this pattern when PCRE_EXTENDED is set, and the
2337 default newline convention is in force:
2338 .sp
2339 abc #comment \en still comment
2340 .sp
2341 On encountering the # character, \fBpcre_compile()\fP skips along, looking for
2342 a newline in the pattern. The sequence \en is still literal at this stage, so
2343 it does not terminate the comment. Only an actual character with the code value
2344 0x0a (the default newline) does so.
2345 .
2346 .
2347 .\" HTML <a name="recursion"></a>
2348 .SH "RECURSIVE PATTERNS"
2349 .rs
2350 .sp
2351 Consider the problem of matching a string in parentheses, allowing for
2352 unlimited nested parentheses. Without the use of recursion, the best that can
2353 be done is to use a pattern that matches up to some fixed depth of nesting. It
2354 is not possible to handle an arbitrary nesting depth.
2355 .P
2356 For some time, Perl has provided a facility that allows regular expressions to
2357 recurse (amongst other things). It does this by interpolating Perl code in the
2358 expression at run time, and the code can refer to the expression itself. A Perl
2359 pattern using code interpolation to solve the parentheses problem can be
2360 created like this:
2361 .sp
2362 $re = qr{\e( (?: (?>[^()]+) | (?p{$re}) )* \e)}x;
2363 .sp
2364 The (?p{...}) item interpolates Perl code at run time, and in this case refers
2365 recursively to the pattern in which it appears.
2366 .P
2367 Obviously, PCRE cannot support the interpolation of Perl code. Instead, it
2368 supports special syntax for recursion of the entire pattern, and also for
2369 individual subpattern recursion. After its introduction in PCRE and Python,
2370 this kind of recursion was subsequently introduced into Perl at release 5.10.
2371 .P
2372 A special item that consists of (? followed by a number greater than zero and a
2373 closing parenthesis is a recursive subroutine call of the subpattern of the
2374 given number, provided that it occurs inside that subpattern. (If not, it is a
2375 .\" HTML <a href="#subpatternsassubroutines">
2376 .\" </a>
2377 non-recursive subroutine
2378 .\"
2379 call, which is described in the next section.) The special item (?R) or (?0) is
2380 a recursive call of the entire regular expression.
2381 .P
2382 This PCRE pattern solves the nested parentheses problem (assume the
2383 PCRE_EXTENDED option is set so that white space is ignored):
2384 .sp
2385 \e( ( [^()]++ | (?R) )* \e)
2386 .sp
2387 First it matches an opening parenthesis. Then it matches any number of
2388 substrings which can either be a sequence of non-parentheses, or a recursive
2389 match of the pattern itself (that is, a correctly parenthesized substring).
2390 Finally there is a closing parenthesis. Note the use of a possessive quantifier
2391 to avoid backtracking into sequences of non-parentheses.
2392 .P
2393 If this were part of a larger pattern, you would not want to recurse the entire
2394 pattern, so instead you could use this:
2395 .sp
2396 ( \e( ( [^()]++ | (?1) )* \e) )
2397 .sp
2398 We have put the pattern into parentheses, and caused the recursion to refer to
2399 them instead of the whole pattern.
2400 .P
2401 In a larger pattern, keeping track of parenthesis numbers can be tricky. This
2402 is made easier by the use of relative references. Instead of (?1) in the
2403 pattern above you can write (?-2) to refer to the second most recently opened
2404 parentheses preceding the recursion. In other words, a negative number counts
2405 capturing parentheses leftwards from the point at which it is encountered.
2406 .P
2407 It is also possible to refer to subsequently opened parentheses, by writing
2408 references such as (?+2). However, these cannot be recursive because the
2409 reference is not inside the parentheses that are referenced. They are always
2410 .\" HTML <a href="#subpatternsassubroutines">
2411 .\" </a>
2412 non-recursive subroutine
2413 .\"
2414 calls, as described in the next section.
2415 .P
2416 An alternative approach is to use named parentheses instead. The Perl syntax
2417 for this is (?&name); PCRE's earlier syntax (?P>name) is also supported. We
2418 could rewrite the above example as follows:
2419 .sp
2420 (?<pn> \e( ( [^()]++ | (?&pn) )* \e) )
2421 .sp
2422 If there is more than one subpattern with the same name, the earliest one is
2423 used.
2424 .P
2425 This particular example pattern that we have been looking at contains nested
2426 unlimited repeats, and so the use of a possessive quantifier for matching
2427 strings of non-parentheses is important when applying the pattern to strings
2428 that do not match. For example, when this pattern is applied to
2429 .sp
2430 (aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa()
2431 .sp
2432 it yields "no match" quickly. However, if a possessive quantifier is not used,
2433 the match runs for a very long time indeed because there are so many different
2434 ways the + and * repeats can carve up the subject, and all have to be tested
2435 before failure can be reported.
2436 .P
2437 At the end of a match, the values of capturing parentheses are those from
2438 the outermost level. If you want to obtain intermediate values, a callout
2439 function can be used (see below and the
2440 .\" HREF
2441 \fBpcrecallout\fP
2442 .\"
2443 documentation). If the pattern above is matched against
2444 .sp
2445 (ab(cd)ef)
2446 .sp
2447 the value for the inner capturing parentheses (numbered 2) is "ef", which is
2448 the last value taken on at the top level. If a capturing subpattern is not
2449 matched at the top level, its final captured value is unset, even if it was
2450 (temporarily) set at a deeper level during the matching process.
2451 .P
2452 If there are more than 15 capturing parentheses in a pattern, PCRE has to
2453 obtain extra memory to store data during a recursion, which it does by using
2454 \fBpcre_malloc\fP, freeing it via \fBpcre_free\fP afterwards. If no memory can
2455 be obtained, the match fails with the PCRE_ERROR_NOMEMORY error.
2456 .P
2457 Do not confuse the (?R) item with the condition (R), which tests for recursion.
2458 Consider this pattern, which matches text in angle brackets, allowing for
2459 arbitrary nesting. Only digits are allowed in nested brackets (that is, when
2460 recursing), whereas any characters are permitted at the outer level.
2461 .sp
2462 < (?: (?(R) \ed++ | [^<>]*+) | (?R)) * >
2463 .sp
2464 In this pattern, (?(R) is the start of a conditional subpattern, with two
2465 different alternatives for the recursive and non-recursive cases. The (?R) item
2466 is the actual recursive call.
2467 .
2468 .
2469 .\" HTML <a name="recursiondifference"></a>
2470 .SS "Differences in recursion processing between PCRE and Perl"
2471 .rs
2472 .sp
2473 Recursion processing in PCRE differs from Perl in two important ways. In PCRE
2474 (like Python, but unlike Perl), a recursive subpattern call is always treated
2475 as an atomic group. That is, once it has matched some of the subject string, it
2476 is never re-entered, even if it contains untried alternatives and there is a
2477 subsequent matching failure. This can be illustrated by the following pattern,
2478 which purports to match a palindromic string that contains an odd number of
2479 characters (for example, "a", "aba", "abcba", "abcdcba"):
2480 .sp
2481 ^(.|(.)(?1)\e2)$
2482 .sp
2483 The idea is that it either matches a single character, or two identical
2484 characters surrounding a sub-palindrome. In Perl, this pattern works; in PCRE
2485 it does not if the pattern is longer than three characters. Consider the
2486 subject string "abcba":
2487 .P
2488 At the top level, the first character is matched, but as it is not at the end
2489 of the string, the first alternative fails; the second alternative is taken
2490 and the recursion kicks in. The recursive call to subpattern 1 successfully
2491 matches the next character ("b"). (Note that the beginning and end of line
2492 tests are not part of the recursion).
2493 .P
2494 Back at the top level, the next character ("c") is compared with what
2495 subpattern 2 matched, which was "a". This fails. Because the recursion is
2496 treated as an atomic group, there are now no backtracking points, and so the
2497 entire match fails. (Perl is able, at this point, to re-enter the recursion and
2498 try the second alternative.) However, if the pattern is written with the
2499 alternatives in the other order, things are different:
2500 .sp
2501 ^((.)(?1)\e2|.)$
2502 .sp
2503 This time, the recursing alternative is tried first, and continues to recurse
2504 until it runs out of characters, at which point the recursion fails. But this
2505 time we do have another alternative to try at the higher level. That is the big
2506 difference: in the previous case the remaining alternative is at a deeper
2507 recursion level, which PCRE cannot use.
2508 .P
2509 To change the pattern so that it matches all palindromic strings, not just
2510 those with an odd number of characters, it is tempting to change the pattern to
2511 this:
2512 .sp
2513 ^((.)(?1)\e2|.?)$
2514 .sp
2515 Again, this works in Perl, but not in PCRE, and for the same reason. When a
2516 deeper recursion has matched a single character, it cannot be entered again in
2517 order to match an empty string. The solution is to separate the two cases, and
2518 write out the odd and even cases as alternatives at the higher level:
2519 .sp
2520 ^(?:((.)(?1)\e2|)|((.)(?3)\e4|.))
2521 .sp
2522 If you want to match typical palindromic phrases, the pattern has to ignore all
2523 non-word characters, which can be done like this:
2524 .sp
2525 ^\eW*+(?:((.)\eW*+(?1)\eW*+\e2|)|((.)\eW*+(?3)\eW*+\e4|\eW*+.\eW*+))\eW*+$
2526 .sp
2527 If run with the PCRE_CASELESS option, this pattern matches phrases such as "A
2528 man, a plan, a canal: Panama!" and it works well in both PCRE and Perl. Note
2529 the use of the possessive quantifier *+ to avoid backtracking into sequences of
2530 non-word characters. Without this, PCRE takes a great deal longer (ten times or
2531 more) to match typical phrases, and Perl takes so long that you think it has
2532 gone into a loop.
2533 .P
2534 \fBWARNING\fP: The palindrome-matching patterns above work only if the subject
2535 string does not start with a palindrome that is shorter than the entire string.
2536 For example, although "abcba" is correctly matched, if the subject is "ababa",
2537 PCRE finds the palindrome "aba" at the start, then fails at top level because
2538 the end of the string does not follow. Once again, it cannot jump back into the
2539 recursion to try other alternatives, so the entire match fails.
2540 .P
2541 The second way in which PCRE and Perl differ in their recursion processing is
2542 in the handling of captured values. In Perl, when a subpattern is called
2543 recursively or as a subpattern (see the next section), it has no access to any
2544 values that were captured outside the recursion, whereas in PCRE these values
2545 can be referenced. Consider this pattern:
2546 .sp
2547 ^(.)(\e1|a(?2))
2548 .sp
2549 In PCRE, this pattern matches "bab". The first capturing parentheses match "b",
2550 then in the second group, when the back reference \e1 fails to match "b", the
2551 second alternative matches "a" and then recurses. In the recursion, \e1 does
2552 now match "b" and so the whole match succeeds. In Perl, the pattern fails to
2553 match because inside the recursive call \e1 cannot access the externally set
2554 value.
2555 .
2556 .
2557 .\" HTML <a name="subpatternsassubroutines"></a>
2558 .SH "SUBPATTERNS AS SUBROUTINES"
2559 .rs
2560 .sp
2561 If the syntax for a recursive subpattern call (either by number or by
2562 name) is used outside the parentheses to which it refers, it operates like a
2563 subroutine in a programming language. The called subpattern may be defined
2564 before or after the reference. A numbered reference can be absolute or
2565 relative, as in these examples:
2566 .sp
2567 (...(absolute)...)...(?2)...
2568 (...(relative)...)...(?-1)...
2569 (...(?+1)...(relative)...
2570 .sp
2571 An earlier example pointed out that the pattern
2572 .sp
2573 (sens|respons)e and \e1ibility
2574 .sp
2575 matches "sense and sensibility" and "response and responsibility", but not
2576 "sense and responsibility". If instead the pattern
2577 .sp
2578 (sens|respons)e and (?1)ibility
2579 .sp
2580 is used, it does match "sense and responsibility" as well as the other two
2581 strings. Another example is given in the discussion of DEFINE above.
2582 .P
2583 All subroutine calls, whether recursive or not, are always treated as atomic
2584 groups. That is, once a subroutine has matched some of the subject string, it
2585 is never re-entered, even if it contains untried alternatives and there is a
2586 subsequent matching failure. Any capturing parentheses that are set during the
2587 subroutine call revert to their previous values afterwards.
2588 .P
2589 Processing options such as case-independence are fixed when a subpattern is
2590 defined, so if it is used as a subroutine, such options cannot be changed for
2591 different calls. For example, consider this pattern:
2592 .sp
2593 (abc)(?i:(?-1))
2594 .sp
2595 It matches "abcabc". It does not match "abcABC" because the change of
2596 processing option does not affect the called subpattern.
2597 .
2598 .
2599 .\" HTML <a name="onigurumasubroutines"></a>
2600 .SH "ONIGURUMA SUBROUTINE SYNTAX"
2601 .rs
2602 .sp
2603 For compatibility with Oniguruma, the non-Perl syntax \eg followed by a name or
2604 a number enclosed either in angle brackets or single quotes, is an alternative
2605 syntax for referencing a subpattern as a subroutine, possibly recursively. Here
2606 are two of the examples used above, rewritten using this syntax:
2607 .sp
2608 (?<pn> \e( ( (?>[^()]+) | \eg<pn> )* \e) )
2609 (sens|respons)e and \eg'1'ibility
2610 .sp
2611 PCRE supports an extension to Oniguruma: if a number is preceded by a
2612 plus or a minus sign it is taken as a relative reference. For example:
2613 .sp
2614 (abc)(?i:\eg<-1>)
2615 .sp
2616 Note that \eg{...} (Perl syntax) and \eg<...> (Oniguruma syntax) are \fInot\fP
2617 synonymous. The former is a back reference; the latter is a subroutine call.
2618 .
2619 .
2620 .SH CALLOUTS
2621 .rs
2622 .sp
2623 Perl has a feature whereby using the sequence (?{...}) causes arbitrary Perl
2624 code to be obeyed in the middle of matching a regular expression. This makes it
2625 possible, amongst other things, to extract different substrings that match the
2626 same pair of parentheses when there is a repetition.
2627 .P
2628 PCRE provides a similar feature, but of course it cannot obey arbitrary Perl
2629 code. The feature is called "callout". The caller of PCRE provides an external
2630 function by putting its entry point in the global variable \fIpcre_callout\fP
2631 (8-bit library) or \fIpcre[16|32]_callout\fP (16-bit or 32-bit library).
2632 By default, this variable contains NULL, which disables all calling out.
2633 .P
2634 Within a regular expression, (?C) indicates the points at which the external
2635 function is to be called. If you want to identify different callout points, you
2636 can put a number less than 256 after the letter C. The default value is zero.
2637 For example, this pattern has two callout points:
2638 .sp
2639 (?C1)abc(?C2)def
2640 .sp
2641 If the PCRE_AUTO_CALLOUT flag is passed to a compiling function, callouts are
2642 automatically installed before each item in the pattern. They are all numbered
2643 255. If there is a conditional group in the pattern whose condition is an
2644 assertion, an additional callout is inserted just before the condition. An
2645 explicit callout may also be set at this position, as in this example:
2646 .sp
2647 (?(?C9)(?=a)abc|def)
2648 .sp
2649 Note that this applies only to assertion conditions, not to other types of
2650 condition.
2651 .P
2652 During matching, when PCRE reaches a callout point, the external function is
2653 called. It is provided with the number of the callout, the position in the
2654 pattern, and, optionally, one item of data originally supplied by the caller of
2655 the matching function. The callout function may cause matching to proceed, to
2656 backtrack, or to fail altogether. A complete description of the interface to
2657 the callout function is given in the
2658 .\" HREF
2659 \fBpcrecallout\fP
2660 .\"
2661 documentation.
2662 .
2663 .
2664 .\" HTML <a name="backtrackcontrol"></a>
2665 .SH "BACKTRACKING CONTROL"
2666 .rs
2667 .sp
2668 Perl 5.10 introduced a number of "Special Backtracking Control Verbs", which
2669 are still described in the Perl documentation as "experimental and subject to
2670 change or removal in a future version of Perl". It goes on to say: "Their usage
2671 in production code should be noted to avoid problems during upgrades." The same
2672 remarks apply to the PCRE features described in this section.
2673 .P
2674 The new verbs make use of what was previously invalid syntax: an opening
2675 parenthesis followed by an asterisk. They are generally of the form
2676 (*VERB) or (*VERB:NAME). Some may take either form, with differing behaviour,
2677 depending on whether or not a name is present. A name is any sequence of
2678 characters that does not include a closing parenthesis. The maximum length of
2679 name is 255 in the 8-bit library and 65535 in the 16-bit and 32-bit libraries.
2680 If the name is empty, that is, if the closing parenthesis immediately follows
2681 the colon, the effect is as if the colon were not there. Any number of these
2682 verbs may occur in a pattern.
2683 .P
2684 Since these verbs are specifically related to backtracking, most of them can be
2685 used only when the pattern is to be matched using one of the traditional
2686 matching functions, because these use a backtracking algorithm. With the
2687 exception of (*FAIL), which behaves like a failing negative assertion, the
2688 backtracking control verbs cause an error if encountered by a DFA matching
2689 function.
2690 .P
2691 The behaviour of these verbs in
2692 .\" HTML <a href="#btrepeat">
2693 .\" </a>
2694 repeated groups,
2695 .\"
2696 .\" HTML <a href="#btassert">
2697 .\" </a>
2698 assertions,
2699 .\"
2700 and in
2701 .\" HTML <a href="#btsub">
2702 .\" </a>
2703 subpatterns called as subroutines
2704 .\"
2705 (whether or not recursively) is documented below.
2706 .
2707 .
2708 .\" HTML <a name="nooptimize"></a>
2709 .SS "Optimizations that affect backtracking verbs"
2710 .rs
2711 .sp
2712 PCRE contains some optimizations that are used to speed up matching by running
2713 some checks at the start of each match attempt. For example, it may know the
2714 minimum length of matching subject, or that a particular character must be
2715 present. When one of these optimizations bypasses the running of a match, any
2716 included backtracking verbs will not, of course, be processed. You can suppress
2717 the start-of-match optimizations by setting the PCRE_NO_START_OPTIMIZE option
2718 when calling \fBpcre_compile()\fP or \fBpcre_exec()\fP, or by starting the
2719 pattern with (*NO_START_OPT). There is more discussion of this option in the
2720 section entitled
2721 .\" HTML <a href="pcreapi.html#execoptions">
2722 .\" </a>
2723 "Option bits for \fBpcre_exec()\fP"
2724 .\"
2725 in the
2726 .\" HREF
2727 \fBpcreapi\fP
2728 .\"
2729 documentation.
2730 .P
2731 Experiments with Perl suggest that it too has similar optimizations, sometimes
2732 leading to anomalous results.
2733 .
2734 .
2735 .SS "Verbs that act immediately"
2736 .rs
2737 .sp
2738 The following verbs act as soon as they are encountered. They may not be
2739 followed by a name.
2740 .sp
2741 (*ACCEPT)
2742 .sp
2743 This verb causes the match to end successfully, skipping the remainder of the
2744 pattern. However, when it is inside a subpattern that is called as a
2745 subroutine, only that subpattern is ended successfully. Matching then continues
2746 at the outer level. If (*ACCEPT) in triggered in a positive assertion, the
2747 assertion succeeds; in a negative assertion, the assertion fails.
2748 .P
2749 If (*ACCEPT) is inside capturing parentheses, the data so far is captured. For
2750 example:
2751 .sp
2752 A((?:A|B(*ACCEPT)|C)D)
2753 .sp
2754 This matches "AB", "AAD", or "ACD"; when it matches "AB", "B" is captured by
2755 the outer parentheses.
2756 .sp
2757 (*FAIL) or (*F)
2758 .sp
2759 This verb causes a matching failure, forcing backtracking to occur. It is
2760 equivalent to (?!) but easier to read. The Perl documentation notes that it is
2761 probably useful only when combined with (?{}) or (??{}). Those are, of course,
2762 Perl features that are not present in PCRE. The nearest equivalent is the
2763 callout feature, as for example in this pattern:
2764 .sp
2765 a+(?C)(*FAIL)
2766 .sp
2767 A match with the string "aaaa" always fails, but the callout is taken before
2768 each backtrack happens (in this example, 10 times).
2769 .
2770 .
2771 .SS "Recording which path was taken"
2772 .rs
2773 .sp
2774 There is one verb whose main purpose is to track how a match was arrived at,
2775 though it also has a secondary use in conjunction with advancing the match
2776 starting point (see (*SKIP) below).
2777 .sp
2778 (*MARK:NAME) or (*:NAME)
2779 .sp
2780 A name is always required with this verb. There may be as many instances of
2781 (*MARK) as you like in a pattern, and their names do not have to be unique.
2782 .P
2783 When a match succeeds, the name of the last-encountered (*MARK:NAME),
2784 (*PRUNE:NAME), or (*THEN:NAME) on the matching path is passed back to the
2785 caller as described in the section entitled
2786 .\" HTML <a href="pcreapi.html#extradata">
2787 .\" </a>
2788 "Extra data for \fBpcre_exec()\fP"
2789 .\"
2790 in the
2791 .\" HREF
2792 \fBpcreapi\fP
2793 .\"
2794 documentation. Here is an example of \fBpcretest\fP output, where the /K
2795 modifier requests the retrieval and outputting of (*MARK) data:
2796 .sp
2797 re> /X(*MARK:A)Y|X(*MARK:B)Z/K
2798 data> XY
2799 0: XY
2800 MK: A
2801 XZ
2802 0: XZ
2803 MK: B
2804 .sp
2805 The (*MARK) name is tagged with "MK:" in this output, and in this example it
2806 indicates which of the two alternatives matched. This is a more efficient way
2807 of obtaining this information than putting each alternative in its own
2808 capturing parentheses.
2809 .P
2810 If a verb with a name is encountered in a positive assertion, its name is
2811 recorded and passed back if it is the last-encountered. This does not happen
2812 for negative assertions.
2813 .P
2814 After a partial match or a failed match, the last encountered name in the
2815 entire match process is returned. For example:
2816 .sp
2817 re> /X(*MARK:A)Y|X(*MARK:B)Z/K
2818 data> XP
2819 No match, mark = B
2820 .sp
2821 Note that in this unanchored example the mark is retained from the match
2822 attempt that started at the letter "X" in the subject. Subsequent match
2823 attempts starting at "P" and then with an empty string do not get as far as the
2824 (*MARK) item, but nevertheless do not reset it.
2825 .P
2826 If you are interested in (*MARK) values after failed matches, you should
2827 probably set the PCRE_NO_START_OPTIMIZE option
2828 .\" HTML <a href="#nooptimize">
2829 .\" </a>
2830 (see above)
2831 .\"
2832 to ensure that the match is always attempted.
2833 .
2834 .
2835 .SS "Verbs that act after backtracking"
2836 .rs
2837 .sp
2838 The following verbs do nothing when they are encountered. Matching continues
2839 with what follows, but if there is no subsequent match, causing a backtrack to
2840 the verb, a failure is forced. That is, backtracking cannot pass to the left of
2841 the verb. However, when one of these verbs appears inside an atomic group or an
2842 assertion, its effect is confined to that group, because once the group has
2843 been matched, there is never any backtracking into it. In this situation,
2844 backtracking can "jump back" to the left of the entire atomic group or
2845 assertion. (Remember also, as stated above, that this localization also applies
2846 in subroutine calls.)
2847 .P
2848 These verbs differ in exactly what kind of failure occurs when backtracking
2849 reaches them.
2850 .sp
2851 (*COMMIT)
2852 .sp
2853 This verb, which may not be followed by a name, causes the whole match to fail
2854 outright if there is a later matching failure that causes backtracking to reach
2855 it. Even if the pattern is unanchored, no further attempts to find a match by
2856 advancing the starting point take place. If (*COMMIT) is the only backtracking
2857 verb that is encountered, once it has been passed \fBpcre_exec()\fP is
2858 committed to finding a match at the current starting point, or not at all. For
2859 example:
2860 .sp
2861 a+(*COMMIT)b
2862 .sp
2863 This matches "xxaab" but not "aacaab". It can be thought of as a kind of
2864 dynamic anchor, or "I've started, so I must finish." The name of the most
2865 recently passed (*MARK) in the path is passed back when (*COMMIT) forces a
2866 match failure.
2867 .P
2868 If there is more than one backtracking verb in a pattern, a different one that
2869 follows (*COMMIT) may be triggered first, so merely passing (*COMMIT) during a
2870 match does not always guarantee that a match must be at this starting point.
2871 .P
2872 Note that (*COMMIT) at the start of a pattern is not the same as an anchor,
2873 unless PCRE's start-of-match optimizations are turned off, as shown in this
2874 \fBpcretest\fP example:
2875 .sp
2876 re> /(*COMMIT)abc/
2877 data> xyzabc
2878 0: abc
2879 xyzabc\eY
2880 No match
2881 .sp
2882 PCRE knows that any match must start with "a", so the optimization skips along
2883 the subject to "a" before running the first match attempt, which succeeds. When
2884 the optimization is disabled by the \eY escape in the second subject, the match
2885 starts at "x" and so the (*COMMIT) causes it to fail without trying any other
2886 starting points.
2887 .sp
2888 (*PRUNE) or (*PRUNE:NAME)
2889 .sp
2890 This verb causes the match to fail at the current starting position in the
2891 subject if there is a later matching failure that causes backtracking to reach
2892 it. If the pattern is unanchored, the normal "bumpalong" advance to the next
2893 starting character then happens. Backtracking can occur as usual to the left of
2894 (*PRUNE), before it is reached, or when matching to the right of (*PRUNE), but
2895 if there is no match to the right, backtracking cannot cross (*PRUNE). In
2896 simple cases, the use of (*PRUNE) is just an alternative to an atomic group or
2897 possessive quantifier, but there are some uses of (*PRUNE) that cannot be
2898 expressed in any other way. In an anchored pattern (*PRUNE) has the same effect
2899 as (*COMMIT).
2900 .P
2901 The behaviour of (*PRUNE:NAME) is the not the same as (*MARK:NAME)(*PRUNE).
2902 It is like (*MARK:NAME) in that the name is remembered for passing back to the
2903 caller. However, (*SKIP:NAME) searches only for names set with (*MARK).
2904 .sp
2905 (*SKIP)
2906 .sp
2907 This verb, when given without a name, is like (*PRUNE), except that if the
2908 pattern is unanchored, the "bumpalong" advance is not to the next character,
2909 but to the position in the subject where (*SKIP) was encountered. (*SKIP)
2910 signifies that whatever text was matched leading up to it cannot be part of a
2911 successful match. Consider:
2912 .sp
2913 a+(*SKIP)b
2914 .sp
2915 If the subject is "aaaac...", after the first match attempt fails (starting at
2916 the first character in the string), the starting point skips on to start the
2917 next attempt at "c". Note that a possessive quantifer does not have the same
2918 effect as this example; although it would suppress backtracking during the
2919 first match attempt, the second attempt would start at the second character
2920 instead of skipping on to "c".
2921 .sp
2922 (*SKIP:NAME)
2923 .sp
2924 When (*SKIP) has an associated name, its behaviour is modified. When it is
2925 triggered, the previous path through the pattern is searched for the most
2926 recent (*MARK) that has the same name. If one is found, the "bumpalong" advance
2927 is to the subject position that corresponds to that (*MARK) instead of to where
2928 (*SKIP) was encountered. If no (*MARK) with a matching name is found, the
2929 (*SKIP) is ignored.
2930 .P
2931 Note that (*SKIP:NAME) searches only for names set by (*MARK:NAME). It ignores
2932 names that are set by (*PRUNE:NAME) or (*THEN:NAME).
2933 .sp
2934 (*THEN) or (*THEN:NAME)
2935 .sp
2936 This verb causes a skip to the next innermost alternative when backtracking
2937 reaches it. That is, it cancels any further backtracking within the current
2938 alternative. Its name comes from the observation that it can be used for a
2939 pattern-based if-then-else block:
2940 .sp
2941 ( COND1 (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ ) ...
2942 .sp
2943 If the COND1 pattern matches, FOO is tried (and possibly further items after
2944 the end of the group if FOO succeeds); on failure, the matcher skips to the
2945 second alternative and tries COND2, without backtracking into COND1.
2946 If (*THEN) is not inside an alternation, it acts like (*PRUNE).
2947 .P
2948 The behaviour of (*THEN:NAME) is the not the same as (*MARK:NAME)(*THEN).
2949 It is like (*MARK:NAME) in that the name is remembered for passing back to the
2950 caller. However, (*SKIP:NAME) searches only for names set with (*MARK).
2951 .P
2952 A subpattern that does not contain a | character is just a part of the
2953 enclosing alternative; it is not a nested alternation with only one
2954 alternative. The effect of (*THEN) extends beyond such a subpattern to the
2955 enclosing alternative. Consider this pattern, where A, B, etc. are complex
2956 pattern fragments that do not contain any | characters at this level:
2957 .sp
2958 A (B(*THEN)C) | D
2959 .sp
2960 If A and B are matched, but there is a failure in C, matching does not
2961 backtrack into A; instead it moves to the next alternative, that is, D.
2962 However, if the subpattern containing (*THEN) is given an alternative, it
2963 behaves differently:
2964 .sp
2965 A (B(*THEN)C | (*FAIL)) | D
2966 .sp
2967 The effect of (*THEN) is now confined to the inner subpattern. After a failure
2968 in C, matching moves to (*FAIL), which causes the whole subpattern to fail
2969 because there are no more alternatives to try. In this case, matching does now
2970 backtrack into A.
2971 .P
2972 Note that a conditional subpattern is not considered as having two
2973 alternatives, because only one is ever used. In other words, the | character in
2974 a conditional subpattern has a different meaning. Ignoring white space,
2975 consider:
2976 .sp
2977 ^.*? (?(?=a) a | b(*THEN)c )
2978 .sp
2979 If the subject is "ba", this pattern does not match. Because .*? is ungreedy,
2980 it initially matches zero characters. The condition (?=a) then fails, the
2981 character "b" is matched, but "c" is not. At this point, matching does not
2982 backtrack to .*? as might perhaps be expected from the presence of the |
2983 character. The conditional subpattern is part of the single alternative that
2984 comprises the whole pattern, and so the match fails. (If there was a backtrack
2985 into .*?, allowing it to match "b", the match would succeed.)
2986 .P
2987 The verbs just described provide four different "strengths" of control when
2988 subsequent matching fails. (*THEN) is the weakest, carrying on the match at the
2989 next alternative. (*PRUNE) comes next, failing the match at the current
2990 starting position, but allowing an advance to the next character (for an
2991 unanchored pattern). (*SKIP) is similar, except that the advance may be more
2992 than one character. (*COMMIT) is the strongest, causing the entire match to
2993 fail.
2994 .
2995 .
2996 .SS "More than one backtracking verb"
2997 .rs
2998 .sp
2999 If more than one backtracking verb is present in a pattern, the one that is
3000 backtracked onto first acts. For example, consider this pattern, where A, B,
3001 etc. are complex pattern fragments:
3002 .sp
3003 (A(*COMMIT)B(*THEN)C|ABD)
3004 .sp
3005 If A matches but B fails, the backtrack to (*COMMIT) causes the entire match to
3006 fail. However, if A and B match, but C fails, the backtrack to (*THEN) causes
3007 the next alternative (ABD) to be tried. This behaviour is consistent, but is
3008 not always the same as Perl's. It means that if two or more backtracking verbs
3009 appear in succession, all the the last of them has no effect. Consider this
3010 example:
3011 .sp
3012 ...(*COMMIT)(*PRUNE)...
3013 .sp
3014 If there is a matching failure to the right, backtracking onto (*PRUNE) cases
3015 it to be triggered, and its action is taken. There can never be a backtrack
3016 onto (*COMMIT).
3017 .
3018 .
3019 .\" HTML <a name="btrepeat"></a>
3020 .SS "Backtracking verbs in repeated groups"
3021 .rs
3022 .sp
3023 PCRE differs from Perl in its handling of backtracking verbs in repeated
3024 groups. For example, consider:
3025 .sp
3026 /(a(*COMMIT)b)+ac/
3027 .sp
3028 If the subject is "abac", Perl matches, but PCRE fails because the (*COMMIT) in
3029 the second repeat of the group acts.
3030 .
3031 .
3032 .\" HTML <a name="btassert"></a>
3033 .SS "Backtracking verbs in assertions"
3034 .rs
3035 .sp
3036 (*FAIL) in an assertion has its normal effect: it forces an immediate backtrack.
3037 .P
3038 (*ACCEPT) in a positive assertion causes the assertion to succeed without any
3039 further processing. In a negative assertion, (*ACCEPT) causes the assertion to
3040 fail without any further processing.
3041 .P
3042 The other backtracking verbs are not treated specially if they appear in an
3043 assertion. In particular, (*THEN) skips to the next alternative in the
3044 innermost enclosing group that has alternations, whether or not this is within
3045 the assertion.
3046 .
3047 .
3048 .\" HTML <a name="btsub"></a>
3049 .SS "Backtracking verbs in subroutines"
3050 .rs
3051 .sp
3052 These behaviours occur whether or not the subpattern is called recursively.
3053 Perl's treatment of subroutines is different in some cases.
3054 .P
3055 (*FAIL) in a subpattern called as a subroutine has its normal effect: it forces
3056 an immediate backtrack.
3057 .P
3058 (*ACCEPT) in a subpattern called as a subroutine causes the subroutine match to
3059 succeed without any further processing. Matching then continues after the
3060 subroutine call.
3061 .P
3062 (*COMMIT), (*SKIP), and (*PRUNE) in a subpattern called as a subroutine cause
3063 the subroutine match to fail.
3064 .P
3065 (*THEN) skips to the next alternative in the innermost enclosing group within
3066 the subpattern that has alternatives. If there is no such group within the
3067 subpattern, (*THEN) causes the subroutine match to fail.
3068 .
3069 .
3070 .SH "SEE ALSO"
3071 .rs
3072 .sp
3073 \fBpcreapi\fP(3), \fBpcrecallout\fP(3), \fBpcrematching\fP(3),
3074 \fBpcresyntax\fP(3), \fBpcre\fP(3), \fBpcre16(3)\fP, \fBpcre32(3)\fP.
3075 .
3076 .
3077 .SH AUTHOR
3078 .rs
3079 .sp
3080 .nf
3081 Philip Hazel
3082 University Computing Service
3083 Cambridge CB2 3QH, England.
3084 .fi
3085 .
3086 .
3087 .SH REVISION
3088 .rs
3089 .sp
3090 .nf
3091 Last updated: 22 March 2013
3092 Copyright (c) 1997-2013 University of Cambridge.
3093 .fi

Properties

Name Value
svn:eol-style native
svn:keywords "Author Date Id Revision Url"

  ViewVC Help
Powered by ViewVC 1.1.5