in reply to Another update: "Exploring Programming Language Architecture in Perl"

In 13.4 you ask if there's a way to transform perl with B. Yes. See http://www.perl.com/pub/a/2002/05/07/optree.html and http://home.earthlink.net/~josh.jore/yapc-lint/slides/slide14.html. There's also a B::XPath which is spiffy for matching. Devel::OptreeDiff helps you find the difference between your "desired" and "got" optrees.

⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

  • Comment on Re: Another update: "Exploring Programming Language Architecture in Perl"

Replies are listed 'Best First'.
Re^2: Another update: "Exploring Programming Language Architecture in Perl"
by billh (Pilgrim) on Nov 22, 2006 at 03:45 UTC
    Cool! I've not had much of a chance to experiment, and I'm no expert on perl internals, but B::Utils looks like it might be perfect for doing implicit tail-call optimization at the very least, maybe even automated CPS transforms.
    Bill H
    perl -e 'print sub { "Hello @{[shift]}!\n" }->("World")'

    [download]
[reply]
[d/l]

      Well... B::Utils is just a readonly interface. The XPath interface is even better. If you don't do XPath yet, you deserve to teach it to yourself right now. You can only change things once you use B::Generate.

      ⠤⠤ ⠙⠊⠕⠞⠁⠇⠑⠧⠊

[reply]
        Yeah, I know general XPath, assuming it's the same sort of thing. It was the one good experience from a near-death brush with XSLT (two weeks of my life wasted ;-). This all sounds wonderful though, I'll try to spend some quality time with B et. al. over the next few weeks. However I'm not sure if I can or should try to incorporate any of that into the book, it might be drifting off-topic.
        Bill H
        perl -e 'print sub { "Hello @{[shift]}!\n" }->("World")'

        [download]
[reply]
[d/l]

In Section Meditations