Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

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.

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

Replies are listed 'Best First'.
Re^2: Breaking The Rules II
by Limbic~Region (Chancellor) on Jul 02, 2007 at 14:59 UTC
    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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://624458]
[marto]: failing that see the README
[mark4]: I installed "PAR" from the ppm install window. pp.exe. did not show up.
[marto]: it should just be a script, pp, or on windows pp.bat, post install you should just be able to call pp -x packed.exe as the PPM package should put everything required into the appropriate path
[marto]: ah, some time ago pp became it's own package, try searching your repo for PAR::Packer
[marto]: again, Strawberry + cpanm for the win: cpanm pp to install

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2018-01-19 14:19 GMT
Find Nodes?
    Voting Booth?
    How did you see in the new year?

    Results (218 votes). Check out past polls.