And don't forget, this is just a prototype. All the code will be replaced as soon as we get a working grammar engine.
I'm not so sure about that. (Not that it won't be replaced, but that it needs the grammar engine) I'm pretty sure that grammars as Larry's defined 'em are recursive-descent, and if that's true then I've this really nasty feeling we're going to find it insufficiently fast to parse perl. Could be wrong, but even if we pick up two orders of magnitude in speed over Parse::RecDescent things'll still be significantly more sluggish than the current perl 5 parser.
(OTOH, if the grammar engine's not required to be recursive-descent that makes things rather faster, which is fine with me :)
--
Dan
--------------------------------------"it's like this"-------------------
Dan Sugalski even samurai
[EMAIL PROTECTED] have teddy bears and even
teddy bears get drunk
