Lines Matching full:are

7 This document describes the two different algorithms that are available in
21 these are described below.
25 when there are multiple possibilities. For example, if the pattern
33 there are three possible answers. The standard algorithm finds only one of
40 The set of strings that are matched by a regular expression can be represented
44 There are two ways to search a tree: depth-first and breadth-first, and these
58 left) in the subject string as well. The order in which repetition branches are
65 and the greedy or ungreedy repetition quantifiers are specified in the
69 straightforward for this algorithm to keep track of the substrings that are
90 The scan continues until either the end of the subject is reached, or there are
92 different matching possibilities (if there are none, the match has failed).
94 them, and in particular, it finds the longest. The matches are returned in
103 Note also that all the matches that are found start at the same point in the
121 There are a number of features of PCRE2 regular expressions that are not
123 that are not supported cause an error if encountered.
128 quantifiers are treated in exactly the same way. However, possessive
142 do this. This means that no captured substrings are available.
144 3. Because no substrings are captured, backreferences within the pattern are
148 condition or test for a specific group recursion are not supported.
150 5. Again for the same reason, script runs are not supported.
156 7. Callouts are supported, but the value of the \fIcapture_top\fP field is
164 9. Except for (*FAIL), the backtracking control verbs such as (*PRUNE) are not
175 (at a single point in the subject) are automatically found, and in particular,
198 invalid UTF string are not supported.
200 3. Although atomic groups are supported, their use does not provide the