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

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

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

revision 172 by ph10, Tue Jun 5 10:40:13 2007 UTC revision 429 by ph10, Tue Sep 1 16:10:16 2009 UTC
# Line 14  man page, in case the conversion went wr Line 14  man page, in case the conversion went wr
14  <br>  <br>
15  <ul>  <ul>
16  <li><a name="TOC1" href="#SEC1">PARTIAL MATCHING IN PCRE</a>  <li><a name="TOC1" href="#SEC1">PARTIAL MATCHING IN PCRE</a>
17  <li><a name="TOC2" href="#SEC2">RESTRICTED PATTERNS FOR PCRE_PARTIAL</a>  <li><a name="TOC2" href="#SEC2">PARTIAL MATCHING USING pcre_exec()</a>
18  <li><a name="TOC3" href="#SEC3">EXAMPLE OF PARTIAL MATCHING USING PCRETEST</a>  <li><a name="TOC3" href="#SEC3">PARTIAL MATCHING USING pcre_dfa_exec()</a>
19  <li><a name="TOC4" href="#SEC4">MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()</a>  <li><a name="TOC4" href="#SEC4">PARTIAL MATCHING AND WORD BOUNDARIES</a>
20  <li><a name="TOC5" href="#SEC5">AUTHOR</a>  <li><a name="TOC5" href="#SEC5">FORMERLY RESTRICTED PATTERNS</a>
21  <li><a name="TOC6" href="#SEC6">REVISION</a>  <li><a name="TOC6" href="#SEC6">EXAMPLE OF PARTIAL MATCHING USING PCRETEST</a>
22    <li><a name="TOC7" href="#SEC7">MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()</a>
23    <li><a name="TOC8" href="#SEC8">MULTI-SEGMENT MATCHING WITH pcre_exec()</a>
24    <li><a name="TOC9" href="#SEC9">ISSUES WITH MULTI-SEGMENT MATCHING</a>
25    <li><a name="TOC10" href="#SEC10">AUTHOR</a>
26    <li><a name="TOC11" href="#SEC11">REVISION</a>
27  </ul>  </ul>
28  <br><a name="SEC1" href="#TOC1">PARTIAL MATCHING IN PCRE</a><br>  <br><a name="SEC1" href="#TOC1">PARTIAL MATCHING IN PCRE</a><br>
29  <P>  <P>
# Line 37  in the form <i>ddmmmyy</i>, defined by t Line 42  in the form <i>ddmmmyy</i>, defined by t
42  </pre>  </pre>
43  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
44  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
45  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
46  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
47  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
48  entered.  entered. Partial matching can also sometimes be useful when the subject string
49    is very long and is not all available at once.
50  </P>  </P>
51  <P>  <P>
52  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
53  option, which can be set when calling <b>pcre_exec()</b> or  PCRE_PARTIAL_HARD options, which can be set when calling <b>pcre_exec()</b> or
54  <b>pcre_dfa_exec()</b>. When this flag is set for <b>pcre_exec()</b>, the return  <b>pcre_dfa_exec()</b>. For backwards compatibility, PCRE_PARTIAL is a synonym
55  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
56  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,
57  the pattern. Unfortunately, for non-anchored matching, it is not possible to  though the details differ between the two matching functions. If both options
58  obtain the position of the start of the partial match. No captured data is set  are set, PCRE_PARTIAL_HARD takes precedence.
59  when PCRE_ERROR_PARTIAL is returned.  </P>
60  </P>  <P>
61  <P>  Setting a partial matching option disables one of PCRE's optimizations. PCRE
62  When PCRE_PARTIAL is set for <b>pcre_dfa_exec()</b>, the return code  remembers the last literal byte in a pattern, and abandons matching immediately
63  PCRE_ERROR_NOMATCH is converted into PCRE_ERROR_PARTIAL if the end of the  if such a byte is not present in the subject string. This optimization cannot
64  subject is reached, there have been no complete matches, but there is still at  be used for a subject string that might match only partially.
65  least one matching possibility. The portion of the string that provided the  </P>
66  partial match is set as the first matching string.  <br><a name="SEC2" href="#TOC1">PARTIAL MATCHING USING pcre_exec()</a><br>
67  </P>  <P>
68  <P>  A partial match occurs during a call to <b>pcre_exec()</b> whenever the end of
69  Using PCRE_PARTIAL disables one of PCRE's optimizations. PCRE remembers the  the subject string is reached successfully, but matching cannot continue
70  last literal byte in a pattern, and abandons matching immediately if such a  because more characters are needed. However, at least one character must have
71  byte is not present in the subject string. This optimization cannot be used  been matched. (In other words, a partial match can never be an empty string.)
72  for a subject string that might match only partially.  </P>
73    <P>
74    If PCRE_PARTIAL_SOFT is set, the partial match is remembered, but matching
75    continues as normal, and other alternatives in the pattern are tried. If no
76    complete match can be found, <b>pcre_exec()</b> returns PCRE_ERROR_PARTIAL
77    instead of PCRE_ERROR_NOMATCH, and if there are at least two slots in the
78    offsets vector, they are filled in with the offsets of the longest string that
79    partially matched. Consider this pattern:
80    <pre>
81      /123\w+X|dogY/
82    </pre>
83    If this is matched against the subject string "abc123dog", both
84    alternatives fail to match, but the end of the subject is reached during
85    matching, so PCRE_ERROR_PARTIAL is returned instead of PCRE_ERROR_NOMATCH. The
86    offsets are set to 3 and 9, identifying "123dog" as the longest partial match
87    that was found. (In this example, there are two partial matches, because "dog"
88    on its own partially matches the second alternative.)
89  </P>  </P>
 <br><a name="SEC2" href="#TOC1">RESTRICTED PATTERNS FOR PCRE_PARTIAL</a><br>  
90  <P>  <P>
91  Because of the way certain internal optimizations are implemented in the  If PCRE_PARTIAL_HARD is set for <b>pcre_exec()</b>, it returns
92  <b>pcre_exec()</b> function, the PCRE_PARTIAL option cannot be used with all  PCRE_ERROR_PARTIAL as soon as a partial match is found, without continuing to
93  patterns. These restrictions do not apply when <b>pcre_dfa_exec()</b> is used.  search for possible complete matches. The difference between the two options
94  For <b>pcre_exec()</b>, repeated single characters such as  can be illustrated by a pattern such as:
95  <pre>  <pre>
96    a{2,4}    /dog(sbody)?/
97  </pre>  </pre>
98  and repeated single metasequences such as  This matches either "dog" or "dogsbody", greedily (that is, it prefers the
99    longer string if possible). If it is matched against the string "dog" with
100    PCRE_PARTIAL_SOFT, it yields a complete match for "dog". However, if
101    PCRE_PARTIAL_HARD is set, the result is PCRE_ERROR_PARTIAL. On the other hand,
102    if the pattern is made ungreedy the result is different:
103  <pre>  <pre>
104    \d+    /dog(sbody)??/
105  </pre>  </pre>
106  are not permitted if the maximum number of occurrences is greater than one.  In this case the result is always a complete match because <b>pcre_exec()</b>
107  Optional items such as \d? (where the maximum is one) are permitted.  finds that first, and it never continues after finding a match. It might be
108  Quantifiers with any values are permitted after parentheses, so the invalid  easier to follow this explanation by thinking of the two patterns like this:
 examples above can be coded thus:  
109  <pre>  <pre>
110    (a){2,4}    /dog(sbody)?/    is the same as  /dogsbody|dog/
111    (\d)+    /dog(sbody)??/   is the same as  /dog|dogsbody/
112  </pre>  </pre>
113  These constructions run more slowly, but for the kinds of application that are  The second pattern will never match "dogsbody" when <b>pcre_exec()</b> is
114  envisaged for this facility, this is not felt to be a major restriction.  used, because it will always find the shorter match first.
115  </P>  </P>
116    <br><a name="SEC3" href="#TOC1">PARTIAL MATCHING USING pcre_dfa_exec()</a><br>
117  <P>  <P>
118  If PCRE_PARTIAL is set for a pattern that does not conform to the restrictions,  The <b>pcre_dfa_exec()</b> function moves along the subject string character by
119  <b>pcre_exec()</b> returns the error code PCRE_ERROR_BADPARTIAL (-13).  character, without backtracking, searching for all possible matches
120  You can use the PCRE_INFO_OKPARTIAL call to <b>pcre_fullinfo()</b> to find out  simultaneously. If the end of the subject is reached before the end of the
121  if a compiled pattern can be used for partial matching.  pattern, there is the possibility of a partial match, again provided that at
122    least one character has matched.
123    </P>
124    <P>
125    When PCRE_PARTIAL_SOFT is set, PCRE_ERROR_PARTIAL is returned only if there
126    have been no complete matches. Otherwise, the complete matches are returned.
127    However, if PCRE_PARTIAL_HARD is set, a partial match takes precedence over any
128    complete matches. The portion of the string that provided the longest partial
129    match is set as the first matching string, provided there are at least two
130    slots in the offsets vector.
131    </P>
132    <P>
133    Because <b>pcre_dfa_exec()</b> always searches for all possible matches, and
134    there is no difference between greedy and ungreedy repetition, its behaviour is
135    different from <b>pcre_exec</b> when PCRE_PARTIAL_HARD is set. Consider the
136    string "dog" matched against the ungreedy pattern shown above:
137    <pre>
138      /dog(sbody)??/
139    </pre>
140    Whereas <b>pcre_exec()</b> stops as soon as it finds the complete match for
141    "dog", <b>pcre_dfa_exec()</b> also finds the partial match for "dogsbody", and
142    so returns that when PCRE_PARTIAL_HARD is set.
143    </P>
144    <br><a name="SEC4" href="#TOC1">PARTIAL MATCHING AND WORD BOUNDARIES</a><br>
145    <P>
146    If a pattern ends with one of sequences \w or \W, which test for word
147    boundaries, partial matching with PCRE_PARTIAL_SOFT can give counter-intuitive
148    results. Consider this pattern:
149    <pre>
150      /\bcat\b/
151    </pre>
152    This matches "cat", provided there is a word boundary at either end. If the
153    subject string is "the cat", the comparison of the final "t" with a following
154    character cannot take place, so a partial match is found. However,
155    <b>pcre_exec()</b> carries on with normal matching, which matches \b at the end
156    of the subject when the last character is a letter, thus finding a complete
157    match. The result, therefore, is <i>not</i> PCRE_ERROR_PARTIAL. The same thing
158    happens with <b>pcre_dfa_exec()</b>, because it also finds the complete match.
159    </P>
160    <P>
161    Using PCRE_PARTIAL_HARD in this case does yield PCRE_ERROR_PARTIAL, because
162    then the partial match takes precedence.
163    </P>
164    <br><a name="SEC5" href="#TOC1">FORMERLY RESTRICTED PATTERNS</a><br>
165    <P>
166    For releases of PCRE prior to 8.00, because of the way certain internal
167    optimizations were implemented in the <b>pcre_exec()</b> function, the
168    PCRE_PARTIAL option (predecessor of PCRE_PARTIAL_SOFT) could not be used with
169    all patterns. From release 8.00 onwards, the restrictions no longer apply, and
170    partial matching with <b>pcre_exec()</b> can be requested for any pattern.
171    </P>
172    <P>
173    Items that were formerly restricted were repeated single characters and
174    repeated metasequences. If PCRE_PARTIAL was set for a pattern that did not
175    conform to the restrictions, <b>pcre_exec()</b> returned the error code
176    PCRE_ERROR_BADPARTIAL (-13). This error code is no longer in use. The
177    PCRE_INFO_OKPARTIAL call to <b>pcre_fullinfo()</b> to find out if a compiled
178    pattern can be used for partial matching now always returns 1.
179  </P>  </P>
180  <br><a name="SEC3" href="#TOC1">EXAMPLE OF PARTIAL MATCHING USING PCRETEST</a><br>  <br><a name="SEC6" href="#TOC1">EXAMPLE OF PARTIAL MATCHING USING PCRETEST</a><br>
181  <P>  <P>
182  If the escape sequence \P is present in a <b>pcretest</b> data line, the  If the escape sequence \P is present in a <b>pcretest</b> data line, the
183  PCRE_PARTIAL flag is used for the match. Here is a run of <b>pcretest</b> that  PCRE_PARTIAL_SOFT option is used for the match. Here is a run of <b>pcretest</b>
184  uses the date example quoted above:  that uses the date example quoted above:
185  <pre>  <pre>
186      re&#62; /^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$/      re&#62; /^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$/
187    data&#62; 25jun04\P    data&#62; 25jun04\P
188     0: 25jun04     0: 25jun04
189     1: jun     1: jun
190    data&#62; 25dec3\P    data&#62; 25dec3\P
191    Partial match    Partial match: 23dec3
192    data&#62; 3ju\P    data&#62; 3ju\P
193    Partial match    Partial match: 3ju
194    data&#62; 3juj\P    data&#62; 3juj\P
195    No match    No match
196    data&#62; j\P    data&#62; j\P
# Line 116  uses the date example quoted above: Line 198  uses the date example quoted above:
198  </pre>  </pre>
199  The first data string is matched completely, so <b>pcretest</b> shows the  The first data string is matched completely, so <b>pcretest</b> shows the
200  matched substrings. The remaining four strings do not match the complete  matched substrings. The remaining four strings do not match the complete
201  pattern, but the first two are partial matches. The same test, using  pattern, but the first two are partial matches. Similar output is obtained
202  <b>pcre_dfa_exec()</b> matching (by means of the \D escape sequence), produces  when <b>pcre_dfa_exec()</b> is used.
 the following output:  
 <pre>  
     re&#62; /^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$/  
   data&#62; 25jun04\P\D  
    0: 25jun04  
   data&#62; 23dec3\P\D  
   Partial match: 23dec3  
   data&#62; 3ju\P\D  
   Partial match: 3ju  
   data&#62; 3juj\P\D  
   No match  
   data&#62; j\P\D  
   No match  
 </pre>  
 Notice that in this case the portion of the string that was matched is made  
 available.  
203  </P>  </P>
204  <br><a name="SEC4" href="#TOC1">MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()</a><br>  <P>
205    If the escape sequence \P is present more than once in a <b>pcretest</b> data
206    line, the PCRE_PARTIAL_HARD option is set for the match.
207    </P>
208    <br><a name="SEC7" href="#TOC1">MULTI-SEGMENT MATCHING WITH pcre_dfa_exec()</a><br>
209  <P>  <P>
210  When a partial match has been found using <b>pcre_dfa_exec()</b>, it is possible  When a partial match has been found using <b>pcre_dfa_exec()</b>, it is possible
211  to continue the match by providing additional subject data and calling  to continue the match by providing additional subject data and calling
212  <b>pcre_dfa_exec()</b> again with the same compiled regular expression, this  <b>pcre_dfa_exec()</b> again with the same compiled regular expression, this
213  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
214  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
215  are stored. Here is an example using <b>pcretest</b>, using the \R escape  are stored. Here is an example using <b>pcretest</b>, using the \R escape
216  sequence to set the PCRE_DFA_RESTART option (\P and \D are as above):  sequence to set the PCRE_DFA_RESTART option (\D specifies the use of
217    <b>pcre_dfa_exec()</b>):
218  <pre>  <pre>
219      re&#62; /^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$/      re&#62; /^\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d$/
220    data&#62; 23ja\P\D    data&#62; 23ja\P\D
# Line 158  not retain the previously partially-matc Line 229  not retain the previously partially-matc
229  program to do that if it needs to.  program to do that if it needs to.
230  </P>  </P>
231  <P>  <P>
232  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
233  over multiple segments. This facility can be used to pass very long subject  PCRE_DFA_RESTART to continue partial matching over multiple segments. This
234  strings to <b>pcre_dfa_exec()</b>. However, some care is needed for certain  facility can be used to pass very long subject strings to
235  types of pattern.  <b>pcre_dfa_exec()</b>.
236    </P>
237    <br><a name="SEC8" href="#TOC1">MULTI-SEGMENT MATCHING WITH pcre_exec()</a><br>
238    <P>
239    From release 8.00, <b>pcre_exec()</b> can also be used to do multi-segment
240    matching. Unlike <b>pcre_dfa_exec()</b>, it is not possible to restart the
241    previous match with a new segment of data. Instead, new data must be added to
242    the previous subject string, and the entire match re-run, starting from the
243    point where the partial match occurred. Earlier data can be discarded.
244    Consider an unanchored pattern that matches dates:
245    <pre>
246        re&#62; /\d?\d(jan|feb|mar|apr|may|jun|jul|aug|sep|oct|nov|dec)\d\d/
247      data&#62; The date is 23ja\P
248      Partial match: 23ja
249    </pre>
250    The this stage, an application could discard the text preceding "23ja", add on
251    text from the next segment, and call <b>pcre_exec()</b> again. Unlike
252    <b>pcre_dfa_exec()</b>, the entire matching string must always be available, and
253    the complete matching process occurs for each call, so more memory and more
254    processing time is needed.
255    </P>
256    <br><a name="SEC9" href="#TOC1">ISSUES WITH MULTI-SEGMENT MATCHING</a><br>
257    <P>
258    Certain types of pattern may give problems with multi-segment matching,
259    whichever matching function is used.
260  </P>  </P>
261  <P>  <P>
262  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
# Line 170  subject string for any call does not con Line 265  subject string for any call does not con
265  </P>  </P>
266  <P>  <P>
267  2. If the pattern contains backward assertions (including \b or \B), you need  2. If the pattern contains backward assertions (including \b or \B), you need
268  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
269  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
270  a buffer of 700 bytes, with the starting offset set to 200 and the previous 200  <b>pcre_dfa_exec()</b>, you could pass the subject in chunks that are 500 bytes
271  bytes at the start of the buffer.  long, but in a buffer of 700 bytes, with the starting offset set to 200 and the
272    previous 200 bytes at the start of the buffer.
273  </P>  </P>
274  <P>  <P>
275  3. Matching a subject string that is split into multiple segments does not  3. Matching a subject string that is split into multiple segments may not
276  always produce exactly the same result as matching over one single long string.  always produce exactly the same result as matching over one single long string,
277  The difference arises when there are multiple matching possibilities, because a  especially when PCRE_PARTIAL_SOFT is used. The section "Partial Matching and
278  partial match result is given only when there are no completed matches in a  Word Boundaries" above describes an issue that arises if the pattern ends with
279  call to <b>pcre_dfa_exec()</b>. This means that as soon as the shortest match has  \b or \B. Another kind of difference may occur when there are multiple
280    matching possibilities, because a partial match result is given only when there
281    are no completed matches. This means that as soon as the shortest match has
282  been found, continuation to a new subject segment is no longer possible.  been found, continuation to a new subject segment is no longer possible.
283  Consider this <b>pcretest</b> example:  Consider again this <b>pcretest</b> example:
284  <pre>  <pre>
285      re&#62; /dog(sbody)?/      re&#62; /dog(sbody)?/
286      data&#62; dogsb\P
287       0: dog
288    data&#62; do\P\D    data&#62; do\P\D
289    Partial match: do    Partial match: do
290    data&#62; gsb\R\P\D    data&#62; gsb\R\P\D
# Line 193  Consider this <b>pcretest</b> example: Line 293  Consider this <b>pcretest</b> example:
293     0: dogsbody     0: dogsbody
294     1: dog     1: dog
295  </pre>  </pre>
296  The pattern matches the words "dog" or "dogsbody". When the subject is  The first data line passes the string "dogsb" to <b>pcre_exec()</b>, setting the
297  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
298  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
299  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
300    <b>pcre_dfa_exec()</b> in several parts ("do" and "gsb" being the first two) the
301    match stops when "dog" has been found, and it is not possible to continue. On
302    the other hand, if "dogsbody" is presented as a single string,
303    <b>pcre_dfa_exec()</b> finds both matches.
304  </P>  </P>
305  <P>  <P>
306  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
307  that is going to be matched in this way with a variable repeat.  matching multi-segment data. The example above then behaves differently:
308    <pre>
309        re&#62; /dog(sbody)?/
310      data&#62; dogsb\P\P
311      Partial match: dogsb
312      data&#62; do\P\D
313      Partial match: do
314      data&#62; gsb\R\P\P\D
315      Partial match: gsb
316    
317    </PRE>
318  </P>  </P>
319  <P>  <P>
320  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
321  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
322  consider this pattern:  <b>pcre_dfa_exec()</b> is used. For example, consider this pattern:
323  <pre>  <pre>
324    1234|3789    1234|3789
325  </pre>  </pre>
326  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
327  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
328  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
329  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
330  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
331  are remembered. The problem arises because the start of the second alternative  are remembered. The problem arises because the start of the second alternative
332  matches within the first alternative. There is no problem with anchored  matches within the first alternative. There is no problem with anchored
# Line 220  patterns or patterns such as: Line 334  patterns or patterns such as:
334  <pre>  <pre>
335    1234|ABCD    1234|ABCD
336  </pre>  </pre>
337  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
338    problem if \fPpcre_exec()\fP is used, because the entire match has to be rerun
339    each time:
340    <pre>
341        re&#62; /1234|3789/
342      data&#62; ABC123\P
343      Partial match: 123
344      data&#62; 1237890
345       0: 3789
346    
347    </PRE>
348  </P>  </P>
349  <br><a name="SEC5" href="#TOC1">AUTHOR</a><br>  <br><a name="SEC10" href="#TOC1">AUTHOR</a><br>
350  <P>  <P>
351  Philip Hazel  Philip Hazel
352  <br>  <br>
# Line 231  University Computing Service Line 355  University Computing Service
355  Cambridge CB2 3QH, England.  Cambridge CB2 3QH, England.
356  <br>  <br>
357  </P>  </P>
358  <br><a name="SEC6" href="#TOC1">REVISION</a><br>  <br><a name="SEC11" href="#TOC1">REVISION</a><br>
359  <P>  <P>
360  Last updated: 04 June 2007  Last updated: 31 August 2009
361  <br>  <br>
362  Copyright &copy; 1997-2007 University of Cambridge.  Copyright &copy; 1997-2009 University of Cambridge.
363  <br>  <br>
364  <p>  <p>
365  Return to the <a href="index.html">PCRE index page</a>.  Return to the <a href="index.html">PCRE index page</a>.

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

  ViewVC Help
Powered by ViewVC 1.1.5