p5.30-parse-recdescent (perl/p5-parse-recdescent) Add to my watchlist
Generate Recursive-Descent ParsersRecDescent 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, optional and alternate subrules within productions, * Late-bound (run-time dispatched) subrules * 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, * 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. See the file RecDescent.pod for excruciating detail on all of this.
Version: 1.967.15 License: (Artistic-1 or GPL)
GitHub
8 build(s) found
| Builder | Build Number | Start Time | Elapsed Time | Watcher | Build Status |
|---|---|---|---|---|---|
| 12.arm64 | 69855 | 2022-11-09 0:08:19 | 0:00:13 | 13806 | build successful |
| 12.arm64 | 9810 | 2021-11-10 11:34:10 | 0:00:22 | 724 | build successful |
| 10.13 | 66224 | 2019-10-11 14:34:32 | 0:01:43 | 19155 | build successful |
| 10.14 | 40551 | 2019-10-10 20:14:45 | 0:01:46 | 9871 | build successful |
| 10.11 | 96455 | 2019-10-10 20:01:50 | 0:01:40 | 28195 | build successful |
| 10.12 | 100937 | 2019-10-10 20:01:50 | 0:01:50 | 27176 | build successful |
| 10.10 | 97090 | 2019-10-10 17:49:52 | 0:01:30 | 28237 | build successful |
| 10.9 | 99801 | 2019-10-10 17:22:25 | 0:01:15 | 28181 | build successful |