>All in all, though, you're right that neither set of features is particularly
>well-known/used outside of p5p followers. At least from what I've seen.
>Virtually every person I've worked with since 5.6 came out has been surprised
>and amazed at the REx eval stuff.
The completely reworked regex c
On Fri, Aug 25, 2000 at 03:46:59PM -0400, Eric Roode wrote:
> Nat wrote:
> >5.6's regular expressions have (??{ ... }) to permit recursion and
> >$^R to maintain state through the parsing.
>
> In another thread, Tomc wrote:
> >[...] Likewise the @+ and @- stuff.
>
> Okay, I'm throwing my ignor
Nat wrote:
>5.6's regular expressions have (??{ ... }) to permit recursion and
>$^R to maintain state through the parsing.
In another thread, Tomc wrote:
>[...] Likewise the @+ and @- stuff.
Okay, I'm throwing my ignorance out for the whole world to see. WTF??
Sure, I'm not in the loop, as ce
Steven W McDougall writes:
> To express nesting, you need a context-free grammer; to recognize
> nested constructs, you need a stack machine.
>
> Going from REs to CFGs is a huge jump in the complexity of Perl, and
> trading in state machines for stack machines is a huge jump in the
> complexity
> A new regular expression metacharacter \m would match any of the
> following characters: ([{"'< in a regexp. A later \M metacharacter
> would match the corresponding closing pair character )]{"'>
> I within the string being searched.
^
LanguageReco
This and other RFCs are available on the web at
http://dev.perl.org/rfc/
=head1 TITLE
Brace-matching for Perl Regular Expressions
=head1 VERSION
Maintainer: Eric J. Roode <[EMAIL PROTECTED]>
Date: 24 Aug 2000
Last Modified: 25 Aug 2000
Version: 2
Mailing List: [EMAIL PROTECTED]
N
