At 8:44 PM -0700 5/6/02, Mark Kvale wrote:
>
>Hi all,
>
>One of the upcoming decisions that needs to be made is on the design
>of the Parrot regex engine. More specifically, (1) how will compiled
>regexes be represented and (2) how will strings be matched against
>compiled regexes?
As I come in late...
1) As parrot subs
2) As fast as possible. Faster than that would be preferable, but
we'll take what we can get. :)
We're not using the private engine model--it's a maintenance pain as
we've seen with perl 5, and Larry's hinting at things that will make
it untenable in some cases.
As for the rest, some of the good structures from Brent's regex
implementation are going to be brought out as general use things
(like the integer stack and, I think, the bitmap/charclass stuff) and
we'll go from there. Unless someone comes up with a better way to do
it, some of the code he wrote will be part of Parrot's regex opcode
set.
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
