Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re: Breaking The Rules II

by diotalevi (Canon)
on Jul 02, 2007 at 14:27 UTC ( #624458=note: print w/ replies, xml ) Need Help??


in reply to Breaking The Rules II

That's interesting. I've "used" Parse::RecDescent but never stressed it. I got a basic intro to Parrot's compiler tools last week. I'm curious now how that would fare. You get to write a grammar in Perl 6, annotate your productions with associativity information and other stuff. This goes right to an AST which you can register events against. From there, you produce an opcode syntax tree and from there you get byte code.

This is a tool aimed at this kind of task, y'know? It ought to be decent.

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊


Comment on Re: Breaking The Rules II
Re^2: Breaking The Rules II
by Limbic~Region (Chancellor) on Jul 02, 2007 at 14:59 UTC
    diotalevi,
    The problems I encountered with Parse::RecDescent have been solved and then some with Perl 6 rules. Unfortunately, this meditation is more than a year old and the state of things then was far worse than it is now.

    Cheers - L~R

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (14)
As of 2014-09-30 14:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (372 votes), past polls