Beefy Boxes and Bandwidth Generously Provided by pair Networks Cowboy Neal with Hat
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Perl 6 rules and complexity

by chromatic (Archbishop)
on Feb 16, 2006 at 16:17 UTC ( [id://530787]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Perl 6 rules and complexity

It's not clear exactly what it will be, but it won't be completely recursive descent. Hopefully it will be as little recursive descent as possible.

Looking at PGE is probably the best way to gauge the algorithmic behavior of the grammar.

Replies are listed 'Best First'.
Re^2: Perl 6 rules and complexity
by fergal (Chaplain) on Feb 16, 2006 at 20:25 UTC

    Judging by Apocalypse 5 it won't be possible to execute arbitrary code in rule actions. At least I can't find any examples of anything besides manipulating "hypothetical" variables, so maybe it will be memoizable.

    Unfortunately after a quick look, I don't fancy digging through PIR, especially as that seems to be in very early stages and probably bearing no resemblance to it's final state.

[reply]
      Any arbitrary code is allowed in rule actions, just as you can put any arbitrary code into a yacc grammar's reductions. Perl likes to optimize for power over purity unless you specify otherwise somehow.
[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://530787]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.