--- code/trunk/doc/html/pcrematching.html 2007/02/24 21:40:45 77 +++ code/trunk/doc/html/pcrematching.html 2007/02/24 21:41:34 91 @@ -54,8 +54,8 @@ as a tree structure. An unlimited repetition in the pattern makes the tree of infinite size, but it is still a tree. Matching the pattern to a given subject string (from a given starting point) can be thought of as a search of the tree. -There are two standard ways to search a tree: depth-first and breadth-first, -and these correspond to the two matching algorithms provided by PCRE. +There are two ways to search a tree: depth-first and breadth-first, and these +correspond to the two matching algorithms provided by PCRE.


THE STANDARD MATCHING ALGORITHM

@@ -184,9 +184,9 @@ does not provide the advantage that it does for the standard algorithm.

-Last updated: 28 February 2005 +Last updated: 06 June 2006
-Copyright © 1997-2005 University of Cambridge. +Copyright © 1997-2006 University of Cambridge.

Return to the PCRE index page.