/[pcre]/code/trunk/doc/pcrepartial.3
ViewVC logotype

Diff of /code/trunk/doc/pcrepartial.3

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 172 by ph10, Tue Jun 5 10:40:13 2007 UTC revision 428 by ph10, Mon Aug 31 17:10:26 2009 UTC
# Line 18  in the form \fIddmmmyy\fP, defined by th Line 18  in the form \fIddmmmyy\fP, defined by th
18  .sp  .sp
19  If the application sees the user's keystrokes one by one, and can check that  If the application sees the user's keystrokes one by one, and can check that
20  what has been typed so far is potentially valid, it is able to raise an error  what has been typed so far is potentially valid, it is able to raise an error
21  as soon as a mistake is made, possibly beeping and not reflecting the  as soon as a mistake is made, by beeping and not reflecting the character that
22  character that has been typed. This immediate feedback is likely to be a better  has been typed, for example. This immediate feedback is likely to be a better
23  user interface than a check that is delayed until the entire string has been  user interface than a check that is delayed until the entire string has been
24  entered.  entered. Partial matching can also sometimes be useful when the subject string
25    is very long and is not all available at once.
26  .P  .P
27  PCRE supports the concept of partial matching by means of the PCRE_PARTIAL  PCRE supports partial matching by means of the PCRE_PARTIAL_SOFT and
28  option, which can be set when calling \fBpcre_exec()\fP or  PCRE_PARTIAL_HARD options, which can be set when calling \fBpcre_exec()\fP or
29  \fBpcre_dfa_exec()\fP. When this flag is set for \fBpcre_exec()\fP, the return  \fBpcre_dfa_exec()\fP. For backwards compatibility, PCRE_PARTIAL is a synonym
30  code PCRE_ERROR_NOMATCH is converted into PCRE_ERROR_PARTIAL if at any time  for PCRE_PARTIAL_SOFT. The essential difference between the two options is
31  during the matching process the last part of the subject string matched part of  whether or not a partial match is preferred to an alternative complete match,
32  the pattern. Unfortunately, for non-anchored matching, it is not possible to  though the details differ between the two matching functions. If both options
33  obtain the position of the start of the partial match. No captured data is set  are set, PCRE_PARTIAL_HARD takes precedence.
 when PCRE_ERROR_PARTIAL is returned.  
34  .P  .P
35  When PCRE_PARTIAL is set for \fBpcre_dfa_exec()\fP, the return code  Setting a partial matching option disables one of PCRE's optimizations. PCRE
36  PCRE_ERROR_NOMATCH is converted into PCRE_ERROR_PARTIAL if the end of the  remembers the last literal byte in a pattern, and abandons matching immediately
37  subject is reached, there have been no complete matches, but there is still at  if such a byte is not present in the subject string. This optimization cannot
38  least one matching possibility. The portion of the string that provided the  be used for a subject string that might match only partially.
 partial match is set as the first matching string.  
 .P  
 Using PCRE_PARTIAL disables one of PCRE's optimizations. PCRE remembers the  
 last literal byte in a pattern, and abandons matching immediately if such a  
 byte is not present in the subject string. This optimization cannot be used  
 for a subject string that might match only partially.  
39  .  .
40  .  .
41  .SH "RESTRICTED PATTERNS FOR PCRE_PARTIAL"  .SH "PARTIAL MATCHING USING pcre_exec()"
42  .rs  .rs
43  .sp  .sp
44  Because of the way certain internal optimizations are implemented in the  A partial match occurs during a call to \fBpcre_exec()\fP whenever the end of
45  \fBpcre_exec()\fP function, the PCRE_PARTIAL option cannot be used with all  the subject string is reached successfully, but matching cannot continue
46  patterns. These restrictions do not apply when \fBpcre_dfa_exec()\fP is used.  because more characters are needed. However, at least one character must have
47  For \fBpcre_exec()\fP, repeated single characters such as  been matched. (In other words, a partial match can never be an empty string.)
48  .sp  .P
49    a{2,4}  If PCRE_PARTIAL_SOFT is set, the partial match is remembered, but matching
50    continues as normal, and other alternatives in the pattern are tried. If no
51    complete match can be found, \fBpcre_exec()\fP returns PCRE_ERROR_PARTIAL
52    instead of PCRE_ERROR_NOMATCH, and if there are at least two slots in the
53    offsets vector, they are filled in with the offsets of the longest string that
54    partially matched. Consider this pattern:
55    .sp
56      /123\ew+X|dogY/
57    .sp
58    If this is matched against the subject string "abc123dog", both
59    alternatives fail to match, but the end of the subject is reached during
60    matching, so PCRE_ERROR_PARTIAL is returned instead of PCRE_ERROR_NOMATCH. The
61    offsets are set to 3 and 9, identifying "123dog" as the longest partial match
62    that was found. (In this example, there are two partial matches, because "dog"
63    on its own partially matches the second alternative.)
64    .P
65    If PCRE_PARTIAL_HARD is set for \fBpcre_exec()\fP, it returns
66    PCRE_ERROR_PARTIAL as soon as a partial match is found, without continuing to
67    search for possible complete matches. The difference between the two options
68    can be illustrated by a pattern such as:
69    .sp
70      /dog(sbody)?/
71    .sp
72    This matches either "dog" or "dogsbody", greedily (that is, it prefers the
73    longer string if possible). If it is matched against the string "dog" with
74    PCRE_PARTIAL_SOFT, it yields a complete match for "dog". However, if
75    PCRE_PARTIAL_HARD is set, the result is PCRE_ERROR_PARTIAL. On the other hand,
76    if the pattern is made ungreedy the result is different:
77    .sp
78      /dog(sbody)??/
79    .sp
80    In this case the result is always a complete match because \fBpcre_exec()\fP
81    finds that first, and it never continues after finding a match. It might be
82    easier to follow this explanation by thinking of the two patterns like this:
83  .sp  .sp
84  and repeated single metasequences such as    /dog(sbody)?/    is the same as  /dogsbody|dog/
85      /dog(sbody)??/   is the same as  /dog|dogsbody/
86  .sp  .sp
87    \ed+  The second pattern will never match "dogsbody" when \fBpcre_exec()\fP is
88    used, because it will always find the shorter match first.
89    .
90    .
91    .SH "PARTIAL MATCHING USING pcre_dfa_exec()"
92    .rs
93  .sp  .sp
94  are not permitted if the maximum number of occurrences is greater than one.  The \fBpcre_dfa_exec()\fP function moves along the subject string character by
95  Optional items such as \ed? (where the maximum is one) are permitted.  character, without backtracking, searching for all possible matches
96  Quantifiers with any values are permitted after parentheses, so the invalid  simultaneously. If the end of the subject is reached before the end of the
97  examples above can be coded thus:  pattern, there is the possibility of a partial match, again provided that at
98    least one character has matched.
99    .P
100    When PCRE_PARTIAL_SOFT is set, PCRE_ERROR_PARTIAL is returned only if there
101    have been no complete matches. Otherwise, the complete matches are returned.
102    However, if PCRE_PARTIAL_HARD is set, a partial match takes precedence over any
103    complete matches. The portion of the string that provided the longest partial
104    match is set as the first matching string, provided there are at least two
105    slots in the offsets vector.
106    .P
107    Because \fBpcre_dfa_exec()\fP always searches for all possible matches, and
108    there is no difference between greedy and ungreedy repetition, its behaviour is
109    different from \fBpcre_exec\fP when PCRE_PARTIAL_HARD is set. Consider the
110    string "dog" matched against the ungreedy pattern shown above:
111    .sp
112      /dog(sbody)??/
113    .sp
114    Whereas \fBpcre_exec()\fP stops as soon as it finds the complete match for
115    "dog", \fBpcre_dfa_exec()\fP also finds the partial match for "dogsbody", and
116    so returns that when PCRE_PARTIAL_HARD is set.
117    .
118    .
119    .SH "PARTIAL MATCHING AND WORD BOUNDARIES"
120    .rs
121  .sp  .sp
122    (a){2,4}  If a pattern ends with one of sequences \ew or \eW, which test for word
123    (\ed)+  boundaries, partial matching with PCRE_PARTIAL_SOFT can give counter-intuitive
124    results. Consider this pattern:
125    .sp
126      /\ebcat\eb/
127    .sp
128    This matches "cat", provided there is a word boundary at either end. If the
129    subject string is "the cat", the comparison of the final "t" with a following
130    character cannot take place, so a partial match is found. However,
131    \fBpcre_exec()\fP carries on with normal matching, which matches \eb at the end
132    of the subject when the last character is a letter, thus finding a complete
133    match. The result, therefore, is \fInot\fP PCRE_ERROR_PARTIAL. The same thing
134    happens with \fBpcre_dfa_exec()\fP, because it also finds the complete match.
135    .P
136    Using PCRE_PARTIAL_HARD in this case does yield PCRE_ERROR_PARTIAL, because
137    then the partial match takes precedence.
138    .
139    .
140    .SH "FORMERLY RESTRICTED PATTERNS"
141    .rs
142  .sp  .sp
143  These constructions run more slowly, but for the kinds of application that are  For releases of PCRE prior to 8.00, because of the way certain internal
144  envisaged for this facility, this is not felt to be a major restriction.  optimizations were implemented in the \fBpcre_exec()\fP function, the
145    PCRE_PARTIAL option (predecessor of PCRE_PARTIAL_SOFT) could not be used with
146    all patterns. From release 8.00 onwards, the restrictions no longer apply, and
147    partial matching with \fBpcre_exec()\fP can be requested for any pattern.
148  .P  .P
149  If PCRE_PARTIAL is set for a pattern that does not conform to the restrictions,  Items that were formerly restricted were repeated single characters and
150  \fBpcre_exec()\fP returns the error code PCRE_ERROR_BADPARTIAL (-13).  repeated metasequences. If PCRE_PARTIAL was set for a pattern that did not
151  You can use the PCRE_INFO_OKPARTIAL call to \fBpcre_fullinfo()\fP to find out  conform to the restrictions, \fBpcre_exec()\fP returned the error code
152  if a compiled pattern can be used for partial matching.  PCRE_ERROR_BADPARTIAL (-13). This error code is no longer in use. The
153    PCRE_INFO_OKPARTIAL call to \fBpcre_fullinfo()\fP to find out if a compiled
154    pattern can be used for partial matching now always returns 1.
155  .  .
156  .  .
157  .SH "EXAMPLE OF PARTIAL MATCHING USING PCRETEST"  .SH "EXAMPLE OF PARTIAL MATCHING USING PCRETEST"
158  .rs  .rs
159  .sp  .sp
160  If the escape sequence \eP is present in a \fBpcretest\fP data line, the  If the escape sequence \eP is present in a \fBpcretest\fP data line, the
161  PCRE_PARTIAL flag is used for the match. Here is a run of \fBpcretest\fP that  PCRE_PARTIAL_SOFT option is used for the match. Here is a run of \fBpcretest\fP
162  uses the date example quoted above:  that uses the date example quoted above:
163  .sp  .sp
164      re> /^\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed$/      re> /^\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed$/
165    data> 25jun04\eP    data> 25jun04\eP
166     0: 25jun04     0: 25jun04
167     1: jun     1: jun
168    data> 25dec3\eP    data> 25dec3\eP
169    Partial match    Partial match: 23dec3
170    data> 3ju\eP    data> 3ju\eP
171    Partial match    Partial match: 3ju
172    data> 3juj\eP    data> 3juj\eP
173    No match    No match
174    data> j\eP    data> j\eP
# Line 97  uses the date example quoted above: Line 176  uses the date example quoted above:
176  .sp  .sp
177  The first data string is matched completely, so \fBpcretest\fP shows the  The first data string is matched completely, so \fBpcretest\fP shows the
178  matched substrings. The remaining four strings do not match the complete  matched substrings. The remaining four strings do not match the complete
179  pattern, but the first two are partial matches. The same test, using  pattern, but the first two are partial matches. Similar output is obtained
180  \fBpcre_dfa_exec()\fP matching (by means of the \eD escape sequence), produces  when \fBpcre_dfa_exec()\fP is used.
181  the following output:  .P
182  .sp  If the escape sequence \eP is present more than once in a \fBpcretest\fP data
183      re> /^\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed$/  line, the PCRE_PARTIAL_HARD option is set for the match.
   data> 25jun04\eP\eD  
    0: 25jun04  
   data> 23dec3\eP\eD  
   Partial match: 23dec3  
   data> 3ju\eP\eD  
   Partial match: 3ju  
   data> 3juj\eP\eD  
   No match  
   data> j\eP\eD  
   No match  
 .sp  
 Notice that in this case the portion of the string that was matched is made  
 available.  
 .  
184  .  .
185    .
186  .SH "MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()"  .SH "MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()"
187  .rs  .rs
188  .sp  .sp
189  When a partial match has been found using \fBpcre_dfa_exec()\fP, it is possible  When a partial match has been found using \fBpcre_dfa_exec()\fP, it is possible
190  to continue the match by providing additional subject data and calling  to continue the match by providing additional subject data and calling
191  \fBpcre_dfa_exec()\fP again with the same compiled regular expression, this  \fBpcre_dfa_exec()\fP again with the same compiled regular expression, this
192  time setting the PCRE_DFA_RESTART option. You must also pass the same working  time setting the PCRE_DFA_RESTART option. You must pass the same working
193  space as before, because this is where details of the previous partial match  space as before, because this is where details of the previous partial match
194  are stored. Here is an example using \fBpcretest\fP, using the \eR escape  are stored. Here is an example using \fBpcretest\fP, using the \eR escape
195  sequence to set the PCRE_DFA_RESTART option (\eP and \eD are as above):  sequence to set the PCRE_DFA_RESTART option (\eD specifies the use of
196    \fBpcre_dfa_exec()\fP):
197  .sp  .sp
198      re> /^\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed$/      re> /^\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed$/
199    data> 23ja\eP\eD    data> 23ja\eP\eD
# Line 140  Notice that when the match is complete, Line 207  Notice that when the match is complete,
207  not retain the previously partially-matched string. It is up to the calling  not retain the previously partially-matched string. It is up to the calling
208  program to do that if it needs to.  program to do that if it needs to.
209  .P  .P
210  You can set PCRE_PARTIAL with PCRE_DFA_RESTART to continue partial matching  You can set the PCRE_PARTIAL_SOFT or PCRE_PARTIAL_HARD options with
211  over multiple segments. This facility can be used to pass very long subject  PCRE_DFA_RESTART to continue partial matching over multiple segments. This
212  strings to \fBpcre_dfa_exec()\fP. However, some care is needed for certain  facility can be used to pass very long subject strings to
213  types of pattern.  \fBpcre_dfa_exec()\fP.
214    .
215    .
216    .SH "MULTI-SEGMENT MATCHING WITH pcre_exec()"
217    .rs
218    .sp
219    From release 8.00, \fBpcre_exec()\fP can also be used to do multi-segment
220    matching. Unlike \fBpcre_dfa_exec()\fP, it is not possible to restart the
221    previous match with a new segment of data. Instead, new data must be added to
222    the previous subject string, and the entire match re-run, starting from the
223    point where the partial match occurred. Earlier data can be discarded.
224    Consider an unanchored pattern that matches dates:
225    .sp
226        re> /\ed?\ed(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\ed\ed/
227      data> The date is 23ja\eP
228      Partial match: 23ja
229    .sp
230    The this stage, an application could discard the text preceding "23ja", add on
231    text from the next segment, and call \fBpcre_exec()\fP again. Unlike
232    \fBpcre_dfa_exec()\fP, the entire matching string must always be available, and
233    the complete matching process occurs for each call, so more memory and more
234    processing time is needed.
235    .
236    .
237    .SH "ISSUES WITH MULTI-SEGMENT MATCHING"
238    .rs
239    .sp
240    Certain types of pattern may give problems with multi-segment matching,
241    whichever matching function is used.
242  .P  .P
243  1. If the pattern contains tests for the beginning or end of a line, you need  1. If the pattern contains tests for the beginning or end of a line, you need
244  to pass the PCRE_NOTBOL or PCRE_NOTEOL options, as appropriate, when the  to pass the PCRE_NOTBOL or PCRE_NOTEOL options, as appropriate, when the
245  subject string for any call does not contain the beginning or end of a line.  subject string for any call does not contain the beginning or end of a line.
246  .P  .P
247  2. If the pattern contains backward assertions (including \eb or \eB), you need  2. If the pattern contains backward assertions (including \eb or \eB), you need
248  to arrange for some overlap in the subject strings to allow for this. For  to arrange for some overlap in the subject strings to allow for them to be
249  example, you could pass the subject in chunks that are 500 bytes long, but in  correctly tested at the start of each substring. For example, using
250  a buffer of 700 bytes, with the starting offset set to 200 and the previous 200  \fBpcre_dfa_exec()\fP, you could pass the subject in chunks that are 500 bytes
251  bytes at the start of the buffer.  long, but in a buffer of 700 bytes, with the starting offset set to 200 and the
252  .P  previous 200 bytes at the start of the buffer.
253  3. Matching a subject string that is split into multiple segments does not  .P
254  always produce exactly the same result as matching over one single long string.  3. Matching a subject string that is split into multiple segments may not
255  The difference arises when there are multiple matching possibilities, because a  always produce exactly the same result as matching over one single long string,
256  partial match result is given only when there are no completed matches in a  especially when PCRE_PARTIAL_SOFT is used. The section "Partial Matching and
257  call to \fBpcre_dfa_exec()\fP. This means that as soon as the shortest match has  Word Boundaries" above describes an issue that arises if the pattern ends with
258    \eb or \eB. Another kind of difference may occur when there are multiple
259    matching possibilities, because a partial match result is given only when there
260    are no completed matches. This means that as soon as the shortest match has
261  been found, continuation to a new subject segment is no longer possible.  been found, continuation to a new subject segment is no longer possible.
262  Consider this \fBpcretest\fP example:  Consider again this \fBpcretest\fP example:
263  .sp  .sp
264      re> /dog(sbody)?/      re> /dog(sbody)?/
265      data> dogsb\eP
266       0: dog
267    data> do\eP\eD    data> do\eP\eD
268    Partial match: do    Partial match: do
269    data> gsb\eR\eP\eD    data> gsb\eR\eP\eD
# Line 172  Consider this \fBpcretest\fP example: Line 272  Consider this \fBpcretest\fP example:
272     0: dogsbody     0: dogsbody
273     1: dog     1: dog
274  .sp  .sp
275  The pattern matches the words "dog" or "dogsbody". When the subject is  The first data line passes the string "dogsb" to \fBpcre_exec()\fP, setting the
276  presented in several parts ("do" and "gsb" being the first two) the match stops  PCRE_PARTIAL_SOFT option. Although the string is a partial match for
277  when "dog" has been found, and it is not possible to continue. On the other  "dogsbody", the result is not PCRE_ERROR_PARTIAL, because the shorter string
278  hand, if "dogsbody" is presented as a single string, both matches are found.  "dog" is a complete match. Similarly, when the subject is presented to
279    \fBpcre_dfa_exec()\fP in several parts ("do" and "gsb" being the first two) the
280    match stops when "dog" has been found, and it is not possible to continue. On
281    the other hand, if "dogsbody" is presented as a single string,
282    \fBpcre_dfa_exec()\fP finds both matches.
283  .P  .P
284  Because of this phenomenon, it does not usually make sense to end a pattern  Because of these problems, it is probably best to use PCRE_PARTIAL_HARD when
285  that is going to be matched in this way with a variable repeat.  matching multi-segment data. The example above then behaves differently:
286    .sp
287        re> /dog(sbody)?/
288      data> dogsb\eP\eP
289      Partial match: dogsb
290      data> do\eP\eD
291      Partial match: do
292      data> gsb\eR\eP\eP\eD
293      Partial match: gsb
294    .sp
295  .P  .P
296  4. Patterns that contain alternatives at the top level which do not all  4. Patterns that contain alternatives at the top level which do not all
297  start with the same pattern item may not work as expected. For example,  start with the same pattern item may not work as expected when
298  consider this pattern:  \fBpcre_dfa_exec()\fP is used. For example, consider this pattern:
299  .sp  .sp
300    1234|3789    1234|3789
301  .sp  .sp
302  If the first part of the subject is "ABC123", a partial match of the first  If the first part of the subject is "ABC123", a partial match of the first
303  alternative is found at offset 3. There is no partial match for the second  alternative is found at offset 3. There is no partial match for the second
304  alternative, because such a match does not start at the same point in the  alternative, because such a match does not start at the same point in the
305  subject string. Attempting to continue with the string "789" does not yield a  subject string. Attempting to continue with the string "7890" does not yield a
306  match because only those alternatives that match at one point in the subject  match because only those alternatives that match at one point in the subject
307  are remembered. The problem arises because the start of the second alternative  are remembered. The problem arises because the start of the second alternative
308  matches within the first alternative. There is no problem with anchored  matches within the first alternative. There is no problem with anchored
# Line 197  patterns or patterns such as: Line 310  patterns or patterns such as:
310  .sp  .sp
311    1234|ABCD    1234|ABCD
312  .sp  .sp
313  where no string can be a partial match for both alternatives.  where no string can be a partial match for both alternatives. This is not a
314    problem if \fPpcre_exec()\fP is used, because the entire match has to be rerun
315    each time:
316    .sp
317        re> /1234|3789/
318      data> ABC123\eP
319      Partial match: 123
320      data> 1237890
321       0: 3789
322    .sp
323  .  .
324  .  .
325  .SH AUTHOR  .SH AUTHOR
# Line 214  Cambridge CB2 3QH, England. Line 336  Cambridge CB2 3QH, England.
336  .rs  .rs
337  .sp  .sp
338  .nf  .nf
339  Last updated: 04 June 2007  Last updated: 31 August 2009
340  Copyright (c) 1997-2007 University of Cambridge.  Copyright (c) 1997-2009 University of Cambridge.
341  .fi  .fi

Legend:
Removed from v.172  
changed lines
  Added in v.428

  ViewVC Help
Powered by ViewVC 1.1.5