Home | History | Annotate | Download | only in doc

Lines Matching full:alternative

59        alternative function that matches the same compiled patterns in a  dif-
60 ferent way. In certain circumstances, the alternative function has some
1103 mentation.) An alternative approach to recursion that uses memory from
1168 If you need to create alternative tables when cross compiling, you will
1368 An alternative algorithm is provided by the pcre_dfa_exec(),
1370 different way, and are not Perl-compatible. This alternative has advan-
1386 of them, whereas the alternative algorithm finds all three.
1408 previous branch point in the tree, and tries the next alternative
1427 THE ALTERNATIVE MATCHING ALGORITHM
1472 supported by the alternative matching algorithm. They are as follows:
1511 not supported in these modes, because the alternative algorithm moves
1520 ADVANTAGES OF THE ALTERNATIVE ALGORITHM
1522 Using the alternative matching algorithm provides the following advan-
1530 2. Because the alternative algorithm scans the subject string just
1540 DISADVANTAGES OF THE ALTERNATIVE ALGORITHM
1542 The alternative algorithm suffers from a number of disadvantages:
1754 ing. The alternative algorithm finds all possible matches (at a given
3065 alternative matching function, which is described below in the section
3437 ered to be more important that an alternative complete match.
3559 match "c" and backing up to try the second alternative. The zero
4033 possible match, consider using the alternative matching function (see
4034 below) instead. If you cannot use the alternative function, but still
4071 MATCHING A PATTERN: THE ALTERNATIVE FUNCTION
4664 strings, each alternative branch of a lookbehind assertion can match a
4697 (k) The alternative matching functions (pcre_dfa_exec(),
4732 semantics as closely as it can. PCRE also supports some alternative
4746 pcre[16|32]_exec() (16- or 32-bit), is used. PCRE also has alternative
4750 used. The advantages and disadvantages of the alternative functions,
4917 | start of alternative branch
5143 an alternative syntax for referencing a subpattern as a "subroutine".
5616 alternative in which it appears if the pattern is ever to match that
5717 in each alternative (see "Duplicate Subpattern Numbers" below). The
5942 Vertical bar characters are used to separate alternative patterns. For
5948 appear, and an empty alternative is permitted (matching the empty
5949 string). The matching process tries each alternative in turn, from left
5952 rest of the main pattern as well as the alternative in the subpattern.
5992 in different parts of the pattern. Any changes made in one alternative
6065 match exactly the same set of strings. Because alternative branches are
6074 Perl 5.10 introduced a feature whereby each alternative in a subpattern
6083 you can look at captured substring number one, whichever alternative
6112 An alternative approach to using this "branch reset" feature is to use
6158 match. (An alternative way of solving this problem is to use a "branch
6392 An alternative description is that a subpattern of this type matches
6682 The implementation of lookbehind assertions is, for each alternative,
6761 ditionally or to choose between two alternative subpatterns, depending
6860 there may be only one alternative in the subpattern. It is always
6891 letter is found, the subject is matched against the first alternative;
6991 An alternative approach is to use named parentheses instead. The Perl
7062 the end of the string, the first alternative fails; the second alterna-
7071 enter the recursion and try the second alternative.) However, if the
7077 This time, the recursing alternative is tried first, and continues to
7079 fails. But this time we do have another alternative to try at the
7081 remaining alternative is at a deeper recursion level, which PCRE cannot
7129 to match "b", the second alternative matches "a" and then recurses. In
7181 an alternative syntax for referencing a subpattern as a subroutine,
7452 (*PRUNE) is just an alternative to an atomic group or possessive quan-
7494 This verb causes a skip to the next innermost alternative when back-
7496 within the current alternative. Its name comes from the observation
7503 skips to the second alternative and tries COND2, without backtracking
7515 enclosing alternative; it is not a nested alternation with only one
7516 alternative. The effect of (*THEN) extends beyond such a subpattern to
7517 the enclosing alternative. Consider this pattern, where A, B, etc. are
7524 backtrack into A; instead it moves to the next alternative, that is, D.
7525 However, if the subpattern containing (*THEN) is given an alternative,
7547 part of the single alternative that comprises the whole pattern, and so
7553 match at the next alternative. (*PRUNE) comes next, failing the match
7569 (*THEN) causes the next alternative (ABD) to be tried. This behaviour
7601 alternative in the innermost enclosing group that has alternations,
7607 ative assertion to be true, without considering any further alternative
7609 to the next enclosing alternative within the assertion (the normal be-
7610 haviour), but if the assertion does not have such an alternative,
7628 (*THEN) skips to the next alternative in the innermost enclosing group
7890 capturing groups in each alternative
8228 the alternative matching function pcre[16|32]_dfa_exec(), nor is it
8813 own partially matches the second alternative.)
9133 first alternative is found at offset 3. There is no partial match for
9134 the second alternative, because such a match does not start at the same
9138 because the start of the second alternative matches within the first
9139 alternative. There is no problem with anchored patterns or patterns
9403 needs a character's property. If you can find an alternative pattern
10258 back up and try a different alternative if the first one fails. As