From professional translators, enterprises, web pages and freely available translation repositories.
group, capturing
그룹, 캡처
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
group, non-capturing
그룹, 캡처하지 않음
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
opening parentheses are counted from left to right (starting from 1) to obtain the number of the capturing subpattern.
replacement may contain references of the form\\ n or (since php 4.0.4) $n, with the latter form being the preferred one. every such reference will be replaced by the text captured by the n 'th parenthesized pattern. n can be from 0 to 99, and \\0 or $0 refers to the text matched by the whole pattern. opening parentheses are counted from left to right (starting from 1) to obtain the number of the capturing subpattern.
Last Update: 2011-10-24
Usage Frequency: 1
Quality:
capturing subpatterns that occur inside negative looka - head assertions are counted, but their entries in the offsets vector are never set.
the differences described here are with respect to perl 5.005.
Last Update: 2011-10-24
Usage Frequency: 1
Quality:
the values set for any capturing subpatterns are those from the outermost level of the recursion at which the subpatternthe values set for any capturing subpatterns are those from the outermost level of the recursion at which the subpattern value is set.
subpatterns are delimited by parentheses (round brackets), which can be nested. marking part of a pattern as a subpattern does two things: 1. it localizes a set of alternatives. for example, the pat- tern cat(aract_bar_erpillar_bar_) matches one of the words "cat", "cataract", or "caterpillar". without the parentheses, it would match "cataract", "erpillar" or the empty string. 2. it sets up the subpattern as a capturing subpattern (as defined above). when the whole pattern matches, that portion of the subject string that matched the subpattern is passed back to the caller via the ovector argument of pcre_exec(). opening parentheses are counted from left to right (starting from 1) to obtain the numbers of the capturing subpatterns. for example, if the string "the red king" is matched against the pattern the ((red_bar_white) (king_bar_queen)) the captured substrings are "red king", "red", and "king", and are numbered 1, 2, and 3. the fact that plain parentheses fulfil two functions is not always helpful. there are often times when a grouping subpattern is required without a capturing requirement. if an opening parenthesis is followed by "?:", the subpattern does not do any capturing, and is not counted when computing the number of any subsequent capturing subpatterns. for example, if the string "the white queen" is matched against the pattern the ((?:red_bar_white) (king_bar_queen)) the captured substrings are "white queen" and "queen", and are numbered 1 and 2. the maximum number of captured substrings is 99, and the maximum number of all subpatterns, both capturing and non-capturing, is 200. as a convenient shorthand, if any option settings are required at the start of a non-capturing subpattern, the option letters may appear between the "?" and the ":". thus the two patterns (?i:saturday_bar_sunday) (?:(?i)saturday_bar_sunday) match exactly the same set of strings. because alternative branches are tried from left to right, and options are not reset until the end of the subpattern is reached, an option setting in one branch does affect subsequent branches, so the above patterns match "sunday" as well as "saturday".
Last Update: 2011-10-24
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
if no memory can be obtained, it saves data for the first 15 capturing parentheses only, as there is no way to give an out-of-memory error from within a recursion.
outside a character class, a backslash followed by a digit greater than 0 (and possibly further digits) is a back reference to a capturing subpattern earlier (i.e. to its left) in the pattern, provided there have been that many previous capturing left parentheses. however, if the decimal number following the backslash is less than 10, it is always taken as a back reference, and causes an error only if there are not that many capturing left parentheses in the entire pattern. in other words, the parentheses that are referenced need not be to the left of the reference for numbers less than 10. see the section entitled "backslash" above for further details of the handling of digits following a backslash. a back reference matches whatever actually matched the capturing subpattern in the current subject string, rather than anything matching the subpattern itself. so the pattern (sens_bar_respons)e and \1ibility matches "sense and sensibility" and "response and responsibility", but not "sense and responsibility". if caseful matching is in force at the time of the back reference, then the case of letters is relevant. for example, ((?i)rah)\s+\1 matches "rah rah" and "rah rah", but not "rah rah", even though the original capturing subpattern is matched caselessly. there may be more than one back reference to the same subpattern. if a subpattern has not actually been used in a particular match, then any back references to it always fail. for example, the pattern (a_bar_(bc))\2 always fails if it starts to match "a" rather than "bc". because there may be up to 99 back references, all digits following the backslash are taken as part of a potential back reference number. if the pattern continues with a digit character, then some delimiter must be used to terminate the back reference. if the pcre_extended option is set, this can be whitespace. otherwise an empty comment can be used. a back reference that occurs inside the parentheses to which it refers fails when the subpattern is first used, so, for example, (a\1) never matches. however, such references can be useful inside repeated subpatterns. for example, the pattern (a_bar_b\1)+ matches any number of "a"s and also "aba", "ababaa" etc. at each iteration of the subpattern, the back reference matches the character string corresponding to the previous iteration. in order for this to work, the pattern must be such that the first iteration does not need to match the back reference. this can be done using alternation, as in the example above, or by a quantifier with a minimum of zero.
Last Update: 2011-10-24
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
as a convenient shorthand, if any option settings are required at the start of a non-capturing subpattern, theas a convenient shorthand, if any option settings are required at the start of a non-capturing subpattern, the option letters may appear between the "?" and the ":".
a second use of backslash provides a way of encoding non- printing characters in patterns in a visible manner. there is no restriction on the appearance of non-printing characters, apart from the binary zero that terminates a pattern, but when a pattern is being prepared by text editing, it is usually easier to use one of the following escape sequences than the binary character it represents:
Last Update: 2011-10-24
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting