diff options
author | Karl Williamson <public@khwilliamson.com> | 2013-03-17 11:46:45 -0600 |
---|---|---|
committer | Karl Williamson <public@khwilliamson.com> | 2013-03-18 12:23:20 -0600 |
commit | 93f313efce5af0afe7c5f9bdca84a71149a9f321 (patch) | |
tree | 3b4713873bf31776b9a93d3e32af3ca271b03aae /pod/perlre.pod | |
parent | 982c4ecb0121ffb412a0c6a3bd4b9a8b95318f76 (diff) | |
download | perl-93f313efce5af0afe7c5f9bdca84a71149a9f321.tar.gz |
pod/perlre: Italicize text to indicate non-literal
Also, changes a reference to the section into an actual link.
Diffstat (limited to 'pod/perlre.pod')
-rw-r--r-- | pod/perlre.pod | 16 |
1 files changed, 9 insertions, 7 deletions
diff --git a/pod/perlre.pod b/pod/perlre.pod index 80aa306b23..e4a0b114a2 100644 --- a/pod/perlre.pod +++ b/pod/perlre.pod @@ -1407,14 +1407,16 @@ The following pattern matches a parenthesized group: \) }x; -See also C<(?PARNO)> for a different, more efficient way to accomplish +See also +L<C<(?I<PARNO>)>|/(?PARNO) (?-PARNO) (?+PARNO) (?R) (?0)> +for a different, more efficient way to accomplish the same task. Executing a postponed regular expression 50 times without consuming any input string will result in a fatal error. The maximum depth is compiled into perl, so changing it requires a custom build. -=item C<(?PARNO)> C<(?-PARNO)> C<(?+PARNO)> C<(?R)> C<(?0)> +=item C<(?I<PARNO>)> C<(?-I<PARNO>)> C<(?+I<PARNO>)> C<(?R)> C<(?0)> X<(?PARNO)> X<(?1)> X<(?R)> X<(?0)> X<(?-1)> X<(?+1)> X<(?-PARNO)> X<(?+PARNO)> X<regex, recursive> X<regexp, recursive> X<regular expression, recursive> X<regex, relative recursion> @@ -1426,10 +1428,10 @@ as an independent pattern that must match at the current position. Capture groups contained by the pattern will have the value as determined by the outermost recursion. -PARNO is a sequence of digits (not starting with 0) whose value reflects +I<PARNO> is a sequence of digits (not starting with 0) whose value reflects the paren-number of the capture group to recurse to. C<(?R)> recurses to the beginning of the whole pattern. C<(?0)> is an alternate syntax for -C<(?R)>. If PARNO is preceded by a plus or minus sign then it is assumed +C<(?R)>. If I<PARNO> is preceded by a plus or minus sign then it is assumed to be relative, with negative numbers indicating preceding capture groups and positive ones following. Thus C<(?-1)> refers to the most recently declared group, and C<(?+1)> indicates the next group to be declared. @@ -1493,7 +1495,7 @@ be processed. =item C<(?&NAME)> X<(?&NAME)> -Recurse to a named subpattern. Identical to C<(?PARNO)> except that the +Recurse to a named subpattern. Identical to C<(?I<PARNO>)> except that the parenthesis to recurse to is determined by name. If multiple parentheses have the same name, then it recurses to the leftmost. @@ -2485,10 +2487,10 @@ else in the whole regular expression.) For this grouping operator there is no need to describe the ordering, since only whether or not C<S> can match is important. -=item C<(??{ EXPR })>, C<(?PARNO)> +=item C<(??{ EXPR })>, C<(?I<PARNO>)> The ordering is the same as for the regular expression which is -the result of EXPR, or the pattern contained by capture group PARNO. +the result of EXPR, or the pattern contained by capture group I<PARNO>. =item C<(?(condition)yes-pattern|no-pattern)> |