From professional translators, enterprises, web pages and freely available translation repositories.
it is possible to cause the matching process to obey a subpattern conditionally or to choose between two alternative subpatterns, depending on the result of an assertion, or whether a previous capturing subpattern matched or not. the two possible forms of conditional subpattern are (?(condition)yes-pattern) (?(condition)yes-pattern_bar_no-pattern) if the condition is satisfied, the yes-pattern is used; otherwise the no-pattern (if present) is used. if there are more than two alternatives in the subpattern, a compile-time error occurs. there are two kinds of condition. if the text between the parentheses consists of a sequence of digits, then the condition is satisfied if the capturing subpattern of that number has previously matched. consider the following pattern, which contains non-significant white space to make it more readable (assume the pcre_extended option) and to divide it into three parts for ease of discussion: (\()? [^()]+ (?(1)\)) the first part matches an optional opening parenthesis, and if that character is present, sets it as the first captured substring. the second part matches one or more characters that are not parentheses. the third part is a conditional subpattern that tests whether the first set of parentheses matched or not. if they did, that is, if subject started with an opening parenthesis, the condition is true, and so the yes-pattern is executed and a closing parenthesis is required. otherwise, since no-pattern is not present, the subpattern matches nothing. in other words, this pattern matches a sequence of non-parentheses, optionally enclosed in parentheses. if the condition is not a sequence of digits, it must be an assertion. this may be a positive or negative lookahead or lookbehind assertion. consider this pattern, again containing non-significant white space, and with the two alternatives on the second line: (?(?=[^a-z]*[a-z]) \d{2}-[a-z]{3}-\d{2} _bar_ \d{2}-\d{2}-\d{2}) the condition is a positive lookahead assertion that matches an optional sequence of non-letters followed by a letter. in other words, it tests for the presence of at least one letter in the subject. if a letter is found, the subject is matched against the first alternative; otherwise it is matched against the second. this pattern matches strings in one of the two forms dd-aaa-dd or dd-dd-dd, where aaa are letters and dd are digits.
however, if pcre_dotall is not set, pcre cannot make this optimization, because the. metacharacter does not then match a newline, and if the subject string contains newlines, the pattern may match from the character immediately following one of themhowever, if pcre_dotall is not set, pcre cannot make this optimization, because the. metacharacter does not then match a newline, and if the subject string contains newlines, the pattern may match from the character immediately following one of them instead of from the very start.
