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

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

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 445 by ph10, Sun Sep 13 16:44:49 2009 UTC revision 576 by ph10, Sun Nov 21 18:45:10 2010 UTC
# Line 21  published by O'Reilly, covers regular ex Line 21  published by O'Reilly, covers regular ex
21  description of PCRE's regular expressions is intended as reference material.  description of PCRE's regular expressions is intended as reference material.
22  .P  .P
23  The original operation of PCRE was on strings of one-byte characters. However,  The original operation of PCRE was on strings of one-byte characters. However,
24  there is now also support for UTF-8 character strings. To use this, you must  there is now also support for UTF-8 character strings. To use this,
25  build PCRE to include UTF-8 support, and then call \fBpcre_compile()\fP with  PCRE must be built to include UTF-8 support, and you must call
26  the PCRE_UTF8 option. There is also a special sequence that can be given at the  \fBpcre_compile()\fP or \fBpcre_compile2()\fP with the PCRE_UTF8 option. There
27  start of a pattern:  is also a special sequence that can be given at the start of a pattern:
28  .sp  .sp
29    (*UTF8)    (*UTF8)
30  .sp  .sp
# Line 42  in the main Line 42  in the main
42  .\"  .\"
43  page.  page.
44  .P  .P
45    Another special sequence that may appear at the start of a pattern or in
46    combination with (*UTF8) is:
47    .sp
48      (*UCP)
49    .sp
50    This has the same effect as setting the PCRE_UCP option: it causes sequences
51    such as \ed and \ew to use Unicode properties to determine character types,
52    instead of recognizing only characters with codes less than 128 via a lookup
53    table.
54    .P
55    If a pattern starts with (*NO_START_OPT), it has the same effect as setting the
56    PCRE_NO_START_OPTIMIZE option either at compile or matching time. There are
57    also some more of these special sequences that are concerned with the handling
58    of newlines; they are described below.
59    .P
60  The remainder of this document discusses the patterns that are supported by  The remainder of this document discusses the patterns that are supported by
61  PCRE when its main matching function, \fBpcre_exec()\fP, is used.  PCRE when its main matching function, \fBpcre_exec()\fP, is used.
62  From release 6.0, PCRE offers a second matching function,  From release 6.0, PCRE offers a second matching function,
# Line 56  discussed in the Line 71  discussed in the
71  page.  page.
72  .  .
73  .  .
74    .\" HTML <a name="newlines"></a>
75  .SH "NEWLINE CONVENTIONS"  .SH "NEWLINE CONVENTIONS"
76  .rs  .rs
77  .sp  .sp
# Line 83  string with one of the following five se Line 99  string with one of the following five se
99    (*ANYCRLF)   any of the three above    (*ANYCRLF)   any of the three above
100    (*ANY)       all Unicode newline sequences    (*ANY)       all Unicode newline sequences
101  .sp  .sp
102  These override the default and the options given to \fBpcre_compile()\fP. For  These override the default and the options given to \fBpcre_compile()\fP or
103  example, on a Unix system where LF is the default newline sequence, the pattern  \fBpcre_compile2()\fP. For example, on a Unix system where LF is the default
104    newline sequence, the pattern
105  .sp  .sp
106    (*CR)a.b    (*CR)a.b
107  .sp  .sp
# Line 94  Perl-compatible, are recognized only at Line 111  Perl-compatible, are recognized only at
111  they must be in upper case. If more than one of them is present, the last one  they must be in upper case. If more than one of them is present, the last one
112  is used.  is used.
113  .P  .P
114  The newline convention does not affect what the \eR escape sequence matches. By  The newline convention affects the interpretation of the dot metacharacter when
115  default, this is any Unicode newline sequence, for Perl compatibility. However,  PCRE_DOTALL is not set, and also the behaviour of \eN. However, it does not
116  this can be changed; see the description of \eR in the section entitled  affect what the \eR escape sequence matches. By default, this is any Unicode
117    newline sequence, for Perl compatibility. However, this can be changed; see the
118    description of \eR in the section entitled
119  .\" HTML <a href="#newlineseq">  .\" HTML <a href="#newlineseq">
120  .\" </a>  .\" </a>
121  "Newline sequences"  "Newline sequences"
# Line 168  The following sections describe the use Line 187  The following sections describe the use
187  .rs  .rs
188  .sp  .sp
189  The backslash character has several uses. Firstly, if it is followed by a  The backslash character has several uses. Firstly, if it is followed by a
190  non-alphanumeric character, it takes away any special meaning that character  character that is not a number or a letter, it takes away any special meaning
191  may have. This use of backslash as an escape character applies both inside and  that character may have. This use of backslash as an escape character applies
192  outside character classes.  both inside and outside character classes.
193  .P  .P
194  For example, if you want to match a * character, you write \e* in the pattern.  For example, if you want to match a * character, you write \e* in the pattern.
195  This escaping action applies whether or not the following character would  This escaping action applies whether or not the following character would
# Line 178  otherwise be interpreted as a metacharac Line 197  otherwise be interpreted as a metacharac
197  non-alphanumeric with backslash to specify that it stands for itself. In  non-alphanumeric with backslash to specify that it stands for itself. In
198  particular, if you want to match a backslash, you write \e\e.  particular, if you want to match a backslash, you write \e\e.
199  .P  .P
200    In UTF-8 mode, only ASCII numbers and letters have any special meaning after a
201    backslash. All other characters (in particular, those whose codepoints are
202    greater than 127) are treated as literals.
203    .P
204  If a pattern is compiled with the PCRE_EXTENDED option, whitespace in the  If a pattern is compiled with the PCRE_EXTENDED option, whitespace in the
205  pattern (other than in a character class) and characters between a # outside  pattern (other than in a character class) and characters between a # outside
206  a character class and the next newline are ignored. An escaping backslash can  a character class and the next newline are ignored. An escaping backslash can
# Line 197  Perl, $ and @ cause variable interpolati Line 220  Perl, $ and @ cause variable interpolati
220    \eQabc\eE\e$\eQxyz\eE   abc$xyz        abc$xyz    \eQabc\eE\e$\eQxyz\eE   abc$xyz        abc$xyz
221  .sp  .sp
222  The \eQ...\eE sequence is recognized both inside and outside character classes.  The \eQ...\eE sequence is recognized both inside and outside character classes.
223    An isolated \eE that is not preceded by \eQ is ignored.
224  .  .
225  .  .
226  .\" HTML <a name="digitsafterbackslash"></a>  .\" HTML <a name="digitsafterbackslash"></a>
# Line 206  The \eQ...\eE sequence is recognized bot Line 230  The \eQ...\eE sequence is recognized bot
230  A second use of backslash provides a way of encoding non-printing characters  A second use of backslash provides a way of encoding non-printing characters
231  in patterns in a visible manner. There is no restriction on the appearance of  in patterns in a visible manner. There is no restriction on the appearance of
232  non-printing characters, apart from the binary zero that terminates a pattern,  non-printing characters, apart from the binary zero that terminates a pattern,
233  but when a pattern is being prepared by text editing, it is usually easier to  but when a pattern is being prepared by text editing, it is often easier to use
234  use one of the following escape sequences than the binary character it  one of the following escape sequences than the binary character it represents:
 represents:  
235  .sp  .sp
236    \ea        alarm, that is, the BEL character (hex 07)    \ea        alarm, that is, the BEL character (hex 07)
237    \ecx       "control-x", where x is any character    \ecx       "control-x", where x is any ASCII character
238    \ee        escape (hex 1B)    \ee        escape (hex 1B)
239    \ef        formfeed (hex 0C)    \ef        formfeed (hex 0C)
240    \en        linefeed (hex 0A)    \en        linefeed (hex 0A)
241    \er        carriage return (hex 0D)    \er        carriage return (hex 0D)
242    \et        tab (hex 09)    \et        tab (hex 09)
243    \eddd      character with octal code ddd, or backreference    \eddd      character with octal code ddd, or back reference
244    \exhh      character with hex code hh    \exhh      character with hex code hh
245    \ex{hhh..} character with hex code hhh..    \ex{hhh..} character with hex code hhh..
246  .sp  .sp
247  The precise effect of \ecx is as follows: if x is a lower case letter, it  The precise effect of \ecx is as follows: if x is a lower case letter, it
248  is converted to upper case. Then bit 6 of the character (hex 40) is inverted.  is converted to upper case. Then bit 6 of the character (hex 40) is inverted.
249  Thus \ecz becomes hex 1A, but \ec{ becomes hex 3B, while \ec; becomes hex  Thus \ecz becomes hex 1A (z is 7A), but \ec{ becomes hex 3B ({ is 7B), while
250  7B.  \ec; becomes hex 7B (; is 3B). If the byte following \ec has a value greater
251    than 127, a compile-time error occurs. This locks out non-ASCII characters in
252    both byte mode and UTF-8 mode. (When PCRE is compiled in EBCDIC mode, all byte
253    values are valid. A lower case letter is converted to upper case, and then the
254    0xc0 bits are flipped.)
255  .P  .P
256  After \ex, from zero to two hexadecimal digits are read (letters can be in  After \ex, from zero to two hexadecimal digits are read (letters can be in
257  upper or lower case). Any number of hexadecimal digits may appear between \ex{  upper or lower case). Any number of hexadecimal digits may appear between \ex{
# Line 295  zero, because no more than three octal d Line 322  zero, because no more than three octal d
322  .P  .P
323  All the sequences that define a single character value can be used both inside  All the sequences that define a single character value can be used both inside
324  and outside character classes. In addition, inside a character class, the  and outside character classes. In addition, inside a character class, the
325  sequence \eb is interpreted as the backspace character (hex 08), and the  sequence \eb is interpreted as the backspace character (hex 08). The sequences
326  sequences \eR and \eX are interpreted as the characters "R" and "X",  \eB, \eN, \eR, and \eX are not special inside a character class. Like any other
327  respectively. Outside a character class, these sequences have different  unrecognized escape sequences, they are treated as the literal characters "B",
328  meanings  "N", "R", and "X" by default, but cause an error if the PCRE_EXTRA option is
329  .\" HTML <a href="#uniextseq">  set. Outside a character class, these sequences have different meanings.
 .\" </a>  
 (see below).  
 .\"  
330  .  .
331  .  .
332  .SS "Absolute and relative back references"  .SS "Absolute and relative back references"
# Line 333  syntax for referencing a subpattern as a Line 357  syntax for referencing a subpattern as a
357  later.  later.
358  .\"  .\"
359  Note that \eg{...} (Perl syntax) and \eg<...> (Oniguruma syntax) are \fInot\fP  Note that \eg{...} (Perl syntax) and \eg<...> (Oniguruma syntax) are \fInot\fP
360  synonymous. The former is a back reference; the latter is a subroutine call.  synonymous. The former is a back reference; the latter is a
361    .\" HTML <a href="#subpatternsassubroutines">
362    .\" </a>
363    subroutine
364    .\"
365    call.
366  .  .
367  .  .
368    .\" HTML <a name="genericchartypes"></a>
369  .SS "Generic character types"  .SS "Generic character types"
370  .rs  .rs
371  .sp  .sp
372  Another use of backslash is for specifying generic character types. The  Another use of backslash is for specifying generic character types:
 following are always recognized:  
373  .sp  .sp
374    \ed     any decimal digit    \ed     any decimal digit
375    \eD     any character that is not a decimal digit    \eD     any character that is not a decimal digit
# Line 353  following are always recognized: Line 382  following are always recognized:
382    \ew     any "word" character    \ew     any "word" character
383    \eW     any "non-word" character    \eW     any "non-word" character
384  .sp  .sp
385  Each pair of escape sequences partitions the complete set of characters into  There is also the single sequence \eN, which matches a non-newline character.
386  two disjoint sets. Any given character matches one, and only one, of each pair.  This is the same as
387    .\" HTML <a href="#fullstopdot">
388    .\" </a>
389    the "." metacharacter
390    .\"
391    when PCRE_DOTALL is not set.
392  .P  .P
393  These character type sequences can appear both inside and outside character  Each pair of lower and upper case escape sequences partitions the complete set
394    of characters into two disjoint sets. Any given character matches one, and only
395    one, of each pair. The sequences can appear both inside and outside character
396  classes. They each match one character of the appropriate type. If the current  classes. They each match one character of the appropriate type. If the current
397  matching point is at the end of the subject string, all of them fail, since  matching point is at the end of the subject string, all of them fail, because
398  there is no character to match.  there is no character to match.
399  .P  .P
400  For compatibility with Perl, \es does not match the VT character (code 11).  For compatibility with Perl, \es does not match the VT character (code 11).
# Line 367  are HT (9), LF (10), FF (12), CR (13), a Line 403  are HT (9), LF (10), FF (12), CR (13), a
403  included in a Perl script, \es may match the VT character. In PCRE, it never  included in a Perl script, \es may match the VT character. In PCRE, it never
404  does.  does.
405  .P  .P
406  In UTF-8 mode, characters with values greater than 128 never match \ed, \es, or  A "word" character is an underscore or any character that is a letter or digit.
407  \ew, and always match \eD, \eS, and \eW. This is true even when Unicode  By default, the definition of letters and digits is controlled by PCRE's
408  character property support is available. These sequences retain their original  low-valued character tables, and may vary if locale-specific matching is taking
409  meanings from before UTF-8 support was available, mainly for efficiency  place (see
410  reasons. Note that this also affects \eb, because it is defined in terms of \ew  .\" HTML <a href="pcreapi.html#localesupport">
411  and \eW.  .\" </a>
412  .P  "Locale support"
413  The sequences \eh, \eH, \ev, and \eV are Perl 5.10 features. In contrast to the  .\"
414  other sequences, these do match certain high-valued codepoints in UTF-8 mode.  in the
415  The horizontal space characters are:  .\" HREF
416    \fBpcreapi\fP
417    .\"
418    page). For example, in a French locale such as "fr_FR" in Unix-like systems,
419    or "french" in Windows, some character codes greater than 128 are used for
420    accented letters, and these are then matched by \ew. The use of locales with
421    Unicode is discouraged.
422    .P
423    By default, in UTF-8 mode, characters with values greater than 128 never match
424    \ed, \es, or \ew, and always match \eD, \eS, and \eW. These sequences retain
425    their original meanings from before UTF-8 support was available, mainly for
426    efficiency reasons. However, if PCRE is compiled with Unicode property support,
427    and the PCRE_UCP option is set, the behaviour is changed so that Unicode
428    properties are used to determine character types, as follows:
429    .sp
430      \ed  any character that \ep{Nd} matches (decimal digit)
431      \es  any character that \ep{Z} matches, plus HT, LF, FF, CR
432      \ew  any character that \ep{L} or \ep{N} matches, plus underscore
433    .sp
434    The upper case escapes match the inverse sets of characters. Note that \ed
435    matches only decimal digits, whereas \ew matches any Unicode digit, as well as
436    any Unicode letter, and underscore. Note also that PCRE_UCP affects \eb, and
437    \eB because they are defined in terms of \ew and \eW. Matching these sequences
438    is noticeably slower when PCRE_UCP is set.
439    .P
440    The sequences \eh, \eH, \ev, and \eV are features that were added to Perl at
441    release 5.10. In contrast to the other sequences, which match only ASCII
442    characters by default, these always match certain high-valued codepoints in
443    UTF-8 mode, whether or not PCRE_UCP is set. The horizontal space characters
444    are:
445  .sp  .sp
446    U+0009     Horizontal tab    U+0009     Horizontal tab
447    U+0020     Space    U+0020     Space
# Line 407  The vertical space characters are: Line 472  The vertical space characters are:
472    U+0085     Next line    U+0085     Next line
473    U+2028     Line separator    U+2028     Line separator
474    U+2029     Paragraph separator    U+2029     Paragraph separator
 .P  
 A "word" character is an underscore or any character less than 256 that is a  
 letter or digit. The definition of letters and digits is controlled by PCRE's  
 low-valued character tables, and may vary if locale-specific matching is taking  
 place (see  
 .\" HTML <a href="pcreapi.html#localesupport">  
 .\" </a>  
 "Locale support"  
 .\"  
 in the  
 .\" HREF  
 \fBpcreapi\fP  
 .\"  
 page). For example, in a French locale such as "fr_FR" in Unix-like systems,  
 or "french" in Windows, some character codes greater than 128 are used for  
 accented letters, and these are matched by \ew. The use of locales with Unicode  
 is discouraged.  
475  .  .
476  .  .
477  .\" HTML <a name="newlineseq"></a>  .\" HTML <a name="newlineseq"></a>
# Line 431  is discouraged. Line 479  is discouraged.
479  .rs  .rs
480  .sp  .sp
481  Outside a character class, by default, the escape sequence \eR matches any  Outside a character class, by default, the escape sequence \eR matches any
482  Unicode newline sequence. This is a Perl 5.10 feature. In non-UTF-8 mode \eR is  Unicode newline sequence. In non-UTF-8 mode \eR is equivalent to the following:
 equivalent to the following:  
483  .sp  .sp
484    (?>\er\en|\en|\ex0b|\ef|\er|\ex85)    (?>\er\en|\en|\ex0b|\ef|\er|\ex85)
485  .sp  .sp
# Line 463  one of the following sequences: Line 510  one of the following sequences:
510    (*BSR_ANYCRLF)   CR, LF, or CRLF only    (*BSR_ANYCRLF)   CR, LF, or CRLF only
511    (*BSR_UNICODE)   any Unicode newline sequence    (*BSR_UNICODE)   any Unicode newline sequence
512  .sp  .sp
513  These override the default and the options given to \fBpcre_compile()\fP, but  These override the default and the options given to \fBpcre_compile()\fP or
514  they can be overridden by options given to \fBpcre_exec()\fP. Note that these  \fBpcre_compile2()\fP, but they can be overridden by options given to
515  special settings, which are not Perl-compatible, are recognized only at the  \fBpcre_exec()\fP or \fBpcre_dfa_exec()\fP. Note that these special settings,
516  very start of a pattern, and that they must be in upper case. If more than one  which are not Perl-compatible, are recognized only at the very start of a
517  of them is present, the last one is used. They can be combined with a change of  pattern, and that they must be in upper case. If more than one of them is
518  newline convention, for example, a pattern can start with:  present, the last one is used. They can be combined with a change of newline
519    convention; for example, a pattern can start with:
520  .sp  .sp
521    (*ANY)(*BSR_ANYCRLF)    (*ANY)(*BSR_ANYCRLF)
522  .sp  .sp
523  Inside a character class, \eR matches the letter "R".  They can also be combined with the (*UTF8) or (*UCP) special sequences. Inside
524    a character class, \eR is treated as an unrecognized escape sequence, and so
525    matches the letter "R" by default, but causes an error if PCRE_EXTRA is set.
526  .  .
527  .  .
528  .\" HTML <a name="uniextseq"></a>  .\" HTML <a name="uniextseq"></a>
# Line 490  The extra escape sequences are: Line 540  The extra escape sequences are:
540    \eX       an extended Unicode sequence    \eX       an extended Unicode sequence
541  .sp  .sp
542  The property names represented by \fIxx\fP above are limited to the Unicode  The property names represented by \fIxx\fP above are limited to the Unicode
543  script names, the general category properties, and "Any", which matches any  script names, the general category properties, "Any", which matches any
544  character (including newline). Other properties such as "InMusicalSymbols" are  character (including newline), and some special PCRE properties (described
545  not currently supported by PCRE. Note that \eP{Any} does not match any  in the
546  characters, so always causes a match failure.  .\" HTML <a href="#extraprops">
547    .\" </a>
548    next section).
549    .\"
550    Other Perl properties such as "InMusicalSymbols" are not currently supported by
551    PCRE. Note that \eP{Any} does not match any characters, so always causes a
552    match failure.
553  .P  .P
554  Sets of Unicode characters are defined as belonging to certain scripts. A  Sets of Unicode characters are defined as belonging to certain scripts. A
555  character from one of these sets can be matched using a script name. For  character from one of these sets can be matched using a script name. For
# Line 507  Those that are not part of an identified Line 563  Those that are not part of an identified
563  .P  .P
564  Arabic,  Arabic,
565  Armenian,  Armenian,
566    Avestan,
567  Balinese,  Balinese,
568    Bamum,
569  Bengali,  Bengali,
570  Bopomofo,  Bopomofo,
571  Braille,  Braille,
572  Buginese,  Buginese,
573  Buhid,  Buhid,
574  Canadian_Aboriginal,  Canadian_Aboriginal,
575    Carian,
576    Cham,
577  Cherokee,  Cherokee,
578  Common,  Common,
579  Coptic,  Coptic,
# Line 522  Cypriot, Line 582  Cypriot,
582  Cyrillic,  Cyrillic,
583  Deseret,  Deseret,
584  Devanagari,  Devanagari,
585    Egyptian_Hieroglyphs,
586  Ethiopic,  Ethiopic,
587  Georgian,  Georgian,
588  Glagolitic,  Glagolitic,
# Line 534  Hangul, Line 595  Hangul,
595  Hanunoo,  Hanunoo,
596  Hebrew,  Hebrew,
597  Hiragana,  Hiragana,
598    Imperial_Aramaic,
599  Inherited,  Inherited,
600    Inscriptional_Pahlavi,
601    Inscriptional_Parthian,
602    Javanese,
603    Kaithi,
604  Kannada,  Kannada,
605  Katakana,  Katakana,
606    Kayah_Li,
607  Kharoshthi,  Kharoshthi,
608  Khmer,  Khmer,
609  Lao,  Lao,
610  Latin,  Latin,
611    Lepcha,
612  Limbu,  Limbu,
613  Linear_B,  Linear_B,
614    Lisu,
615    Lycian,
616    Lydian,
617  Malayalam,  Malayalam,
618    Meetei_Mayek,
619  Mongolian,  Mongolian,
620  Myanmar,  Myanmar,
621  New_Tai_Lue,  New_Tai_Lue,
# Line 551  Nko, Line 623  Nko,
623  Ogham,  Ogham,
624  Old_Italic,  Old_Italic,
625  Old_Persian,  Old_Persian,
626    Old_South_Arabian,
627    Old_Turkic,
628    Ol_Chiki,
629  Oriya,  Oriya,
630  Osmanya,  Osmanya,
631  Phags_Pa,  Phags_Pa,
632  Phoenician,  Phoenician,
633    Rejang,
634  Runic,  Runic,
635    Samaritan,
636    Saurashtra,
637  Shavian,  Shavian,
638  Sinhala,  Sinhala,
639    Sundanese,
640  Syloti_Nagri,  Syloti_Nagri,
641  Syriac,  Syriac,
642  Tagalog,  Tagalog,
643  Tagbanwa,  Tagbanwa,
644  Tai_Le,  Tai_Le,
645    Tai_Tham,
646    Tai_Viet,
647  Tamil,  Tamil,
648  Telugu,  Telugu,
649  Thaana,  Thaana,
# Line 570  Thai, Line 651  Thai,
651  Tibetan,  Tibetan,
652  Tifinagh,  Tifinagh,
653  Ugaritic,  Ugaritic,
654    Vai,
655  Yi.  Yi.
656  .P  .P
657  Each character has exactly one general category property, specified by a  Each character has exactly one Unicode general category property, specified by
658  two-letter abbreviation. For compatibility with Perl, negation can be specified  a two-letter abbreviation. For compatibility with Perl, negation can be
659  by including a circumflex between the opening brace and the property name. For  specified by including a circumflex between the opening brace and the property
660  example, \ep{^Lu} is the same as \eP{Lu}.  name. For example, \ep{^Lu} is the same as \eP{Lu}.
661  .P  .P
662  If only one letter is specified with \ep or \eP, it includes all the general  If only one letter is specified with \ep or \eP, it includes all the general
663  category properties that start with that letter. In this case, in the absence  category properties that start with that letter. In this case, in the absence
# Line 642  cannot be tested by PCRE, unless UTF-8 v Line 724  cannot be tested by PCRE, unless UTF-8 v
724  .\" HREF  .\" HREF
725  \fBpcreapi\fP  \fBpcreapi\fP
726  .\"  .\"
727  page).  page). Perl does not support the Cs property.
728  .P  .P
729  The long synonyms for these properties that Perl supports (such as \ep{Letter})  The long synonyms for property names that Perl supports (such as \ep{Letter})
730  are not supported by PCRE, nor is it permitted to prefix any of these  are not supported by PCRE, nor is it permitted to prefix any of these
731  properties with "Is".  properties with "Is".
732  .P  .P
# Line 674  non-UTF-8 mode \eX matches any one chara Line 756  non-UTF-8 mode \eX matches any one chara
756  Matching characters by Unicode property is not fast, because PCRE has to search  Matching characters by Unicode property is not fast, because PCRE has to search
757  a structure that contains data for over fifteen thousand characters. That is  a structure that contains data for over fifteen thousand characters. That is
758  why the traditional escape sequences such as \ed and \ew do not use Unicode  why the traditional escape sequences such as \ed and \ew do not use Unicode
759  properties in PCRE.  properties in PCRE by default, though you can make them do so by setting the
760    PCRE_UCP option for \fBpcre_compile()\fP or by starting the pattern with
761    (*UCP).
762    .
763    .
764    .\" HTML <a name="extraprops"></a>
765    .SS PCRE's additional properties
766    .rs
767    .sp
768    As well as the standard Unicode properties described in the previous
769    section, PCRE supports four more that make it possible to convert traditional
770    escape sequences such as \ew and \es and POSIX character classes to use Unicode
771    properties. PCRE uses these non-standard, non-Perl properties internally when
772    PCRE_UCP is set. They are:
773    .sp
774      Xan   Any alphanumeric character
775      Xps   Any POSIX space character
776      Xsp   Any Perl space character
777      Xwd   Any Perl "word" character
778    .sp
779    Xan matches characters that have either the L (letter) or the N (number)
780    property. Xps matches the characters tab, linefeed, vertical tab, formfeed, or
781    carriage return, and any other character that has the Z (separator) property.
782    Xsp is the same as Xps, except that vertical tab is excluded. Xwd matches the
783    same characters as Xan, plus underscore.
784  .  .
785  .  .
786  .\" HTML <a name="resetmatchstart"></a>  .\" HTML <a name="resetmatchstart"></a>
787  .SS "Resetting the match start"  .SS "Resetting the match start"
788  .rs  .rs
789  .sp  .sp
790  The escape sequence \eK, which is a Perl 5.10 feature, causes any previously  The escape sequence \eK causes any previously matched characters not to be
791  matched characters not to be included in the final matched sequence. For  included in the final matched sequence. For example, the pattern:
 example, the pattern:  
792  .sp  .sp
793    foo\eKbar    foo\eKbar
794  .sp  .sp
# Line 705  For example, when the pattern Line 810  For example, when the pattern
810    (foo)\eKbar    (foo)\eKbar
811  .sp  .sp
812  matches "foobar", the first substring is still set to "foo".  matches "foobar", the first substring is still set to "foo".
813    .P
814    Perl documents that the use of \eK within assertions is "not well defined". In
815    PCRE, \eK is acted upon when it occurs inside positive assertions, but is
816    ignored in negative assertions.
817  .  .
818  .  .
819  .\" HTML <a name="smallassertions"></a>  .\" HTML <a name="smallassertions"></a>
# Line 729  The backslashed assertions are: Line 838  The backslashed assertions are:
838    \ez     matches only at the end of the subject    \ez     matches only at the end of the subject
839    \eG     matches at the first matching position in the subject    \eG     matches at the first matching position in the subject
840  .sp  .sp
841  These assertions may not appear in character classes (but note that \eb has a  Inside a character class, \eb has a different meaning; it matches the backspace
842  different meaning, namely the backspace character, inside a character class).  character. If any other of these assertions appears in a character class, by
843    default it matches the corresponding literal character (for example, \eB
844    matches the letter B). However, if the PCRE_EXTRA option is set, an "invalid
845    escape sequence" error is generated instead.
846  .P  .P
847  A word boundary is a position in the subject string where the current character  A word boundary is a position in the subject string where the current character
848  and the previous character do not both match \ew or \eW (i.e. one matches  and the previous character do not both match \ew or \eW (i.e. one matches
849  \ew and the other matches \eW), or the start or end of the string if the  \ew and the other matches \eW), or the start or end of the string if the
850  first or last character matches \ew, respectively.  first or last character matches \ew, respectively. In UTF-8 mode, the meanings
851    of \ew and \eW can be changed by setting the PCRE_UCP option. When this is
852    done, it also affects \eb and \eB. Neither PCRE nor Perl has a separate "start
853    of word" or "end of word" metasequence. However, whatever follows \eb normally
854    determines which it is. For example, the fragment \eba matches "a" at the start
855    of a word.
856  .P  .P
857  The \eA, \eZ, and \ez assertions differ from the traditional circumflex and  The \eA, \eZ, and \ez assertions differ from the traditional circumflex and
858  dollar (described in the next section) in that they only ever match at the very  dollar (described in the next section) in that they only ever match at the very
# Line 819  end of the subject in both modes, and if Line 936  end of the subject in both modes, and if
936  \eA it is always anchored, whether or not PCRE_MULTILINE is set.  \eA it is always anchored, whether or not PCRE_MULTILINE is set.
937  .  .
938  .  .
939  .SH "FULL STOP (PERIOD, DOT)"  .\" HTML <a name="fullstopdot"></a>
940    .SH "FULL STOP (PERIOD, DOT) AND \eN"
941  .rs  .rs
942  .sp  .sp
943  Outside a character class, a dot in the pattern matches any one character in  Outside a character class, a dot in the pattern matches any one character in
# Line 841  to match it. Line 959  to match it.
959  The handling of dot is entirely independent of the handling of circumflex and  The handling of dot is entirely independent of the handling of circumflex and
960  dollar, the only relationship being that they both involve newlines. Dot has no  dollar, the only relationship being that they both involve newlines. Dot has no
961  special meaning in a character class.  special meaning in a character class.
962    .P
963    The escape sequence \eN behaves like a dot, except that it is not affected by
964    the PCRE_DOTALL option. In other words, it matches any character except one
965    that signifies the end of a line.
966  .  .
967  .  .
968  .SH "MATCHING A SINGLE BYTE"  .SH "MATCHING A SINGLE BYTE"
# Line 849  special meaning in a character class. Line 971  special meaning in a character class.
971  Outside a character class, the escape sequence \eC matches any one byte, both  Outside a character class, the escape sequence \eC matches any one byte, both
972  in and out of UTF-8 mode. Unlike a dot, it always matches any line-ending  in and out of UTF-8 mode. Unlike a dot, it always matches any line-ending
973  characters. The feature is provided in Perl in order to match individual bytes  characters. The feature is provided in Perl in order to match individual bytes
974  in UTF-8 mode. Because it breaks up UTF-8 characters into individual bytes,  in UTF-8 mode. Because it breaks up UTF-8 characters into individual bytes, the
975  what remains in the string may be a malformed UTF-8 string. For this reason,  rest of the string may start with a malformed UTF-8 character. For this reason,
976  the \eC escape sequence is best avoided.  the \eC escape sequence is best avoided.
977  .P  .P
978  PCRE does not allow \eC to appear in lookbehind assertions  PCRE does not allow \eC to appear in lookbehind assertions
# Line 867  the lookbehind. Line 989  the lookbehind.
989  .rs  .rs
990  .sp  .sp
991  An opening square bracket introduces a character class, terminated by a closing  An opening square bracket introduces a character class, terminated by a closing
992  square bracket. A closing square bracket on its own is not special. If a  square bracket. A closing square bracket on its own is not special by default.
993  closing square bracket is required as a member of the class, it should be the  However, if the PCRE_JAVASCRIPT_COMPAT option is set, a lone closing square
994  first data character in the class (after an initial circumflex, if present) or  bracket causes a compile-time error. If a closing square bracket is required as
995  escaped with a backslash.  a member of the class, it should be the first data character in the class
996    (after an initial circumflex, if present) or escaped with a backslash.
997  .P  .P
998  A character class matches a single character in the subject. In UTF-8 mode, the  A character class matches a single character in the subject. In UTF-8 mode, the
999  character may occupy more than one byte. A matched character must be in the set  character may be more than one byte long. A matched character must be in the
1000  of characters defined by the class, unless the first character in the class  set of characters defined by the class, unless the first character in the class
1001  definition is a circumflex, in which case the subject character must not be in  definition is a circumflex, in which case the subject character must not be in
1002  the set defined by the class. If a circumflex is actually required as a member  the set defined by the class. If a circumflex is actually required as a member
1003  of the class, ensure it is not the first character, or escape it with a  of the class, ensure it is not the first character, or escape it with a
# Line 884  For example, the character class [aeiou] Line 1007  For example, the character class [aeiou]
1007  [^aeiou] matches any character that is not a lower case vowel. Note that a  [^aeiou] matches any character that is not a lower case vowel. Note that a
1008  circumflex is just a convenient notation for specifying the characters that  circumflex is just a convenient notation for specifying the characters that
1009  are in the class by enumerating those that are not. A class that starts with a  are in the class by enumerating those that are not. A class that starts with a
1010  circumflex is not an assertion: it still consumes a character from the subject  circumflex is not an assertion; it still consumes a character from the subject
1011  string, and therefore it fails if the current pointer is at the end of the  string, and therefore it fails if the current pointer is at the end of the
1012  string.  string.
1013  .P  .P
# Line 898  caseful version would. In UTF-8 mode, PC Line 1021  caseful version would. In UTF-8 mode, PC
1021  case for characters whose values are less than 128, so caseless matching is  case for characters whose values are less than 128, so caseless matching is
1022  always possible. For characters with higher values, the concept of case is  always possible. For characters with higher values, the concept of case is
1023  supported if PCRE is compiled with Unicode property support, but not otherwise.  supported if PCRE is compiled with Unicode property support, but not otherwise.
1024  If you want to use caseless matching for characters 128 and above, you must  If you want to use caseless matching in UTF8-mode for characters 128 and above,
1025  ensure that PCRE is compiled with Unicode property support as well as with  you must ensure that PCRE is compiled with Unicode property support as well as
1026  UTF-8 support.  with UTF-8 support.
1027  .P  .P
1028  Characters that might indicate line breaks are never treated in any special way  Characters that might indicate line breaks are never treated in any special way
1029  when matching character classes, whatever line-ending sequence is in use, and  when matching character classes, whatever line-ending sequence is in use, and
# Line 934  characters in both cases. In UTF-8 mode, Line 1057  characters in both cases. In UTF-8 mode,
1057  characters with values greater than 128 only when it is compiled with Unicode  characters with values greater than 128 only when it is compiled with Unicode
1058  property support.  property support.
1059  .P  .P
1060  The character types \ed, \eD, \ep, \eP, \es, \eS, \ew, and \eW may also appear  The character escape sequences \ed, \eD, \eh, \eH, \ep, \eP, \es, \eS, \ev,
1061  in a character class, and add the characters that they match to the class. For  \eV, \ew, and \eW may appear in a character class, and add the characters that
1062  example, [\edABCDEF] matches any hexadecimal digit. A circumflex can  they match to the class. For example, [\edABCDEF] matches any hexadecimal
1063  conveniently be used with the upper case character types to specify a more  digit. In UTF-8 mode, the PCRE_UCP option affects the meanings of \ed, \es, \ew
1064  restricted set of characters than the matching lower case type. For example,  and their upper case partners, just as it does when they appear outside a
1065  the class [^\eW_] matches any letter or digit, but not underscore.  character class, as described in the section entitled
1066    .\" HTML <a href="#genericchartypes">
1067    .\" </a>
1068    "Generic character types"
1069    .\"
1070    above. The escape sequence \eb has a different meaning inside a character
1071    class; it matches the backspace character. The sequences \eB, \eN, \eR, and \eX
1072    are not special inside a character class. Like any other unrecognized escape
1073    sequences, they are treated as the literal characters "B", "N", "R", and "X" by
1074    default, but cause an error if the PCRE_EXTRA option is set.
1075    .P
1076    A circumflex can conveniently be used with the upper case character types to
1077    specify a more restricted set of characters than the matching lower case type.
1078    For example, the class [^\eW_] matches any letter or digit, but not underscore,
1079    whereas [\ew] includes underscore. A positive character class should be read as
1080    "something OR something OR ..." and a negative class as "NOT something AND NOT
1081    something AND NOT ...".
1082  .P  .P
1083  The only metacharacters that are recognized in character classes are backslash,  The only metacharacters that are recognized in character classes are backslash,
1084  hyphen (only where it can be interpreted as specifying a range), circumflex  hyphen (only where it can be interpreted as specifying a range), circumflex
# Line 959  this notation. For example, Line 1098  this notation. For example,
1098    [01[:alpha:]%]    [01[:alpha:]%]
1099  .sp  .sp
1100  matches "0", "1", any alphabetic character, or "%". The supported class names  matches "0", "1", any alphabetic character, or "%". The supported class names
1101  are  are:
1102  .sp  .sp
1103    alnum    letters and digits    alnum    letters and digits
1104    alpha    letters    alpha    letters
# Line 970  are Line 1109  are
1109    graph    printing characters, excluding space    graph    printing characters, excluding space
1110    lower    lower case letters    lower    lower case letters
1111    print    printing characters, including space    print    printing characters, including space
1112    punct    printing characters, excluding letters and digits    punct    printing characters, excluding letters and digits and space
1113    space    white space (not quite the same as \es)    space    white space (not quite the same as \es)
1114    upper    upper case letters    upper    upper case letters
1115    word     "word" characters (same as \ew)    word     "word" characters (same as \ew)
# Line 991  matches "1", "2", or any non-digit. PCRE Line 1130  matches "1", "2", or any non-digit. PCRE
1130  syntax [.ch.] and [=ch=] where "ch" is a "collating element", but these are not  syntax [.ch.] and [=ch=] where "ch" is a "collating element", but these are not
1131  supported, and an error is given if they are encountered.  supported, and an error is given if they are encountered.
1132  .P  .P
1133  In UTF-8 mode, characters with values greater than 128 do not match any of  By default, in UTF-8 mode, characters with values greater than 128 do not match
1134  the POSIX character classes.  any of the POSIX character classes. However, if the PCRE_UCP option is passed
1135    to \fBpcre_compile()\fP, some of the classes are changed so that Unicode
1136    character properties are used. This is achieved by replacing the POSIX classes
1137    by other sequences, as follows:
1138    .sp
1139      [:alnum:]  becomes  \ep{Xan}
1140      [:alpha:]  becomes  \ep{L}
1141      [:blank:]  becomes  \eh
1142      [:digit:]  becomes  \ep{Nd}
1143      [:lower:]  becomes  \ep{Ll}
1144      [:space:]  becomes  \ep{Xps}
1145      [:upper:]  becomes  \ep{Lu}
1146      [:word:]   becomes  \ep{Xwd}
1147    .sp
1148    Negated versions, such as [:^alpha:] use \eP instead of \ep. The other POSIX
1149    classes are unchanged, and match only characters with code points less than
1150    128.
1151  .  .
1152  .  .
1153  .SH "VERTICAL BAR"  .SH "VERTICAL BAR"
# Line 1046  extracts it into the global options (and Line 1201  extracts it into the global options (and
1201  extracted by the \fBpcre_fullinfo()\fP function).  extracted by the \fBpcre_fullinfo()\fP function).
1202  .P  .P
1203  An option change within a subpattern (see below for a description of  An option change within a subpattern (see below for a description of
1204  subpatterns) affects only that part of the current pattern that follows it, so  subpatterns) affects only that part of the subpattern that follows it, so
1205  .sp  .sp
1206    (a(?i)b)c    (a(?i)b)c
1207  .sp  .sp
# Line 1071  section entitled Line 1226  section entitled
1226  .\" </a>  .\" </a>
1227  "Newline sequences"  "Newline sequences"
1228  .\"  .\"
1229  above. There is also the (*UTF8) leading sequence that can be used to set UTF-8  above. There are also the (*UTF8) and (*UCP) leading sequences that can be used
1230  mode; this is equivalent to setting the PCRE_UTF8 option.  to set UTF-8 and Unicode property modes; they are equivalent to setting the
1231    PCRE_UTF8 and the PCRE_UCP options, respectively.
1232  .  .
1233  .  .
1234  .\" HTML <a name="subpattern"></a>  .\" HTML <a name="subpattern"></a>
# Line 1086  Turning part of a pattern into a subpatt Line 1242  Turning part of a pattern into a subpatt
1242  .sp  .sp
1243    cat(aract|erpillar|)    cat(aract|erpillar|)
1244  .sp  .sp
1245  matches one of the words "cat", "cataract", or "caterpillar". Without the  matches "cataract", "caterpillar", or "cat". Without the parentheses, it would
1246  parentheses, it would match "cataract", "erpillar" or an empty string.  match "cataract", "erpillar" or an empty string.
1247  .sp  .sp
1248  2. It sets up the subpattern as a capturing subpattern. This means that, when  2. It sets up the subpattern as a capturing subpattern. This means that, when
1249  the whole pattern matches, that portion of the subject string that matched the  the whole pattern matches, that portion of the subject string that matched the
1250  subpattern is passed back to the caller via the \fIovector\fP argument of  subpattern is passed back to the caller via the \fIovector\fP argument of
1251  \fBpcre_exec()\fP. Opening parentheses are counted from left to right (starting  \fBpcre_exec()\fP. Opening parentheses are counted from left to right (starting
1252  from 1) to obtain numbers for the capturing subpatterns.  from 1) to obtain numbers for the capturing subpatterns. For example, if the
1253  .P  string "the red king" is matched against the pattern
 For example, if the string "the red king" is matched against the pattern  
1254  .sp  .sp
1255    the ((red|white) (king|queen))    the ((red|white) (king|queen))
1256  .sp  .sp
# Line 1127  is reached, an option setting in one bra Line 1282  is reached, an option setting in one bra
1282  the above patterns match "SUNDAY" as well as "Saturday".  the above patterns match "SUNDAY" as well as "Saturday".
1283  .  .
1284  .  .
1285    .\" HTML <a name="dupsubpatternnumber"></a>
1286  .SH "DUPLICATE SUBPATTERN NUMBERS"  .SH "DUPLICATE SUBPATTERN NUMBERS"
1287  .rs  .rs
1288  .sp  .sp
# Line 1143  at captured substring number one, whiche Line 1299  at captured substring number one, whiche
1299  is useful when you want to capture part, but not all, of one of a number of  is useful when you want to capture part, but not all, of one of a number of
1300  alternatives. Inside a (?| group, parentheses are numbered as usual, but the  alternatives. Inside a (?| group, parentheses are numbered as usual, but the
1301  number is reset at the start of each branch. The numbers of any capturing  number is reset at the start of each branch. The numbers of any capturing
1302  buffers that follow the subpattern start after the highest number used in any  parentheses that follow the subpattern start after the highest number used in
1303  branch. The following example is taken from the Perl documentation.  any branch. The following example is taken from the Perl documentation. The
1304  The numbers underneath show in which buffer the captured content will be  numbers underneath show in which buffer the captured content will be stored.
 stored.  
1305  .sp  .sp
1306    # before  ---------------branch-reset----------- after    # before  ---------------branch-reset----------- after
1307    / ( a )  (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x    / ( a )  (?| x ( y ) z | (p (q) r) | (t) u (v) ) ( z ) /x
1308    # 1            2         2  3        2     3     4    # 1            2         2  3        2     3     4
1309  .sp  .sp
1310  A backreference or a recursive call to a numbered subpattern always refers to  A back reference to a numbered subpattern uses the most recent value that is
1311  the first one in the pattern with the given number.  set for that number by any subpattern. The following pattern matches "abcabc"
1312    or "defdef":
1313    .sp
1314      /(?|(abc)|(def))\e1/
1315    .sp
1316    In contrast, a recursive or "subroutine" call to a numbered subpattern always
1317    refers to the first one in the pattern with the given number. The following
1318    pattern matches "abcabc" or "defabc":
1319    .sp
1320      /(?|(abc)|(def))(?1)/
1321    .sp
1322    If a
1323    .\" HTML <a href="#conditions">
1324    .\" </a>
1325    condition test
1326    .\"
1327    for a subpattern's having matched refers to a non-unique number, the test is
1328    true if any of the subpatterns of that number have matched.
1329  .P  .P
1330  An alternative approach to using this "branch reset" feature is to use  An alternative approach to using this "branch reset" feature is to use
1331  duplicate named subpatterns, as described in the next section.  duplicate named subpatterns, as described in the next section.
# Line 1168  if an expression is modified, the number Line 1340  if an expression is modified, the number
1340  difficulty, PCRE supports the naming of subpatterns. This feature was not  difficulty, PCRE supports the naming of subpatterns. This feature was not
1341  added to Perl until release 5.10. Python had the feature earlier, and PCRE  added to Perl until release 5.10. Python had the feature earlier, and PCRE
1342  introduced it at release 4.0, using the Python syntax. PCRE now supports both  introduced it at release 4.0, using the Python syntax. PCRE now supports both
1343  the Perl and the Python syntax.  the Perl and the Python syntax. Perl allows identically numbered subpatterns to
1344    have different names, but PCRE does not.
1345  .P  .P
1346  In PCRE, a subpattern can be named in one of three ways: (?<name>...) or  In PCRE, a subpattern can be named in one of three ways: (?<name>...) or
1347  (?'name'...) as in Perl, or (?P<name>...) as in Python. References to capturing  (?'name'...) as in Perl, or (?P<name>...) as in Python. References to capturing
1348  parentheses from other parts of the pattern, such as  parentheses from other parts of the pattern, such as
1349  .\" HTML <a href="#backreferences">  .\" HTML <a href="#backreferences">
1350  .\" </a>  .\" </a>
1351  backreferences,  back references,
1352  .\"  .\"
1353  .\" HTML <a href="#recursion">  .\" HTML <a href="#recursion">
1354  .\" </a>  .\" </a>
# Line 1195  extracting the name-to-number translatio Line 1368  extracting the name-to-number translatio
1368  is also a convenience function for extracting a captured substring by name.  is also a convenience function for extracting a captured substring by name.
1369  .P  .P
1370  By default, a name must be unique within a pattern, but it is possible to relax  By default, a name must be unique within a pattern, but it is possible to relax
1371  this constraint by setting the PCRE_DUPNAMES option at compile time. This can  this constraint by setting the PCRE_DUPNAMES option at compile time. (Duplicate
1372  be useful for patterns where only one instance of the named parentheses can  names are also always permitted for subpatterns with the same number, set up as
1373  match. Suppose you want to match the name of a weekday, either as a 3-letter  described in the previous section.) Duplicate names can be useful for patterns
1374  abbreviation or as the full name, and in both cases you want to extract the  where only one instance of the named parentheses can match. Suppose you want to
1375  abbreviation. This pattern (ignoring the line breaks) does the job:  match the name of a weekday, either as a 3-letter abbreviation or as the full
1376    name, and in both cases you want to extract the abbreviation. This pattern
1377    (ignoring the line breaks) does the job:
1378  .sp  .sp
1379    (?<DN>Mon|Fri|Sun)(?:day)?|    (?<DN>Mon|Fri|Sun)(?:day)?|
1380    (?<DN>Tue)(?:sday)?|    (?<DN>Tue)(?:sday)?|
# Line 1213  subpattern, as described in the previous Line 1388  subpattern, as described in the previous
1388  .P  .P
1389  The convenience function for extracting the data by name returns the substring  The convenience function for extracting the data by name returns the substring
1390  for the first (and in this example, the only) subpattern of that name that  for the first (and in this example, the only) subpattern of that name that
1391  matched. This saves searching to find which numbered subpattern it was. If you  matched. This saves searching to find which numbered subpattern it was.
1392  make a reference to a non-unique named subpattern from elsewhere in the  .P
1393  pattern, the one that corresponds to the lowest number is used. For further  If you make a back reference to a non-unique named subpattern from elsewhere in
1394  details of the interfaces for handling named subpatterns, see the  the pattern, the one that corresponds to the first occurrence of the name is
1395    used. In the absence of duplicate numbers (see the previous section) this is
1396    the one with the lowest number. If you use a named reference in a condition
1397    test (see the
1398    .\"
1399    .\" HTML <a href="#conditions">
1400    .\" </a>
1401    section about conditions
1402    .\"
1403    below), either to check whether a subpattern has matched, or to check for
1404    recursion, all subpatterns with the same name are tested. If the condition is
1405    true for any one of them, the overall condition is true. This is the same
1406    behaviour as testing by number. For further details of the interfaces for
1407    handling named subpatterns, see the
1408  .\" HREF  .\" HREF
1409  \fBpcreapi\fP  \fBpcreapi\fP
1410  .\"  .\"
1411  documentation.  documentation.
1412  .P  .P
1413  \fBWarning:\fP You cannot use different names to distinguish between two  \fBWarning:\fP You cannot use different names to distinguish between two
1414  subpatterns with the same number (see the previous section) because PCRE uses  subpatterns with the same number because PCRE uses only the numbers when
1415  only the numbers when matching.  matching. For this reason, an error is given at compile time if different names
1416    are given to subpatterns with the same number. However, you can give the same
1417    name to subpatterns with the same number, even when PCRE_DUPNAMES is not set.
1418  .  .
1419  .  .
1420  .SH REPETITION  .SH REPETITION
# Line 1238  items: Line 1428  items:
1428    the \eC escape sequence    the \eC escape sequence
1429    the \eX escape sequence (in UTF-8 mode with Unicode properties)    the \eX escape sequence (in UTF-8 mode with Unicode properties)
1430    the \eR escape sequence    the \eR escape sequence
1431    an escape such as \ed that matches a single character    an escape such as \ed or \epL that matches a single character
1432    a character class    a character class
1433    a back reference (see next section)    a back reference (see next section)
1434    a parenthesized subpattern (unless it is an assertion)    a parenthesized subpattern (unless it is an assertion)
1435      a recursive or "subroutine" call to a subpattern
1436  .sp  .sp
1437  The general repetition quantifier specifies a minimum and maximum number of  The general repetition quantifier specifies a minimum and maximum number of
1438  permitted matches, by giving the two numbers in curly brackets (braces),  permitted matches, by giving the two numbers in curly brackets (braces),
# Line 1279  subpatterns that are referenced as Line 1470  subpatterns that are referenced as
1470  .\" </a>  .\" </a>
1471  subroutines  subroutines
1472  .\"  .\"
1473  from elsewhere in the pattern. Items other than subpatterns that have a {0}  from elsewhere in the pattern (but see also the section entitled
1474  quantifier are omitted from the compiled pattern.  .\" HTML <a href="#subdefine">
1475    .\" </a>
1476    "Defining subpatterns for use by reference only"
1477    .\"
1478    below). Items other than subpatterns that have a {0} quantifier are omitted
1479    from the compiled pattern.
1480  .P  .P
1481  For convenience, the three most common quantifiers have single-character  For convenience, the three most common quantifiers have single-character
1482  abbreviations:  abbreviations:
# Line 1352  worth setting PCRE_DOTALL in order to ob Line 1548  worth setting PCRE_DOTALL in order to ob
1548  alternatively using ^ to indicate anchoring explicitly.  alternatively using ^ to indicate anchoring explicitly.
1549  .P  .P
1550  However, there is one situation where the optimization cannot be used. When .*  However, there is one situation where the optimization cannot be used. When .*
1551  is inside capturing parentheses that are the subject of a backreference  is inside capturing parentheses that are the subject of a back reference
1552  elsewhere in the pattern, a match at the start may fail where a later one  elsewhere in the pattern, a match at the start may fail where a later one
1553  succeeds. Consider, for example:  succeeds. Consider, for example:
1554  .sp  .sp
# Line 1505  no such problem when named parentheses a Line 1701  no such problem when named parentheses a
1701  subpattern is possible using named parentheses (see below).  subpattern is possible using named parentheses (see below).
1702  .P  .P
1703  Another way of avoiding the ambiguity inherent in the use of digits following a  Another way of avoiding the ambiguity inherent in the use of digits following a
1704  backslash is to use the \eg escape sequence, which is a feature introduced in  backslash is to use the \eg escape sequence. This escape must be followed by an
1705  Perl 5.10. This escape must be followed by an unsigned number or a negative  unsigned number or a negative number, optionally enclosed in braces. These
1706  number, optionally enclosed in braces. These examples are all identical:  examples are all identical:
1707  .sp  .sp
1708    (ring), \e1    (ring), \e1
1709    (ring), \eg1    (ring), \eg1
# Line 1521  example: Line 1717  example:
1717    (abc(def)ghi)\eg{-1}    (abc(def)ghi)\eg{-1}
1718  .sp  .sp
1719  The sequence \eg{-1} is a reference to the most recently started capturing  The sequence \eg{-1} is a reference to the most recently started capturing
1720  subpattern before \eg, that is, is it equivalent to \e2. Similarly, \eg{-2}  subpattern before \eg, that is, is it equivalent to \e2 in this example.
1721  would be equivalent to \e1. The use of relative references can be helpful in  Similarly, \eg{-2} would be equivalent to \e1. The use of relative references
1722  long patterns, and also in patterns that are created by joining together  can be helpful in long patterns, and also in patterns that are created by
1723  fragments that contain references within themselves.  joining together fragments that contain references within themselves.
1724  .P  .P
1725  A back reference matches whatever actually matched the capturing subpattern in  A back reference matches whatever actually matched the capturing subpattern in
1726  the current subject string, rather than anything matching the subpattern  the current subject string, rather than anything matching the subpattern
# Line 1563  after the reference. Line 1759  after the reference.
1759  .P  .P
1760  There may be more than one back reference to the same subpattern. If a  There may be more than one back reference to the same subpattern. If a
1761  subpattern has not actually been used in a particular match, any back  subpattern has not actually been used in a particular match, any back
1762  references to it always fail. For example, the pattern  references to it always fail by default. For example, the pattern
1763  .sp  .sp
1764    (a|(bc))\e2    (a|(bc))\e2
1765  .sp  .sp
1766  always fails if it starts to match "a" rather than "bc". Because there may be  always fails if it starts to match "a" rather than "bc". However, if the
1767  many capturing parentheses in a pattern, all digits following the backslash are  PCRE_JAVASCRIPT_COMPAT option is set at compile time, a back reference to an
1768  taken as part of a potential back reference number. If the pattern continues  unset value matches an empty string.
1769  with a digit character, some delimiter must be used to terminate the back  .P
1770  reference. If the PCRE_EXTENDED option is set, this can be whitespace.  Because there may be many capturing parentheses in a pattern, all digits
1771  Otherwise an empty comment (see  following a backslash are taken as part of a potential back reference number.
1772    If the pattern continues with a digit character, some delimiter must be used to
1773    terminate the back reference. If the PCRE_EXTENDED option is set, this can be
1774    whitespace. Otherwise, the \eg{ syntax or an empty comment (see
1775  .\" HTML <a href="#comments">  .\" HTML <a href="#comments">
1776  .\" </a>  .\" </a>
1777  "Comments"  "Comments"
1778  .\"  .\"
1779  below) can be used.  below) can be used.
1780  .P  .
1781    .SS "Recursive back references"
1782    .rs
1783    .sp
1784  A back reference that occurs inside the parentheses to which it refers fails  A back reference that occurs inside the parentheses to which it refers fails
1785  when the subpattern is first used, so, for example, (a\e1) never matches.  when the subpattern is first used, so, for example, (a\e1) never matches.
1786  However, such references can be useful inside repeated subpatterns. For  However, such references can be useful inside repeated subpatterns. For
# Line 1592  to the previous iteration. In order for Line 1794  to the previous iteration. In order for
1794  that the first iteration does not need to match the back reference. This can be  that the first iteration does not need to match the back reference. This can be
1795  done using alternation, as in the example above, or by a quantifier with a  done using alternation, as in the example above, or by a quantifier with a
1796  minimum of zero.  minimum of zero.
1797    .P
1798    Back references of this type cause the group that they reference to be treated
1799    as an
1800    .\" HTML <a href="#atomicgroup">
1801    .\" </a>
1802    atomic group.
1803    .\"
1804    Once the whole group has been matched, a subsequent matching failure cannot
1805    cause backtracking into the middle of the group.
1806  .  .
1807  .  .
1808  .\" HTML <a name="bigassertions"></a>  .\" HTML <a name="bigassertions"></a>
# Line 1645  lookbehind assertion is needed to achiev Line 1856  lookbehind assertion is needed to achiev
1856  If you want to force a matching failure at some point in a pattern, the most  If you want to force a matching failure at some point in a pattern, the most
1857  convenient way to do it is with (?!) because an empty string always matches, so  convenient way to do it is with (?!) because an empty string always matches, so
1858  an assertion that requires there not to be an empty string must always fail.  an assertion that requires there not to be an empty string must always fail.
1859    The backtracking control verb (*FAIL) or (*F) is a synonym for (?!).
1860  .  .
1861  .  .
1862  .\" HTML <a name="lookbehind"></a>  .\" HTML <a name="lookbehind"></a>
# Line 1669  is permitted, but Line 1881  is permitted, but
1881  .sp  .sp
1882  causes an error at compile time. Branches that match different length strings  causes an error at compile time. Branches that match different length strings
1883  are permitted only at the top level of a lookbehind assertion. This is an  are permitted only at the top level of a lookbehind assertion. This is an
1884  extension compared with Perl (at least for 5.8), which requires all branches to  extension compared with Perl, which requires all branches to match the same
1885  match the same length of string. An assertion such as  length of string. An assertion such as
1886  .sp  .sp
1887    (?<=ab(c|de))    (?<=ab(c|de))
1888  .sp  .sp
1889  is not permitted, because its single top-level branch can match two different  is not permitted, because its single top-level branch can match two different
1890  lengths, but it is acceptable if rewritten to use two top-level branches:  lengths, but it is acceptable to PCRE if rewritten to use two top-level
1891    branches:
1892  .sp  .sp
1893    (?<=abc|abde)    (?<=abc|abde)
1894  .sp  .sp
1895  In some cases, the Perl 5.10 escape sequence \eK  In some cases, the escape sequence \eK
1896  .\" HTML <a href="#resetmatchstart">  .\" HTML <a href="#resetmatchstart">
1897  .\" </a>  .\" </a>
1898  (see above)  (see above)
1899  .\"  .\"
1900  can be used instead of a lookbehind assertion; this is not restricted to a  can be used instead of a lookbehind assertion to get round the fixed-length
1901  fixed-length.  restriction.
1902  .P  .P
1903  The implementation of lookbehind assertions is, for each alternative, to  The implementation of lookbehind assertions is, for each alternative, to
1904  temporarily move the current position back by the fixed length and then try to  temporarily move the current position back by the fixed length and then try to
# Line 1697  to appear in lookbehind assertions, beca Line 1910  to appear in lookbehind assertions, beca
1910  the length of the lookbehind. The \eX and \eR escapes, which can match  the length of the lookbehind. The \eX and \eR escapes, which can match
1911  different numbers of bytes, are also not permitted.  different numbers of bytes, are also not permitted.
1912  .P  .P
1913    .\" HTML <a href="#subpatternsassubroutines">
1914    .\" </a>
1915    "Subroutine"
1916    .\"
1917    calls (see below) such as (?2) or (?&X) are permitted in lookbehinds, as long
1918    as the subpattern matches a fixed-length string.
1919    .\" HTML <a href="#recursion">
1920    .\" </a>
1921    Recursion,
1922    .\"
1923    however, is not supported.
1924    .P
1925  Possessive quantifiers can be used in conjunction with lookbehind assertions to  Possessive quantifiers can be used in conjunction with lookbehind assertions to
1926  specify efficient matching at the end of the subject string. Consider a simple  specify efficient matching of fixed-length strings at the end of subject
1927  pattern such as  strings. Consider a simple pattern such as
1928  .sp  .sp
1929    abcd$    abcd$
1930  .sp  .sp
# Line 1763  characters that are not "999". Line 1988  characters that are not "999".
1988  .sp  .sp
1989  It is possible to cause the matching process to obey a subpattern  It is possible to cause the matching process to obey a subpattern
1990  conditionally or to choose between two alternative subpatterns, depending on  conditionally or to choose between two alternative subpatterns, depending on
1991  the result of an assertion, or whether a previous capturing subpattern matched  the result of an assertion, or whether a specific capturing subpattern has
1992  or not. The two possible forms of conditional subpattern are  already been matched. The two possible forms of conditional subpattern are:
1993  .sp  .sp
1994    (?(condition)yes-pattern)    (?(condition)yes-pattern)
1995    (?(condition)yes-pattern|no-pattern)    (?(condition)yes-pattern|no-pattern)
1996  .sp  .sp
1997  If the condition is satisfied, the yes-pattern is used; otherwise the  If the condition is satisfied, the yes-pattern is used; otherwise the
1998  no-pattern (if present) is used. If there are more than two alternatives in the  no-pattern (if present) is used. If there are more than two alternatives in the
1999  subpattern, a compile-time error occurs.  subpattern, a compile-time error occurs. Each of the two alternatives may
2000    itself contain nested subpatterns of any form, including conditional
2001    subpatterns; the restriction to two alternatives applies only at the level of
2002    the condition. This pattern fragment is an example where the alternatives are
2003    complex:
2004    .sp
2005      (?(1) (A|B|C) | (D | (?(2)E|F) | E) )
2006    .sp
2007  .P  .P
2008  There are four kinds of condition: references to subpatterns, references to  There are four kinds of condition: references to subpatterns, references to
2009  recursion, a pseudo-condition called DEFINE, and assertions.  recursion, a pseudo-condition called DEFINE, and assertions.
# Line 1780  recursion, a pseudo-condition called DEF Line 2012  recursion, a pseudo-condition called DEF
2012  .rs  .rs
2013  .sp  .sp
2014  If the text between the parentheses consists of a sequence of digits, the  If the text between the parentheses consists of a sequence of digits, the
2015  condition is true if the capturing subpattern of that number has previously  condition is true if a capturing subpattern of that number has previously
2016  matched. An alternative notation is to precede the digits with a plus or minus  matched. If there is more than one capturing subpattern with the same number
2017  sign. In this case, the subpattern number is relative rather than absolute.  (see the earlier
2018  The most recently opened parentheses can be referenced by (?(-1), the next most  .\"
2019  recent by (?(-2), and so on. In looping constructs it can also make sense to  .\" HTML <a href="#recursion">
2020  refer to subsequent groups with constructs such as (?(+2).  .\" </a>
2021    section about duplicate subpattern numbers),
2022    .\"
2023    the condition is true if any of them have matched. An alternative notation is
2024    to precede the digits with a plus or minus sign. In this case, the subpattern
2025    number is relative rather than absolute. The most recently opened parentheses
2026    can be referenced by (?(-1), the next most recent by (?(-2), and so on. Inside
2027    loops it can also make sense to refer to subsequent groups. The next
2028    parentheses to be opened can be referenced as (?(+1), and so on. (The value
2029    zero in any of these forms is not used; it provokes a compile-time error.)
2030  .P  .P
2031  Consider the following pattern, which contains non-significant white space to  Consider the following pattern, which contains non-significant white space to
2032  make it more readable (assume the PCRE_EXTENDED option) and to divide it into  make it more readable (assume the PCRE_EXTENDED option) and to divide it into
# Line 1796  three parts for ease of discussion: Line 2037  three parts for ease of discussion:
2037  The first part matches an optional opening parenthesis, and if that  The first part matches an optional opening parenthesis, and if that
2038  character is present, sets it as the first captured substring. The second part  character is present, sets it as the first captured substring. The second part
2039  matches one or more characters that are not parentheses. The third part is a  matches one or more characters that are not parentheses. The third part is a
2040  conditional subpattern that tests whether the first set of parentheses matched  conditional subpattern that tests whether or not the first set of parentheses
2041  or not. If they did, that is, if subject started with an opening parenthesis,  matched. If they did, that is, if subject started with an opening parenthesis,
2042  the condition is true, and so the yes-pattern is executed and a closing  the condition is true, and so the yes-pattern is executed and a closing
2043  parenthesis is required. Otherwise, since no-pattern is not present, the  parenthesis is required. Otherwise, since no-pattern is not present, the
2044  subpattern matches nothing. In other words, this pattern matches a sequence of  subpattern matches nothing. In other words, this pattern matches a sequence of
# Line 1826  Rewriting the above example to use a nam Line 2067  Rewriting the above example to use a nam
2067  .sp  .sp
2068    (?<OPEN> \e( )?    [^()]+    (?(<OPEN>) \e) )    (?<OPEN> \e( )?    [^()]+    (?(<OPEN>) \e) )
2069  .sp  .sp
2070    If the name used in a condition of this kind is a duplicate, the test is
2071    applied to all subpatterns of the same name, and is true if any one of them has
2072    matched.
2073  .  .
2074  .SS "Checking for pattern recursion"  .SS "Checking for pattern recursion"
2075  .rs  .rs
# Line 1837  letter R, for example: Line 2081  letter R, for example:
2081  .sp  .sp
2082    (?(R3)...) or (?(R&name)...)    (?(R3)...) or (?(R&name)...)
2083  .sp  .sp
2084  the condition is true if the most recent recursion is into the subpattern whose  the condition is true if the most recent recursion is into a subpattern whose
2085  number or name is given. This condition does not check the entire recursion  number or name is given. This condition does not check the entire recursion
2086  stack.  stack. If the name used in a condition of this kind is a duplicate, the test is
2087    applied to all subpatterns of the same name, and is true if any one of them is
2088    the most recent recursion.
2089  .P  .P
2090  At "top level", all these recursion test conditions are false. Recursive  At "top level", all these recursion test conditions are false.
2091  patterns are described below.  .\" HTML <a href="#recursion">
2092    .\" </a>
2093    The syntax for recursive patterns
2094    .\"
2095    is described below.
2096  .  .
2097    .\" HTML <a name="subdefine"></a>
2098  .SS "Defining subpatterns for use by reference only"  .SS "Defining subpatterns for use by reference only"
2099  .rs  .rs
2100  .sp  .sp
# Line 1851  If the condition is the string (DEFINE), Line 2102  If the condition is the string (DEFINE),
2102  name DEFINE, the condition is always false. In this case, there may be only one  name DEFINE, the condition is always false. In this case, there may be only one
2103  alternative in the subpattern. It is always skipped if control reaches this  alternative in the subpattern. It is always skipped if control reaches this
2104  point in the pattern; the idea of DEFINE is that it can be used to define  point in the pattern; the idea of DEFINE is that it can be used to define
2105  "subroutines" that can be referenced from elsewhere. (The use of "subroutines"  "subroutines" that can be referenced from elsewhere. (The use of
2106  is described below.) For example, a pattern to match an IPv4 address could be  .\" HTML <a href="#subpatternsassubroutines">
2107  written like this (ignore whitespace and line breaks):  .\" </a>
2108    "subroutines"
2109    .\"
2110    is described below.) For example, a pattern to match an IPv4 address such as
2111    "192.168.23.245" could be written like this (ignore whitespace and line
2112    breaks):
2113  .sp  .sp
2114    (?(DEFINE) (?<byte> 2[0-4]\ed | 25[0-5] | 1\ed\ed | [1-9]?\ed) )    (?(DEFINE) (?<byte> 2[0-4]\ed | 25[0-5] | 1\ed\ed | [1-9]?\ed) )
2115    \eb (?&byte) (\e.(?&byte)){3} \eb    \eb (?&byte) (\e.(?&byte)){3} \eb
# Line 1861  written like this (ignore whitespace and Line 2117  written like this (ignore whitespace and
2117  The first part of the pattern is a DEFINE group inside which a another group  The first part of the pattern is a DEFINE group inside which a another group
2118  named "byte" is defined. This matches an individual component of an IPv4  named "byte" is defined. This matches an individual component of an IPv4
2119  address (a number less than 256). When matching takes place, this part of the  address (a number less than 256). When matching takes place, this part of the
2120  pattern is skipped because DEFINE acts like a false condition.  pattern is skipped because DEFINE acts like a false condition. The rest of the
2121  .P  pattern uses references to the named group to match the four dot-separated
2122  The rest of the pattern uses references to the named group to match the four  components of an IPv4 address, insisting on a word boundary at each end.
 dot-separated components of an IPv4 address, insisting on a word boundary at  
 each end.  
2123  .  .
2124  .SS "Assertion conditions"  .SS "Assertion conditions"
2125  .rs  .rs
# Line 1890  dd-aaa-dd or dd-dd-dd, where aaa are let Line 2144  dd-aaa-dd or dd-dd-dd, where aaa are let
2144  .SH COMMENTS  .SH COMMENTS
2145  .rs  .rs
2146  .sp  .sp
2147  The sequence (?# marks the start of a comment that continues up to the next  There are two ways of including comments in patterns that are processed by
2148  closing parenthesis. Nested parentheses are not permitted. The characters  PCRE. In both cases, the start of the comment must not be in a character class,
2149  that make up a comment play no part in the pattern matching at all.  nor in the middle of any other sequence of related characters such as (?: or a
2150    subpattern name or number. The characters that make up a comment play no part
2151    in the pattern matching.
2152  .P  .P
2153  If the PCRE_EXTENDED option is set, an unescaped # character outside a  The sequence (?# marks the start of a comment that continues up to the next
2154  character class introduces a comment that continues to immediately after the  closing parenthesis. Nested parentheses are not permitted. If the PCRE_EXTENDED
2155  next newline in the pattern.  option is set, an unescaped # character also introduces a comment, which in
2156    this case continues to immediately after the next newline character or
2157    character sequence in the pattern. Which characters are interpreted as newlines
2158    is controlled by the options passed to \fBpcre_compile()\fP or by a special
2159    sequence at the start of the pattern, as described in the section entitled
2160    .\" HTML <a href="#newlines">
2161    .\" </a>
2162    "Newline conventions"
2163    .\"
2164    above. Note that the end of this type of comment is a literal newline sequence
2165    in the pattern; escape sequences that happen to represent a newline do not
2166    count. For example, consider this pattern when PCRE_EXTENDED is set, and the
2167    default newline convention is in force:
2168    .sp
2169      abc #comment \en still comment
2170    .sp
2171    On encountering the # character, \fBpcre_compile()\fP skips along, looking for
2172    a newline in the pattern. The sequence \en is still literal at this stage, so
2173    it does not terminate the comment. Only an actual character with the code value
2174    0x0a (the default newline) does so.
2175  .  .
2176  .  .
2177  .\" HTML <a name="recursion"></a>  .\" HTML <a name="recursion"></a>
# Line 1922  recursively to the pattern in which it a Line 2197  recursively to the pattern in which it a
2197  Obviously, PCRE cannot support the interpolation of Perl code. Instead, it  Obviously, PCRE cannot support the interpolation of Perl code. Instead, it
2198  supports special syntax for recursion of the entire pattern, and also for  supports special syntax for recursion of the entire pattern, and also for
2199  individual subpattern recursion. After its introduction in PCRE and Python,  individual subpattern recursion. After its introduction in PCRE and Python,
2200  this kind of recursion was introduced into Perl at release 5.10.  this kind of recursion was subsequently introduced into Perl at release 5.10.
2201  .P  .P
2202  A special item that consists of (? followed by a number greater than zero and a  A special item that consists of (? followed by a number greater than zero and a
2203  closing parenthesis is a recursive call of the subpattern of the given number,  closing parenthesis is a recursive call of the subpattern of the given number,
2204  provided that it occurs inside that subpattern. (If not, it is a "subroutine"  provided that it occurs inside that subpattern. (If not, it is a
2205    .\" HTML <a href="#subpatternsassubroutines">
2206    .\" </a>
2207    "subroutine"
2208    .\"
2209  call, which is described in the next section.) The special item (?R) or (?0) is  call, which is described in the next section.) The special item (?R) or (?0) is
2210  a recursive call of the entire regular expression.  a recursive call of the entire regular expression.
2211  .P  .P
 In PCRE (like Python, but unlike Perl), a recursive subpattern call is always  
 treated as an atomic group. That is, once it has matched some of the subject  
 string, it is never re-entered, even if it contains untried alternatives and  
 there is a subsequent matching failure.  
 .P  
2212  This PCRE pattern solves the nested parentheses problem (assume the  This PCRE pattern solves the nested parentheses problem (assume the
2213  PCRE_EXTENDED option is set so that white space is ignored):  PCRE_EXTENDED option is set so that white space is ignored):
2214  .sp  .sp
2215    \e( ( (?>[^()]+) | (?R) )* \e)    \e( ( [^()]++ | (?R) )* \e)
2216  .sp  .sp
2217  First it matches an opening parenthesis. Then it matches any number of  First it matches an opening parenthesis. Then it matches any number of
2218  substrings which can either be a sequence of non-parentheses, or a recursive  substrings which can either be a sequence of non-parentheses, or a recursive
2219  match of the pattern itself (that is, a correctly parenthesized substring).  match of the pattern itself (that is, a correctly parenthesized substring).
2220  Finally there is a closing parenthesis.  Finally there is a closing parenthesis. Note the use of a possessive quantifier
2221    to avoid backtracking into sequences of non-parentheses.
2222  .P  .P
2223  If this were part of a larger pattern, you would not want to recurse the entire  If this were part of a larger pattern, you would not want to recurse the entire
2224  pattern, so instead you could use this:  pattern, so instead you could use this:
2225  .sp  .sp
2226    ( \e( ( (?>[^()]+) | (?1) )* \e) )    ( \e( ( [^()]++ | (?1) )* \e) )
2227  .sp  .sp
2228  We have put the pattern into parentheses, and caused the recursion to refer to  We have put the pattern into parentheses, and caused the recursion to refer to
2229  them instead of the whole pattern.  them instead of the whole pattern.
2230  .P  .P
2231  In a larger pattern, keeping track of parenthesis numbers can be tricky. This  In a larger pattern, keeping track of parenthesis numbers can be tricky. This
2232  is made easier by the use of relative references. (A Perl 5.10 feature.)  is made easier by the use of relative references. Instead of (?1) in the
2233  Instead of (?1) in the pattern above you can write (?-2) to refer to the second  pattern above you can write (?-2) to refer to the second most recently opened
2234  most recently opened parentheses preceding the recursion. In other words, a  parentheses preceding the recursion. In other words, a negative number counts
2235  negative number counts capturing parentheses leftwards from the point at which  capturing parentheses leftwards from the point at which it is encountered.
 it is encountered.  
2236  .P  .P
2237  It is also possible to refer to subsequently opened parentheses, by writing  It is also possible to refer to subsequently opened parentheses, by writing
2238  references such as (?+2). However, these cannot be recursive because the  references such as (?+2). However, these cannot be recursive because the
2239  reference is not inside the parentheses that are referenced. They are always  reference is not inside the parentheses that are referenced. They are always
2240  "subroutine" calls, as described in the next section.  .\" HTML <a href="#subpatternsassubroutines">
2241    .\" </a>
2242    "subroutine"
2243    .\"
2244    calls, as described in the next section.
2245  .P  .P
2246  An alternative approach is to use named parentheses instead. The Perl syntax  An alternative approach is to use named parentheses instead. The Perl syntax
2247  for this is (?&name); PCRE's earlier syntax (?P>name) is also supported. We  for this is (?&name); PCRE's earlier syntax (?P>name) is also supported. We
2248  could rewrite the above example as follows:  could rewrite the above example as follows:
2249  .sp  .sp
2250    (?<pn> \e( ( (?>[^()]+) | (?&pn) )* \e) )    (?<pn> \e( ( [^()]++ | (?&pn) )* \e) )
2251  .sp  .sp
2252  If there is more than one subpattern with the same name, the earliest one is  If there is more than one subpattern with the same name, the earliest one is
2253  used.  used.
2254  .P  .P
2255  This particular example pattern that we have been looking at contains nested  This particular example pattern that we have been looking at contains nested
2256  unlimited repeats, and so the use of atomic grouping for matching strings of  unlimited repeats, and so the use of a possessive quantifier for matching
2257  non-parentheses is important when applying the pattern to strings that do not  strings of non-parentheses is important when applying the pattern to strings
2258  match. For example, when this pattern is applied to  that do not match. For example, when this pattern is applied to
2259  .sp  .sp
2260    (aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa()    (aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa()
2261  .sp  .sp
2262  it yields "no match" quickly. However, if atomic grouping is not used,  it yields "no match" quickly. However, if a possessive quantifier is not used,
2263  the match runs for a very long time indeed because there are so many different  the match runs for a very long time indeed because there are so many different
2264  ways the + and * repeats can carve up the subject, and all have to be tested  ways the + and * repeats can carve up the subject, and all have to be tested
2265  before failure can be reported.  before failure can be reported.
2266  .P  .P
2267  At the end of a match, the values set for any capturing subpatterns are those  At the end of a match, the values of capturing parentheses are those from
2268  from the outermost level of the recursion at which the subpattern value is set.  the outermost level. If you want to obtain intermediate values, a callout
2269  If you want to obtain intermediate values, a callout function can be used (see  function can be used (see below and the
 below and the  
2270  .\" HREF  .\" HREF
2271  \fBpcrecallout\fP  \fBpcrecallout\fP
2272  .\"  .\"
# Line 1997  documentation). If the pattern above is Line 2274  documentation). If the pattern above is
2274  .sp  .sp
2275    (ab(cd)ef)    (ab(cd)ef)
2276  .sp  .sp
2277  the value for the capturing parentheses is "ef", which is the last value taken  the value for the inner capturing parentheses (numbered 2) is "ef", which is
2278  on at the top level. If additional parentheses are added, giving  the last value taken on at the top level. If a capturing subpattern is not
2279  .sp  matched at the top level, its final value is unset, even if it is (temporarily)
2280    \e( ( ( (?>[^()]+) | (?R) )* ) \e)  set at a deeper level.
2281       ^                        ^  .P
2282       ^                        ^  If there are more than 15 capturing parentheses in a pattern, PCRE has to
2283  .sp  obtain extra memory to store data during a recursion, which it does by using
2284  the string they capture is "ab(cd)ef", the contents of the top level  \fBpcre_malloc\fP, freeing it via \fBpcre_free\fP afterwards. If no memory can
2285  parentheses. If there are more than 15 capturing parentheses in a pattern, PCRE  be obtained, the match fails with the PCRE_ERROR_NOMEMORY error.
 has to obtain extra memory to store data during a recursion, which it does by  
 using \fBpcre_malloc\fP, freeing it via \fBpcre_free\fP afterwards. If no  
 memory can be obtained, the match fails with the PCRE_ERROR_NOMEMORY error.  
2286  .P  .P
2287  Do not confuse the (?R) item with the condition (R), which tests for recursion.  Do not confuse the (?R) item with the condition (R), which tests for recursion.
2288  Consider this pattern, which matches text in angle brackets, allowing for  Consider this pattern, which matches text in angle brackets, allowing for
# Line 2022  different alternatives for the recursive Line 2296  different alternatives for the recursive
2296  is the actual recursive call.  is the actual recursive call.
2297  .  .
2298  .  .
2299    .\" HTML <a name="recursiondifference"></a>
2300    .SS "Recursion difference from Perl"
2301    .rs
2302    .sp
2303    In PCRE (like Python, but unlike Perl), a recursive subpattern call is always
2304    treated as an atomic group. That is, once it has matched some of the subject
2305    string, it is never re-entered, even if it contains untried alternatives and
2306    there is a subsequent matching failure. This can be illustrated by the
2307    following pattern, which purports to match a palindromic string that contains
2308    an odd number of characters (for example, "a", "aba", "abcba", "abcdcba"):
2309    .sp
2310      ^(.|(.)(?1)\e2)$
2311    .sp
2312    The idea is that it either matches a single character, or two identical
2313    characters surrounding a sub-palindrome. In Perl, this pattern works; in PCRE
2314    it does not if the pattern is longer than three characters. Consider the
2315    subject string "abcba":
2316    .P
2317    At the top level, the first character is matched, but as it is not at the end
2318    of the string, the first alternative fails; the second alternative is taken
2319    and the recursion kicks in. The recursive call to subpattern 1 successfully
2320    matches the next character ("b"). (Note that the beginning and end of line
2321    tests are not part of the recursion).
2322    .P
2323    Back at the top level, the next character ("c") is compared with what
2324    subpattern 2 matched, which was "a". This fails. Because the recursion is
2325    treated as an atomic group, there are now no backtracking points, and so the
2326    entire match fails. (Perl is able, at this point, to re-enter the recursion and
2327    try the second alternative.) However, if the pattern is written with the
2328    alternatives in the other order, things are different:
2329    .sp
2330      ^((.)(?1)\e2|.)$
2331    .sp
2332    This time, the recursing alternative is tried first, and continues to recurse
2333    until it runs out of characters, at which point the recursion fails. But this
2334    time we do have another alternative to try at the higher level. That is the big
2335    difference: in the previous case the remaining alternative is at a deeper
2336    recursion level, which PCRE cannot use.
2337    .P
2338    To change the pattern so that it matches all palindromic strings, not just
2339    those with an odd number of characters, it is tempting to change the pattern to
2340    this:
2341    .sp
2342      ^((.)(?1)\e2|.?)$
2343    .sp
2344    Again, this works in Perl, but not in PCRE, and for the same reason. When a
2345    deeper recursion has matched a single character, it cannot be entered again in
2346    order to match an empty string. The solution is to separate the two cases, and
2347    write out the odd and even cases as alternatives at the higher level:
2348    .sp
2349      ^(?:((.)(?1)\e2|)|((.)(?3)\e4|.))
2350    .sp
2351    If you want to match typical palindromic phrases, the pattern has to ignore all
2352    non-word characters, which can be done like this:
2353    .sp
2354      ^\eW*+(?:((.)\eW*+(?1)\eW*+\e2|)|((.)\eW*+(?3)\eW*+\e4|\eW*+.\eW*+))\eW*+$
2355    .sp
2356    If run with the PCRE_CASELESS option, this pattern matches phrases such as "A
2357    man, a plan, a canal: Panama!" and it works well in both PCRE and Perl. Note
2358    the use of the possessive quantifier *+ to avoid backtracking into sequences of
2359    non-word characters. Without this, PCRE takes a great deal longer (ten times or
2360    more) to match typical phrases, and Perl takes so long that you think it has
2361    gone into a loop.
2362    .P
2363    \fBWARNING\fP: The palindrome-matching patterns above work only if the subject
2364    string does not start with a palindrome that is shorter than the entire string.
2365    For example, although "abcba" is correctly matched, if the subject is "ababa",
2366    PCRE finds the palindrome "aba" at the start, then fails at top level because
2367    the end of the string does not follow. Once again, it cannot jump back into the
2368    recursion to try other alternatives, so the entire match fails.
2369    .
2370    .
2371  .\" HTML <a name="subpatternsassubroutines"></a>  .\" HTML <a name="subpatternsassubroutines"></a>
2372  .SH "SUBPATTERNS AS SUBROUTINES"  .SH "SUBPATTERNS AS SUBROUTINES"
2373  .rs  .rs
# Line 2048  matches "sense and sensibility" and "res Line 2394  matches "sense and sensibility" and "res
2394  is used, it does match "sense and responsibility" as well as the other two  is used, it does match "sense and responsibility" as well as the other two
2395  strings. Another example is given in the discussion of DEFINE above.  strings. Another example is given in the discussion of DEFINE above.
2396  .P  .P
2397  Like recursive subpatterns, a "subroutine" call is always treated as an atomic  Like recursive subpatterns, a subroutine call is always treated as an atomic
2398  group. That is, once it has matched some of the subject string, it is never  group. That is, once it has matched some of the subject string, it is never
2399  re-entered, even if it contains untried alternatives and there is a subsequent  re-entered, even if it contains untried alternatives and there is a subsequent
2400  matching failure.  matching failure. Any capturing parentheses that are set during the subroutine
2401    call revert to their previous values afterwards.
2402  .P  .P
2403  When a subpattern is used as a subroutine, processing options such as  When a subpattern is used as a subroutine, processing options such as
2404  case-independence are fixed when the subpattern is defined. They cannot be  case-independence are fixed when the subpattern is defined. They cannot be
# Line 2120  description of the interface to the call Line 2467  description of the interface to the call
2467  documentation.  documentation.
2468  .  .
2469  .  .
2470    .\" HTML <a name="backtrackcontrol"></a>
2471  .SH "BACKTRACKING CONTROL"  .SH "BACKTRACKING CONTROL"
2472  .rs  .rs
2473  .sp  .sp
# Line 2135  a backtracking algorithm. With the excep Line 2483  a backtracking algorithm. With the excep
2483  failing negative assertion, they cause an error if encountered by  failing negative assertion, they cause an error if encountered by
2484  \fBpcre_dfa_exec()\fP.  \fBpcre_dfa_exec()\fP.
2485  .P  .P
2486  If any of these verbs are used in an assertion subpattern, their effect is  If any of these verbs are used in an assertion or subroutine subpattern
2487  confined to that subpattern; it does not extend to the surrounding pattern.  (including recursive subpatterns), their effect is confined to that subpattern;
2488  Note that assertion subpatterns are processed as anchored at the point where  it does not extend to the surrounding pattern. Note that such subpatterns are
2489  they are tested.  processed as anchored at the point where they are tested.
2490  .P  .P
2491  The new verbs make use of what was previously invalid syntax: an opening  The new verbs make use of what was previously invalid syntax: an opening
2492  parenthesis followed by an asterisk. In Perl, they are generally of the form  parenthesis followed by an asterisk. They are generally of the form
2493  (*VERB:ARG) but PCRE does not support the use of arguments, so its general  (*VERB) or (*VERB:NAME). Some may take either form, with differing behaviour,
2494  form is just (*VERB). Any number of these verbs may occur in a pattern. There  depending on whether or not an argument is present. An name is a sequence of
2495  are two kinds:  letters, digits, and underscores. If the name is empty, that is, if the closing
2496    parenthesis immediately follows the colon, the effect is as if the colon were
2497    not there. Any number of these verbs may occur in a pattern.
2498    .P
2499    PCRE contains some optimizations that are used to speed up matching by running
2500    some checks at the start of each match attempt. For example, it may know the
2501    minimum length of matching subject, or that a particular character must be
2502    present. When one of these optimizations suppresses the running of a match, any
2503    included backtracking verbs will not, of course, be processed. You can suppress
2504    the start-of-match optimizations by setting the PCRE_NO_START_OPTIMIZE option
2505    when calling \fBpcre_exec()\fP.
2506    .
2507  .  .
2508  .SS "Verbs that act immediately"  .SS "Verbs that act immediately"
2509  .rs  .rs
2510  .sp  .sp
2511  The following verbs act as soon as they are encountered:  The following verbs act as soon as they are encountered. They may not be
2512    followed by a name.
2513  .sp  .sp
2514     (*ACCEPT)     (*ACCEPT)
2515  .sp  .sp
2516  This verb causes the match to end successfully, skipping the remainder of the  This verb causes the match to end successfully, skipping the remainder of the
2517  pattern. When inside a recursion, only the innermost pattern is ended  pattern. When inside a recursion, only the innermost pattern is ended
2518  immediately. PCRE differs from Perl in what happens if the (*ACCEPT) is inside  immediately. If (*ACCEPT) is inside capturing parentheses, the data so far is
2519  capturing parentheses. In Perl, the data so far is captured: in PCRE no data is  captured. (This feature was added to PCRE at release 8.00.) For example:
 captured. For example:  
2520  .sp  .sp
2521    A(A|B(*ACCEPT)|C)D    A((?:A|B(*ACCEPT)|C)D)
2522  .sp  .sp
2523  This matches "AB", "AAD", or "ACD", but when it matches "AB", no data is  This matches "AB", "AAD", or "ACD"; when it matches "AB", "B" is captured by
2524  captured.  the outer parentheses.
2525  .sp  .sp
2526    (*FAIL) or (*F)    (*FAIL) or (*F)
2527  .sp  .sp
# Line 2177  callout feature, as for example in this Line 2536  callout feature, as for example in this
2536  A match with the string "aaaa" always fails, but the callout is taken before  A match with the string "aaaa" always fails, but the callout is taken before
2537  each backtrack happens (in this example, 10 times).  each backtrack happens (in this example, 10 times).
2538  .  .
2539    .
2540    .SS "Recording which path was taken"
2541    .rs
2542    .sp
2543    There is one verb whose main purpose is to track how a match was arrived at,
2544    though it also has a secondary use in conjunction with advancing the match
2545    starting point (see (*SKIP) below).
2546    .sp
2547      (*MARK:NAME) or (*:NAME)
2548    .sp
2549    A name is always required with this verb. There may be as many instances of
2550    (*MARK) as you like in a pattern, and their names do not have to be unique.
2551    .P
2552    When a match succeeds, the name of the last-encountered (*MARK) is passed back
2553    to the caller via the \fIpcre_extra\fP data structure, as described in the
2554    .\" HTML <a href="pcreapi.html#extradata">
2555    .\" </a>
2556    section on \fIpcre_extra\fP
2557    .\"
2558    in the
2559    .\" HREF
2560    \fBpcreapi\fP
2561    .\"
2562    documentation. No data is returned for a partial match. Here is an example of
2563    \fBpcretest\fP output, where the /K modifier requests the retrieval and
2564    outputting of (*MARK) data:
2565    .sp
2566      /X(*MARK:A)Y|X(*MARK:B)Z/K
2567      XY
2568       0: XY
2569      MK: A
2570      XZ
2571       0: XZ
2572      MK: B
2573    .sp
2574    The (*MARK) name is tagged with "MK:" in this output, and in this example it
2575    indicates which of the two alternatives matched. This is a more efficient way
2576    of obtaining this information than putting each alternative in its own
2577    capturing parentheses.
2578    .P
2579    A name may also be returned after a failed match if the final path through the
2580    pattern involves (*MARK). However, unless (*MARK) used in conjunction with
2581    (*COMMIT), this is unlikely to happen for an unanchored pattern because, as the
2582    starting point for matching is advanced, the final check is often with an empty
2583    string, causing a failure before (*MARK) is reached. For example:
2584    .sp
2585      /X(*MARK:A)Y|X(*MARK:B)Z/K
2586      XP
2587      No match
2588    .sp
2589    There are three potential starting points for this match (starting with X,
2590    starting with P, and with an empty string). If the pattern is anchored, the
2591    result is different:
2592    .sp
2593      /^X(*MARK:A)Y|^X(*MARK:B)Z/K
2594      XP
2595      No match, mark = B
2596    .sp
2597    PCRE's start-of-match optimizations can also interfere with this. For example,
2598    if, as a result of a call to \fBpcre_study()\fP, it knows the minimum
2599    subject length for a match, a shorter subject will not be scanned at all.
2600    .P
2601    Note that similar anomalies (though different in detail) exist in Perl, no
2602    doubt for the same reasons. The use of (*MARK) data after a failed match of an
2603    unanchored pattern is not recommended, unless (*COMMIT) is involved.
2604    .
2605    .
2606  .SS "Verbs that act after backtracking"  .SS "Verbs that act after backtracking"
2607  .rs  .rs
2608  .sp  .sp
2609  The following verbs do nothing when they are encountered. Matching continues  The following verbs do nothing when they are encountered. Matching continues
2610  with what follows, but if there is no subsequent match, a failure is forced.  with what follows, but if there is no subsequent match, causing a backtrack to
2611  The verbs differ in exactly what kind of failure occurs.  the verb, a failure is forced. That is, backtracking cannot pass to the left of
2612    the verb. However, when one of these verbs appears inside an atomic group, its
2613    effect is confined to that group, because once the group has been matched,
2614    there is never any backtracking into it. In this situation, backtracking can
2615    "jump back" to the left of the entire atomic group. (Remember also, as stated
2616    above, that this localization also applies in subroutine calls and assertions.)
2617    .P
2618    These verbs differ in exactly what kind of failure occurs when backtracking
2619    reaches them.
2620  .sp  .sp
2621    (*COMMIT)    (*COMMIT)
2622  .sp  .sp
2623  This verb causes the whole match to fail outright if the rest of the pattern  This verb, which may not be followed by a name, causes the whole match to fail
2624  does not match. Even if the pattern is unanchored, no further attempts to find  outright if the rest of the pattern does not match. Even if the pattern is
2625  a match by advancing the start point take place. Once (*COMMIT) has been  unanchored, no further attempts to find a match by advancing the starting point
2626  passed, \fBpcre_exec()\fP is committed to finding a match at the current  take place. Once (*COMMIT) has been passed, \fBpcre_exec()\fP is committed to
2627  starting point, or not at all. For example:  finding a match at the current starting point, or not at all. For example:
2628  .sp  .sp
2629    a+(*COMMIT)b    a+(*COMMIT)b
2630  .sp  .sp
2631  This matches "xxaab" but not "aacaab". It can be thought of as a kind of  This matches "xxaab" but not "aacaab". It can be thought of as a kind of
2632  dynamic anchor, or "I've started, so I must finish."  dynamic anchor, or "I've started, so I must finish." The name of the most
2633  .sp  recently passed (*MARK) in the path is passed back when (*COMMIT) forces a
2634    (*PRUNE)  match failure.
2635  .sp  .P
2636  This verb causes the match to fail at the current position if the rest of the  Note that (*COMMIT) at the start of a pattern is not the same as an anchor,
2637  pattern does not match. If the pattern is unanchored, the normal "bumpalong"  unless PCRE's start-of-match optimizations are turned off, as shown in this
2638  advance to the next starting character then happens. Backtracking can occur as  \fBpcretest\fP example:
2639  usual to the left of (*PRUNE), or when matching to the right of (*PRUNE), but  .sp
2640  if there is no match to the right, backtracking cannot cross (*PRUNE).    /(*COMMIT)abc/
2641  In simple cases, the use of (*PRUNE) is just an alternative to an atomic    xyzabc
2642  group or possessive quantifier, but there are some uses of (*PRUNE) that cannot     0: abc
2643  be expressed in any other way.    xyzabc\eY
2644      No match
2645    .sp
2646    PCRE knows that any match must start with "a", so the optimization skips along
2647    the subject to "a" before running the first match attempt, which succeeds. When
2648    the optimization is disabled by the \eY escape in the second subject, the match
2649    starts at "x" and so the (*COMMIT) causes it to fail without trying any other
2650    starting points.
2651    .sp
2652      (*PRUNE) or (*PRUNE:NAME)
2653    .sp
2654    This verb causes the match to fail at the current starting position in the
2655    subject if the rest of the pattern does not match. If the pattern is
2656    unanchored, the normal "bumpalong" advance to the next starting character then
2657    happens. Backtracking can occur as usual to the left of (*PRUNE), before it is
2658    reached, or when matching to the right of (*PRUNE), but if there is no match to
2659    the right, backtracking cannot cross (*PRUNE). In simple cases, the use of
2660    (*PRUNE) is just an alternative to an atomic group or possessive quantifier,
2661    but there are some uses of (*PRUNE) that cannot be expressed in any other way.
2662    The behaviour of (*PRUNE:NAME) is the same as (*MARK:NAME)(*PRUNE) when the
2663    match fails completely; the name is passed back if this is the final attempt.
2664    (*PRUNE:NAME) does not pass back a name if the match succeeds. In an anchored
2665    pattern (*PRUNE) has the same effect as (*COMMIT).
2666  .sp  .sp
2667    (*SKIP)    (*SKIP)
2668  .sp  .sp
2669  This verb is like (*PRUNE), except that if the pattern is unanchored, the  This verb, when given without a name, is like (*PRUNE), except that if the
2670  "bumpalong" advance is not to the next character, but to the position in the  pattern is unanchored, the "bumpalong" advance is not to the next character,
2671  subject where (*SKIP) was encountered. (*SKIP) signifies that whatever text  but to the position in the subject where (*SKIP) was encountered. (*SKIP)
2672  was matched leading up to it cannot be part of a successful match. Consider:  signifies that whatever text was matched leading up to it cannot be part of a
2673    successful match. Consider:
2674  .sp  .sp
2675    a+(*SKIP)b    a+(*SKIP)b
2676  .sp  .sp
2677  If the subject is "aaaac...", after the first match attempt fails (starting at  If the subject is "aaaac...", after the first match attempt fails (starting at
2678  the first character in the string), the starting point skips on to start the  the first character in the string), the starting point skips on to start the
2679  next attempt at "c". Note that a possessive quantifer does not have the same  next attempt at "c". Note that a possessive quantifer does not have the same
2680  effect in this example; although it would suppress backtracking during the  effect as this example; although it would suppress backtracking during the
2681  first match attempt, the second attempt would start at the second character  first match attempt, the second attempt would start at the second character
2682  instead of skipping on to "c".  instead of skipping on to "c".
2683  .sp  .sp
2684    (*THEN)    (*SKIP:NAME)
2685  .sp  .sp
2686  This verb causes a skip to the next alternation if the rest of the pattern does  When (*SKIP) has an associated name, its behaviour is modified. If the
2687  not match. That is, it cancels pending backtracking, but only within the  following pattern fails to match, the previous path through the pattern is
2688  current alternation. Its name comes from the observation that it can be used  searched for the most recent (*MARK) that has the same name. If one is found,
2689  for a pattern-based if-then-else block:  the "bumpalong" advance is to the subject position that corresponds to that
2690    (*MARK) instead of to where (*SKIP) was encountered. If no (*MARK) with a
2691    matching name is found, normal "bumpalong" of one character happens (the
2692    (*SKIP) is ignored).
2693    .sp
2694      (*THEN) or (*THEN:NAME)
2695    .sp
2696    This verb causes a skip to the next alternation in the innermost enclosing
2697    group if the rest of the pattern does not match. That is, it cancels pending
2698    backtracking, but only within the current alternation. Its name comes from the
2699    observation that it can be used for a pattern-based if-then-else block:
2700  .sp  .sp
2701    ( COND1 (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ ) ...    ( COND1 (*THEN) FOO | COND2 (*THEN) BAR | COND3 (*THEN) BAZ ) ...
2702  .sp  .sp
2703  If the COND1 pattern matches, FOO is tried (and possibly further items after  If the COND1 pattern matches, FOO is tried (and possibly further items after
2704  the end of the group if FOO succeeds); on failure the matcher skips to the  the end of the group if FOO succeeds); on failure the matcher skips to the
2705  second alternative and tries COND2, without backtracking into COND1. If (*THEN)  second alternative and tries COND2, without backtracking into COND1. The
2706  is used outside of any alternation, it acts exactly like (*PRUNE).  behaviour of (*THEN:NAME) is exactly the same as (*MARK:NAME)(*THEN) if the
2707    overall match fails. If (*THEN) is not directly inside an alternation, it acts
2708    like (*PRUNE).
2709    .
2710    .P
2711    The above verbs provide four different "strengths" of control when subsequent
2712    matching fails. (*THEN) is the weakest, carrying on the match at the next
2713    alternation. (*PRUNE) comes next, failing the match at the current starting
2714    position, but allowing an advance to the next character (for an unanchored
2715    pattern). (*SKIP) is similar, except that the advance may be more than one
2716    character. (*COMMIT) is the strongest, causing the entire match to fail.
2717    .P
2718    If more than one is present in a pattern, the "stongest" one wins. For example,
2719    consider this pattern, where A, B, etc. are complex pattern fragments:
2720    .sp
2721      (A(*COMMIT)B(*THEN)C|D)
2722    .sp
2723    Once A has matched, PCRE is committed to this match, at the current starting
2724    position. If subsequently B matches, but C does not, the normal (*THEN) action
2725    of trying the next alternation (that is, D) does not happen because (*COMMIT)
2726    overrides.
2727  .  .
2728  .  .
2729  .SH "SEE ALSO"  .SH "SEE ALSO"
2730  .rs  .rs
2731  .sp  .sp
2732  \fBpcreapi\fP(3), \fBpcrecallout\fP(3), \fBpcrematching\fP(3), \fBpcre\fP(3).  \fBpcreapi\fP(3), \fBpcrecallout\fP(3), \fBpcrematching\fP(3),
2733    \fBpcresyntax\fP(3), \fBpcre\fP(3).
2734  .  .
2735  .  .
2736  .SH AUTHOR  .SH AUTHOR
# Line 2259  Cambridge CB2 3QH, England. Line 2747  Cambridge CB2 3QH, England.
2747  .rs  .rs
2748  .sp  .sp
2749  .nf  .nf
2750  Last updated: 13 September 2009  Last updated: 21 November 2010
2751  Copyright (c) 1997-2009 University of Cambridge.  Copyright (c) 1997-2010 University of Cambridge.
2752  .fi  .fi

Legend:
Removed from v.445  
changed lines
  Added in v.576

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12