Generate Recursive-Descent Parsers
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) 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
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.967015-22.fc40 | - |
Fedora 40 | 1.967015-22.fc40 | - |
Fedora 39 | 1.967015-20.fc39 | - |
Fedora 38 | 1.967015-19.fc38 | - |
EPEL 9 | 1.967015-14.el9 | - |
EPEL 8 | 1.967015-6.el8 | - |
You can contact the maintainers of this package via email at
perl-Parse-RecDescent dash maintainers at fedoraproject dot org
.