| 128 |
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 |
| 129 |
no more than 65535 capturing subpatterns. |
no more than 65535 capturing subpatterns. |
| 130 |
.P |
.P |
| 131 |
|
If a non-capturing subpattern with an unlimited repetition quantifier can match |
| 132 |
|
an empty string, there is a limit of 1000 on the number of times it can be |
| 133 |
|
repeated while not matching an empty string - if it does match an empty |
| 134 |
|
string, the loop is immediately broken. |
| 135 |
|
.P |
| 136 |
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 |
| 137 |
maximum number of named subpatterns is 10000. |
maximum number of named subpatterns is 10000. |
| 138 |
.P |
.P |
| 256 |
.rs |
.rs |
| 257 |
.sp |
.sp |
| 258 |
.nf |
.nf |
| 259 |
Last updated: 13 June 2007 |
Last updated: 30 July 2007 |
| 260 |
Copyright (c) 1997-2007 University of Cambridge. |
Copyright (c) 1997-2007 University of Cambridge. |
| 261 |
.fi |
.fi |