| 58 |
<a href="pcrepattern.html"><b>pcrepattern</b></a> |
<a href="pcrepattern.html"><b>pcrepattern</b></a> |
| 59 |
and |
and |
| 60 |
<a href="pcrecompat.html"><b>pcrecompat</b></a> |
<a href="pcrecompat.html"><b>pcrecompat</b></a> |
| 61 |
pages. |
pages. There is a syntax summary in the |
| 62 |
|
<a href="pcresyntax.html"><b>pcresyntax</b></a> |
| 63 |
|
page. |
| 64 |
</P> |
</P> |
| 65 |
<P> |
<P> |
| 66 |
Some features of PCRE can be included, excluded, or changed when the library is |
Some features of PCRE can be included, excluded, or changed when the library is |
| 100 |
pcrematching discussion of the two matching algorithms |
pcrematching discussion of the two matching algorithms |
| 101 |
pcrepartial details of the partial matching facility |
pcrepartial details of the partial matching facility |
| 102 |
pcrepattern syntax and semantics of supported regular expressions |
pcrepattern syntax and semantics of supported regular expressions |
| 103 |
|
pcresyntax quick syntax reference |
| 104 |
pcreperform discussion of performance issues |
pcreperform discussion of performance issues |
| 105 |
pcreposix the POSIX-compatible C API |
pcreposix the POSIX-compatible C API |
| 106 |
pcreprecompile details of saving and re-using precompiled patterns |
pcreprecompile details of saving and re-using precompiled patterns |
| 127 |
However, the speed of execution is slower. |
However, the speed of execution is slower. |
| 128 |
</P> |
</P> |
| 129 |
<P> |
<P> |
| 130 |
All values in repeating quantifiers must be less than 65536. The maximum |
All values in repeating quantifiers must be less than 65536. |
|
compiled length of subpattern with an explicit repeat count is 30000 bytes. The |
|
|
maximum number of capturing subpatterns is 65535. |
|
| 131 |
</P> |
</P> |
| 132 |
<P> |
<P> |
| 133 |
There is no limit to the number of parenthesized subpatterns, but there can be |
There is no limit to the number of parenthesized subpatterns, but there can be |
| 134 |
no more than 65535 capturing subpatterns. |
no more than 65535 capturing subpatterns. |
| 135 |
</P> |
</P> |
| 136 |
<P> |
<P> |
|
If a non-capturing subpattern with an unlimited repetition quantifier can match |
|
|
an empty string, there is a limit of 1000 on the number of times it can be |
|
|
repeated while not matching an empty string - if it does match an empty |
|
|
string, the loop is immediately broken. |
|
|
</P> |
|
|
<P> |
|
| 137 |
The maximum length of name for a named subpattern is 32 characters, and the |
The maximum length of name for a named subpattern is 32 characters, and the |
| 138 |
maximum number of named subpatterns is 10000. |
maximum number of named subpatterns is 10000. |
| 139 |
</P> |
</P> |
| 259 |
</P> |
</P> |
| 260 |
<br><a name="SEC6" href="#TOC1">REVISION</a><br> |
<br><a name="SEC6" href="#TOC1">REVISION</a><br> |
| 261 |
<P> |
<P> |
| 262 |
Last updated: 30 July 2007 |
Last updated: 06 August 2007 |
| 263 |
<br> |
<br> |
| 264 |
Copyright © 1997-2007 University of Cambridge. |
Copyright © 1997-2007 University of Cambridge. |
| 265 |
<br> |
<br> |