feedc0de/boost_regex
1
0
Fork 0
forked from boostorg/regex
Code Pull Requests Activity

Initial commit of quickbook conversion of docs.

Browse Source 
[SVN r37942]
This commit is contained in:
John Maddock
2007-06-08 09:13:34 +00:00
parent f4877f6698
commit 5f96b68080
52 changed files with 8859 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
doc/leftmost_longest.qbk Normal file
View File

@ -0,0 +1,24 @@
[section:leftmost_longest_rule The Leftmost Longest Rule]
Often there is more than one way of matching a regular expression at a
particular location, for POSIX basic and extended regular expressions,
the "best" match is determined as follows:
# Find the leftmost match, if there is only one match possible at
this location then return it.
# Find the longest of the possible matches, along with any ties.
If there is only one such possible match then return it.
# If there are no marked sub-expressions, then all the remaining
alternatives are indistinguishable; return the first of these found.
# Find the match which has matched the first sub-expression in the
leftmost position, along with any ties. If there is only on such
match possible then return it.
# Find the match which has the longest match for the first sub-expression,
along with any ties. If there is only one such match then return it.
# Repeat steps 4 and 5 for each additional marked sub-expression.
# If there is still more than one possible match remaining, then they are
indistinguishable; return the first one found.
[endsect]