/[pcre]/code/trunk/doc/html/pcrematching.html
ViewVC logotype

Diff of /code/trunk/doc/html/pcrematching.html

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

revision 96 by nigel, Fri Mar 2 13:10:43 2007 UTC revision 148 by ph10, Mon Apr 16 13:25:10 2007 UTC
# Line 19  man page, in case the conversion went wr Line 19  man page, in case the conversion went wr
19  <li><a name="TOC4" href="#SEC4">THE ALTERNATIVE MATCHING ALGORITHM</a>  <li><a name="TOC4" href="#SEC4">THE ALTERNATIVE MATCHING ALGORITHM</a>
20  <li><a name="TOC5" href="#SEC5">ADVANTAGES OF THE ALTERNATIVE ALGORITHM</a>  <li><a name="TOC5" href="#SEC5">ADVANTAGES OF THE ALTERNATIVE ALGORITHM</a>
21  <li><a name="TOC6" href="#SEC6">DISADVANTAGES OF THE ALTERNATIVE ALGORITHM</a>  <li><a name="TOC6" href="#SEC6">DISADVANTAGES OF THE ALTERNATIVE ALGORITHM</a>
22    <li><a name="TOC7" href="#SEC7">AUTHOR</a>
23    <li><a name="TOC8" href="#SEC8">REVISION</a>
24  </ul>  </ul>
25  <br><a name="SEC1" href="#TOC1">PCRE MATCHING ALGORITHMS</a><br>  <br><a name="SEC1" href="#TOC1">PCRE MATCHING ALGORITHMS</a><br>
26  <P>  <P>
# Line 59  correspond to the two matching algorithm Line 61  correspond to the two matching algorithm
61  </P>  </P>
62  <br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br>  <br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br>
63  <P>  <P>
64  In the terminology of Jeffrey Friedl's book \fIMastering Regular  In the terminology of Jeffrey Friedl's book "Mastering Regular
65  Expressions\fP, the standard algorithm is an "NFA algorithm". It conducts a  Expressions", the standard algorithm is an "NFA algorithm". It conducts a
66  depth-first search of the pattern tree. That is, it proceeds along a single  depth-first search of the pattern tree. That is, it proceeds along a single
67  path through the tree, checking that the subject matches what is required. When  path through the tree, checking that the subject matches what is required. When
68  there is a mismatch, the algorithm tries any alternatives at the current point,  there is a mismatch, the algorithm tries any alternatives at the current point,
# Line 194  less susceptible to optimization. Line 196  less susceptible to optimization.
196  3. Although atomic groups are supported, their use does not provide the  3. Although atomic groups are supported, their use does not provide the
197  performance advantage that it does for the standard algorithm.  performance advantage that it does for the standard algorithm.
198  </P>  </P>
199    <br><a name="SEC7" href="#TOC1">AUTHOR</a><br>
200  <P>  <P>
201  Last updated: 24 November 2006  Philip Hazel
202    <br>
203    University Computing Service
204    <br>
205    Cambridge CB2 3QH, England.
206    <br>
207    </P>
208    <br><a name="SEC8" href="#TOC1">REVISION</a><br>
209    <P>
210    Last updated: 06 March 2007
211    <br>
212    Copyright &copy; 1997-2007 University of Cambridge.
213  <br>  <br>
 Copyright &copy; 1997-2006 University of Cambridge.  
214  <p>  <p>
215  Return to the <a href="index.html">PCRE index page</a>.  Return to the <a href="index.html">PCRE index page</a>.
216  </p>  </p>

Legend:
Removed from v.96  
changed lines
  Added in v.148

  ViewVC Help
Powered by ViewVC 1.1.5