Search results for "module:Parse::Recdescent"
Parse::RecDescent - Generate Recursive-Descent Parsers
Overview Parse::RecDescent incrementally generates top-down recursive-descent text parsers from simple *yacc*-like grammar specifications. It provides: * Regular expressions or literal strings as terminals (tokens), * Multiple (non-contiguous) produc...JTBRAUN/Parse-RecDescent-1.967015 - 04 Apr 2017 14:54:55 UTC
Parse::RecDescent::FAQ - the official, authorized FAQ for Parse::RecDescent.
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...TBONE/Parse-RecDescent-FAQ-7.5 - 24 Aug 2010 17:09:30 UTC
Parse::RecDescent::Deparse - Turn a Parse::RecDescent object back into its grammar
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...SIMON/Parse-RecDescent-Deparse-1.00 - 01 Aug 2002 17:23:11 UTC
Parse::RecDescent::Topiary - tree surgery for Parse::RecDescent autotrees
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 ...IVORW/Parse-RecDescent-Topiary-0.05 - 19 May 2008 20:45:54 UTC
Parse::RecDescent::Consumer - reveal text matched through n token transitions.
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...TBONE/Parse-RecDescent-Consumer-1.03 - 16 Dec 2001 16:20:03 UTC
GraphViz2::Parse::RecDescent - Visualize a Parse::RecDescent grammar as a graph
Takes a Parse::RecDescent grammar and converts it into a graph. You can write the result in any format supported by Graphviz <http://www.graphviz.org/>. Here is the list of output formats <http://www.graphviz.org/content/output-formats>....ETJ/GraphViz2-Parse-RecDescent-2.52 - 30 Nov 2020 22:31:33 UTC
Parse::RecDescent::Topiary::Base - Base class for autotree constructors
This module provides a method "new" to build hashref objects for autotree classes. See Parse::RecDescent::Topiary for details. new Basic hashref style object constructor. Takes a list of value pairs....IVORW/Parse-RecDescent-Topiary-0.05 - 19 May 2008 20:45:54 UTC
Parse::RecDescent::FAQ::Original - the original, official, authorized FAQ for Parse::RecDescent.
24 Aug 2010 17:09:30 UTC
Bigtop::Grammar - generated by Parse::RecDescent from bigtop.grammar
10 Jul 2010 22:08:44 UTC
Genezzo::Parse::SQL - SQL parser
The SQL parser is a Parse::RecDescent parser generated by 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 handling...JCOHEN/Genezzo-0.72 - 20 Nov 2007 09:13:43 UTC