Re: recdescent 2.0 and Perl 6

ok, this may be a really dumb question, it's not meant to be a 
political one, just to help me plan.

We're starting a project that includes a parser that would convert a 
huge swath of multi-device output (output of explicit commands) to an 
XML tokenized form. More than likely, perl would run in an embedded 
from from tcl (this is the reality we're dealing with-- but we're 
hoping parrot can save us ;-))

Some of this output is potentially very large (although repeating). 
I've written parse::recdescent grammars for some of this output in the 
past but speed was the biggest issue. Has anybody done speed 
comparisons between Perl6::Rules and prd?

I realize that perl6 is still evolving, but at least we can change our 
copy of Perl6::Rules on our schedule, if the benefits outweigh the 
shifting sands... The other hope is that tcl-parrot is functional at 
some point, because I'm guessing perl6 won't like being embedded in tcl 
;-).



On May 6, 2004, at 9:12 AM, Sean O'Rourke wrote:

> This is Perl6::Rules, I believe, which uses the regex engine to do
> the backtracking rather than doing it in pure Perl.
>
> Aamer Akhter <[email protected]> writes:
>
>> Hello,
>>
>> The CPAN page for Parse::Recscent (rating and tutorial pages) mention
>> vast expected speed improvements in version 2.0. The expected date of
>> arrival was Christmas, and 1.94 was released in Apr 2003.
>>
>> Given that 2.0 hasn't been released (and some of the discussions on
>> perl6 wrt to prd), is 2.0 something that Damian Conway is still
>> working on? Or has the effort be refocused on perl6?
>
>

-- 
Aamer Akhter / [email protected]
NSITE cisco Systems