On Jul 4, Steve Fink said:
>Personally, I could see using it with the current prototype perl6
>compiler to take over the parsing whenever a regex is seen. The
>resulting tree structure would then be translated into a
>languages/regex-style tree, and from there converted into PIR
>instructions. The
On Jul-04, Jeff 'japhy' Pinyan wrote:
> I want to make sure I haven't misunderstood anything. *What* purpose will
> my module that will be able to parse Perl 6 regexes into a tree be? You
> must be aware that I have no power Damian does not possess, and I cannot
> translate *all* Perl 6 regexes t
I want to make sure I haven't misunderstood anything. *What* purpose will
my module that will be able to parse Perl 6 regexes into a tree be? You
must be aware that I have no power Damian does not possess, and I cannot
translate *all* Perl 6 regexes to Perl 5 regexes. All I can promise is a
tree
Jeff 'japhy' Pinyan wrote:
...I have a question about the backtrack
control assertions : :: and :::.
Do any of them cause the regex to fail entirely? That is, not fail and
try again from a different position in the string, but fail utterly? My
understanding is they don't, which is why there's , b
Jeff 'japhy' Pinyan writes:
> It'll appear shortly at your local mirror. You can get it from my web
> site as well.
>
> I'll be writing an extension module tomorrow, and starting next week, I'll
> get started on Regexp::Perl6.
Cool.
> Which leads me to a question about Perl 6 regexes. I'm writ
