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

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

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

revision 79 by nigel, Sat Feb 24 21:40:52 2007 UTC revision 91 by nigel, Sat Feb 24 21:41:34 2007 UTC
# Line 35  The set of strings that are matched by a Line 35  The set of strings that are matched by a
35  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
36  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
37  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.
38  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
39  and these correspond to the two matching algorithms provided by PCRE.  correspond to the two matching algorithms provided by PCRE.
40  .  .
41  .SH "THE STANDARD MATCHING ALGORITHM"  .SH "THE STANDARD MATCHING ALGORITHM"
42  .rs  .rs
# Line 152  less susceptible to optimization. Line 152  less susceptible to optimization.
152  does not provide the advantage that it does for the standard algorithm.  does not provide the advantage that it does for the standard algorithm.
153  .P  .P
154  .in 0  .in 0
155  Last updated: 28 February 2005  Last updated: 06 June 2006
156  .br  .br
157  Copyright (c) 1997-2005 University of Cambridge.  Copyright (c) 1997-2006 University of Cambridge.
Legend:
Removed from v.79  
changed lines
  Added in v.91
  ViewVC Help
Powered by ViewVC 1.1.5