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

This is an abstract class used by "Parse::Lex" and "Parse::CLex"....

See the "Parse::Lex" documentation....

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

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

Parse::Flex works similar to Parse::Lex, but it uses XS for faster performance. This module allows you to construct a lexer analyzer with your custom rules. Parse::Flex is not intended to be used directly; instead, use the script makelexer.pl to subm...

The "Parse::Template" class evaluates Perl expressions placed within a text. This class can be used as a code generator, or a generator of documents in various document formats (HTML, XML, RTF, etc.). The principle of template-based text generation i...

Stallion parses and evaluates a string using entered grammar rules. The parsing is done top-down via a start rule, in a depth first search forming a parse tree. When a rule does not match the parser backtracks to a node that has another option. For e...

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

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