Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: Easy Matching of nested data structures

by moritz (Cardinal)
on Oct 22, 2007 at 20:20 UTC ( #646567=note: print w/replies, xml ) Need Help??

in reply to Easy Matching of nested data structures

Maybe Language::AttributeGrammar will help you.

For Parrot there is also the "Tree Grammar Engine" (sorry, I don't know if there's a better link target, particle++ for providing at least this one) - are you looking for something like this?

  • Comment on Re: Easy Matching of nested data structures

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://646567]
[stevieb]: My GPIO expander chips should arrive tomorrow, but I think I'll throw a shift register against them and see if all six I have will turn at once. Amps are near the breaking point, but I want to know max sustainable V and I output.

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2018-03-22 22:21 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (286 votes). Check out past polls.