Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re: Breaking The Rules II

by Ovid (Cardinal)
on Jul 02, 2007 at 15:14 UTC ( #624471=note: print w/ replies, xml ) Need Help??


in reply to Breaking The Rules II

Sorry I never got back to you with a HOP-Parser example. Since Dominus said he was going to make the book available for free, I figured that eventually I could just point people to that for documentation since there's a heck of a lot to document. I do have a parsing example at Converting words to numbers with HOP::Parser. Maybe that could be a start?

Oh, and the AI::Prolog math prepocessor is pretty much "for internal use only" :)

You could also look at the code for Object::Relation::Parser. It uses the HOP::Parser internally. There's a brief explanation of it at Object::Relation::Parser::Overview. The latter documentation explains the grammar and some of the tests with that can help. Of course, I didn't write that as a tutorial, so it might not help that much :/

Cheers,
Ovid

New address of my CGI Course.


Comment on Re: Breaking The Rules II
Re^2: Breaking The Rules II
by Limbic~Region (Chancellor) on Jul 02, 2007 at 15:21 UTC
    Ovid,
    Thank you. I am not going to put this back on my to-do list. I posted unfinished because I didn't really see myself pursuing all the things to complete the meditation. On the other hand, the next time I need a parser for something that Parse::Yapp doesn't solve for me very easily, I will look back into HOP::Parser and the links you have provided.

    Cheers - L~R

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (11)
As of 2015-07-03 07:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (48 votes), past polls