Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Re: Re: Re: Re: Parse::RecDescent Grammar Funby ichimunki (Priest) |
on Jul 25, 2002 at 00:52 UTC ( [id://185077]=note: print w/replies, xml ) | Need Help?? |
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.
In Section
Seekers of Perl Wisdom
|
|