Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: Perl 6 rules and complexity

by fergal (Chaplain)
on Feb 17, 2006 at 01:25 UTC ( [id://530834]=note: print w/replies, xml ) Need Help??


in reply to Re: Perl 6 rules and complexity
in thread Perl 6 rules and complexity

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.

Replies are listed 'Best First'.
Re^3: Perl 6 rules and complexity
by TimToady (Parson) on Feb 17, 2006 at 02:10 UTC
    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.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://530834]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2024-04-25 12:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found