| 157 |
always 1, and the value of the <i>capture_last</i> field is always -1. |
always 1, and the value of the <i>capture_last</i> field is always -1. |
| 158 |
</P> |
</P> |
| 159 |
<P> |
<P> |
| 160 |
7. |
7. The \C escape sequence, which (in the standard algorithm) matches a single |
|
The \C escape sequence, which (in the standard algorithm) matches a single |
|
| 161 |
byte, even in UTF-8 mode, is not supported because the alternative algorithm |
byte, even in UTF-8 mode, is not supported because the alternative algorithm |
| 162 |
moves through the subject string one character at a time, for all active paths |
moves through the subject string one character at a time, for all active paths |
| 163 |
through the tree. |
through the tree. |
| 164 |
</P> |
</P> |
| 165 |
|
<P> |
| 166 |
|
8. None of the backtracking control verbs such as (*PRUNE) are supported. |
| 167 |
|
</P> |
| 168 |
<br><a name="SEC5" href="#TOC1">ADVANTAGES OF THE ALTERNATIVE ALGORITHM</a><br> |
<br><a name="SEC5" href="#TOC1">ADVANTAGES OF THE ALTERNATIVE ALGORITHM</a><br> |
| 169 |
<P> |
<P> |
| 170 |
Using the alternative matching algorithm provides the following advantages: |
Using the alternative matching algorithm provides the following advantages: |
| 214 |
</P> |
</P> |
| 215 |
<br><a name="SEC8" href="#TOC1">REVISION</a><br> |
<br><a name="SEC8" href="#TOC1">REVISION</a><br> |
| 216 |
<P> |
<P> |
| 217 |
Last updated: 29 May 2007 |
Last updated: 08 August 2007 |
| 218 |
<br> |
<br> |
| 219 |
Copyright © 1997-2007 University of Cambridge. |
Copyright © 1997-2007 University of Cambridge. |
| 220 |
<br> |
<br> |