"Parse::Tokens" provides a base class for parsing delimited strings from text blocks. Use "Parse::Tokens" as a base class for your own module or script. Very similar in style to "HTML::Parser"....

The "Parse::Token" class and its derived classes permit defining the tokens used by "Parse::Lex" or "Parse::LexEvent". The creation of tokens can be done by means of the "new()" or "factory()" methods. The "Lex::new()" method of the "Parse::Lex" pack...

This module compiles the Finite State Machine used by the Parse::FSM::Driver parser module. It can be used by a sequence of "add_rule" calls, or by parsing a yacc-like grammar in one go with "parse_grammar". It can be used as a script to generate a m...

The classes "Parse::Lex" and "Parse::CLex" create lexical analyzers. They use different analysis techniques: 1. "Parse::Lex" steps through the analysis by moving a pointer within the character strings to be analyzed (use of "pos()" together with "\G"...

Parse::Yapp (Yet Another Perl Parser compiler) is a collection of modules that let you generate and use yacc like thread safe (reentrant) parsers with perl object oriented interface. The script yapp is a front-end to the Parse::Yapp module and let yo...

Presents a visual display of a LALR parser in action....

Often times you'd use a lexer in conjunction with a parser. And most of the time you'd want to generate that parser with a yacc parser generator. Parse::YYLex is a derivative of *Parse::Lex* compatible with yacc parsers, by adapting it to the byacc c...

This module is a (PCFG | SCFG) parser. You may use this module to do stochastic parsing....

"Parse::LexEvent" generates lexical analyzers in the fashion of "Parse::Lex", but the generated analyzers emit an event at the finish of recognition of each token. This event corresponds to the call of a procedure whose name is that of the token. It ...

The PerlPoint format, initially designed by Tom Christiansen, is intended to provide a simple and portable way to generate slides without the need of a proprietary product. Slides can be prepared in a text editor of your choice, generated on any plat...

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...

This module implements a generic tokenizer that can be used by Parse::FSM parsers, and can also be used standalone independently of the parser. It supports recursive file includes and takes track of current file name and line number. It keeps the pat...

Parse::PlainConfig provides a simple way to write a config object class that supports all the basic primitive data types (scalar, array, and hashes) while allowing for arbitrary delimiters, comment characters, and more. The use of a __DATA__ block to...

This module provides a virtual base class for query parsers. It defines the "prepare" method that is called by the "Text::Query" object to compile the query string....

This module implements a deterministic top-down parser based on a pre-computed Finite State Machine (FSM). The FSM is generated by Parse::FSM, by reading a BNF-type grammar file and generating a run-time module that includes the state tables. The mod...

See Parse::RecDescent's documentation. This section lists what is similar to Parse::RecDescent and what is not. Features implemented with noted differences and rules or rules (|) rules defined on different lines single quotes double quotes (with inte...

parse a string of simple key/value pairs and store the results in a hash reference for easy access. Parse::KeyValue correctly handles escaped quotes as well as escaped backslashes. Parse::KeyValue will parse the following example string: AL=53 AK=54 ...

The module parses a limited set of natural language expressions and converts them into seconds. It is backwards compatible with Time::Duration::Parse (passes the same test cases), but adds more expressions and memoization. At the moment, the module i...