54 |
as a tree structure. An unlimited repetition in the pattern makes the tree of |
as a tree structure. An unlimited repetition in the pattern makes the tree of |
55 |
infinite size, but it is still a tree. Matching the pattern to a given subject |
infinite size, but it is still a tree. Matching the pattern to a given subject |
56 |
string (from a given starting point) can be thought of as a search of the tree. |
string (from a given starting point) can be thought of as a search of the tree. |
57 |
There are two standard ways to search a tree: depth-first and breadth-first, |
There are two ways to search a tree: depth-first and breadth-first, and these |
58 |
and these correspond to the two matching algorithms provided by PCRE. |
correspond to the two matching algorithms provided by PCRE. |
59 |
</P> |
</P> |
60 |
<br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br> |
<br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br> |
61 |
<P> |
<P> |
184 |
does not provide the advantage that it does for the standard algorithm. |
does not provide the advantage that it does for the standard algorithm. |
185 |
</P> |
</P> |
186 |
<P> |
<P> |
187 |
Last updated: 28 February 2005 |
Last updated: 06 June 2006 |
188 |
<br> |
<br> |
189 |
Copyright © 1997-2005 University of Cambridge. |
Copyright © 1997-2006 University of Cambridge. |
190 |
<p> |
<p> |
191 |
Return to the <a href="index.html">PCRE index page</a>. |
Return to the <a href="index.html">PCRE index page</a>. |
192 |
</p> |
</p> |