Generate Recursive-Descent Parsers


Parse::RecDescent incrementally generates top-down recursive-descent
text parsers from simple yacc-like grammar specifications. It
 * Regular expressions or literal strings as terminals (tokens)
 * Multiple (non-contiguous) productions for any rule
 * Repeated and optional subrules within productions
 * Full access to Perl within actions specified as part of the grammar
 * Simple automated error reporting during parser generation and parsing
 * The ability to commit to, uncommit to, or reject particular
   productions during a parse
 * The ability to pass data up and down the parse tree ("down" via
   subrule argument lists, "up" via subrule return values)
 * Incremental extension of the parsing grammar (even during a parse)
 * Precompilation of parser objects
 * User-definable reduce-reduce conflict resolution via "scoring" of
   matching productions
License: GPL+ or Artistic
Vendor: Fedora Project
Group: development/libraries


perl-Parse-RecDescent-1.965-1.el6.noarch [188 KiB] Changelog by Paul Howarth (2011-09-20):
- update to 1.965001
  - fixed subtle bug in leftop and rightop caused by removal of $&
  - fixed bug with undefined $1 when parsing literals
  - fixed premature namespace destruction bug with compiled grammars
  - removed all references to /opt's version of perl interpreter
  - added Parse::RecDescent::redirect_reporting_to() to enable ERROR, TRACE
    and TRACECONTEXT filehandles to be easily redirected
- use a patch rather than scripted iconv to convert files to UTF-8