--- code/trunk/pcre.3	2007/02/24 21:38:05	5
+++ code/trunk/pcre.3	2007/02/24 21:38:25	15
@@ -8,12 +8,12 @@
 .br
 .B pcre *pcre_compile(const char *\fIpattern\fR, int \fIoptions\fR,
 .ti +5n
-.B char **\fIerrptr\fR, int *\fIerroffset\fR);
+.B const char **\fIerrptr\fR, int *\fIerroffset\fR);
 .PP
 .br
 .B pcre_extra *pcre_study(const pcre *\fIcode\fR, int \fIoptions\fR,
 .ti +5n
-.B char **\fIerrptr\fR);
+.B const char **\fIerrptr\fR);
 .PP
 .br
 .B int pcre_exec(const pcre *\fIcode\fR, "const pcre_extra *\fIextra\fR,"
@@ -603,8 +603,8 @@
 
   .*/foo
 
-is matched against the string "/foo/this/is/not" then after the initial greedy
-.* has swallowed the whole string, it keeps backtracking right the way to the
+is matched against the string "/this/string/is/not" then after the greedy .*
+has swallowed the whole string, PCRE keeps backtracking all the way to the
 beginning before failing. If, on the other hand, the expression is
 
   .*/\\Xfoo
@@ -866,7 +866,7 @@
 which matches one digit by preference, but can match two if that is the only
 way the rest of the pattern matches.
 
-When a parenthesized subpattern is quantified a with minimum repeat count that
+When a parenthesized subpattern is quantified with a minimum repeat count that
 is greater than 1 or with a limited maximum, more store is required for the
 compiled pattern, in proportion to the size of the minimum or maximum.
 
@@ -1014,4 +1014,4 @@
 .br
 Phone: +44 1223 334714
 
-Copyright (c) 1997 University of Cambridge.
+Copyright (c) 1998 University of Cambridge.