Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Re: Re: Re: Parse::RecDescent Grammar Fun

by ichimunki (Priest)
on Jul 25, 2002 at 00:52 UTC ( #185077=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: Parse::RecDescent Grammar Fun
in thread Parse::RecDescent Grammar Fun

Hahaha! We're going to beat this grammar into submission yet. :)

Unfortunately we can't brute force it, think of the labor and testing involved to add new tags. I think the best I can do here is to collect punct as single character chunks (storing them in a temp var), then, when I get to a token, insert that temp var back into the tree. I'd post code, but rather than printing discrete sensible morphemes, I really just need the morphemes (productions in P::RD-speak) concatenated in a string. For that purpose whether it emits punct one character at a time or in chunks won't matter.

Either way, this Parse::RecDescent module is the best thing since HTML::TokeParser[::Simple], imho.


Comment on Re: Re: Re: Re: Parse::RecDescent Grammar Fun

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2015-07-30 02:22 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 (269 votes), past polls