--- code/trunk/doc/html/pcregrep.html 2010/12/10 11:41:01 582 +++ code/trunk/doc/html/pcregrep.html 2011/01/11 16:49:55 583 @@ -379,7 +379,7 @@ large number of possibilities in their search trees. The classic example is a pattern that uses nested unlimited repeats. Internally, PCRE uses a function called match() which it calls repeatedly (sometimes recursively). The -limit set by \fb--match-limit\fP is imposed on the number of times this +limit set by --match-limit is imposed on the number of times this function is called during a match, which has the effect of limiting the amount of backtracking that can take place.