Diff for /embedaddon/pcre/doc/pcrematching.3 between versions 1.1.1.4 and 1.1.1.5

version 1.1.1.4, 2013/07/22 08:25:56 version 1.1.1.5, 2014/06/15 19:46:05
Line 1 Line 1
.TH PCREMATCHING 3 "08 January 2012" "PCRE 8.30".TH PCREMATCHING 3 "12 November 2013" "PCRE 8.34"
 .SH NAME  .SH NAME
 PCRE - Perl-compatible regular expressions  PCRE - Perl-compatible regular expressions
 .SH "PCRE MATCHING ALGORITHMS"  .SH "PCRE MATCHING ALGORITHMS"
Line 106  the three strings "caterpillar", "cater", and "cat" th Line 106  the three strings "caterpillar", "cater", and "cat" th
 character of the subject. The algorithm does not automatically move on to find  character of the subject. The algorithm does not automatically move on to find
 matches that start at later positions.  matches that start at later positions.
 .P  .P
   PCRE's "auto-possessification" optimization usually applies to character
   repeats at the end of a pattern (as well as internally). For example, the
   pattern "a\ed+" is compiled as if it were "a\ed++" because there is no point
   even considering the possibility of backtracking into the repeated digits. For
   DFA matching, this means that only one possible match is found. If you really
   do want multiple matches in such cases, either use an ungreedy repeat
   ("a\ed+?") or set the PCRE_NO_AUTO_POSSESS option when compiling.
   .P
 There are a number of features of PCRE regular expressions that are not  There are a number of features of PCRE regular expressions that are not
 supported by the alternative matching algorithm. They are as follows:  supported by the alternative matching algorithm. They are as follows:
 .P  .P
Line 201  Cambridge CB2 3QH, England. Line 209  Cambridge CB2 3QH, England.
 .rs  .rs
 .sp  .sp
 .nf  .nf
Last updated: 08 January 2012Last updated: 12 November 2013
 Copyright (c) 1997-2012 University of Cambridge.  Copyright (c) 1997-2012 University of Cambridge.
 .fi  .fi

Removed from v.1.1.1.4  
changed lines
  Added in v.1.1.1.5


FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>