[Emacs-diffs] Changes to emacs/lispref/searching.texi

[Richard M. Stallman]

Index: emacs/lispref/searching.texi
diff -c emacs/lispref/searching.texi:1.43 emacs/lispref/searching.texi:1.44
*** emacs/lispref/searching.texi:1.43   Sat Feb 15 14:27:40 2003
--- emacs/lispref/searching.texi        Mon Feb 24 11:47:27 2003
***************
*** 483,491 ****
  surrounding @samp{\( @dots{} \)} grouping can limit the grouping power of
  @samp{\|address@hidden
  
! Full backtracking capability exists to handle multiple uses of
! @samp{\|}, if you use the POSIX regular expression functions
! (@pxref{POSIX Regexps}).
  
  @item address@hidden@address@hidden
  is a postfix operator that repeats the previous pattern exactly @var{m}
--- 483,491 ----
  surrounding @samp{\( @dots{} \)} grouping can limit the grouping power of
  @samp{\|address@hidden
  
! If you need full backtracking capability to handle multiple uses of
! @samp{\|}, use the POSIX regular expression functions (@pxref{POSIX
! Regexps}).
  
  @item address@hidden@address@hidden
  is a postfix operator that repeats the previous pattern exactly @var{m}
***************
*** 958,963 ****
--- 958,967 ----
  possibilities and found all matches, so they can report the longest
  match, as required by POSIX.  This is much slower, so use these
  functions only when you really need the longest match.
+ 
+   The POSIX search and match functions do not properly support the
+ non-greedy repetition operators.  This is because POSIX backtracking
+ conflicts with the semantics of non-greedy repetition.
  
  @defun posix-search-forward regexp &optional limit noerror repeat
  This is like @code{re-search-forward} except that it performs the full