Original FAQ You can see the original FAQ (still useful) at Parse::RecDescent::FAQ::Original. It is a document that I grew over about a decade, but I no longer have time for editing and categorizing other people's posts to fit them into POD format an...

Parse::RecDescent has a mechanism for automatically generating parse trees. What this does is to bless each resulting node into a package namespace corresponding to the rule. This might not be desirable, for a couple of reasons: * You probably don't ...

A common need when writing grammars is to know how much text was consumed at different points in a parse. Usually, this involves a lot of brain-twisting unwinding of of highly nested list-of-lists (of lists...). Instead this module allows you to take...

This module adds the "deparse" method to the "Parse::RecDescent" class, which returns a textual description of the grammar. Why? There are at least two equally unlikely reasons why this could be useful: * You're working on something which grovels aro...

This module makes it easy to visualise Parse::RecDescent grammars. Writing Parse::RecDescent grammars is tricky at the best of times, and grammars almost always evolve in ways unforseen at the start. This module aims to visualise a grammar as a graph...

This module is Inline::C's original Parse::RecDescent based parser. It was previously packaged as Inline::C::grammar. Try Inline::C::ParseRegExp for an alternative. AUTHORS Ingy döt Net <ingy@cpan.org> Sisyphus <sisyphus@cpan.org> COPYRIGHT AND LICEN...

The SQL parser is a L<Parse::RecDescent> parser generated by L<Genezzo::Parse::SQLGrammar>. It shouldn't be looked at with human eyes. Still reading this? You must be a glutton for punishment. This parser handles a fair bit of SQL92, but the error ha...