Search results for "module:Parse::Lex"
Parse::Lex - Generator of lexical analyzers - moving pointer inside text
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"...
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::ALex - Generator of lexical analyzers - abstract class
This is an abstract class used by "Parse::Lex" and "Parse::CLex"....
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::CLex - Generator of lexical analyzers - consuming recoginzed data
See the "Parse::Lex" documentation....
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::YYLex - Version of Parse::Lex to be used by a byacc parser.
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...
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::Trace - Trace functions used by the lexical analyzers
PSCUST/ParseLex-2.21
-
31 Dec 2011 11:34:09 UTC
Parse::LexEvent - Generator of event-oriented lexical analyzers (1.00 ALPHA)
"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 ...
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::Token - Definition of tokens used by Parse::Lex
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...
PSCUST/ParseLex-2.21 - 31 Dec 2011 11:34:09 UTC
Parse::Token::Lite - Simply parse String into tokens with rules which are similar to Lex.
KHS/Parse-Token-Lite-0.200
-
20 Feb 2014 19:05:39 UTC
Parse::Flex - The Fastest Lexer in the West
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...
IOANNIS/Parse-Flex-0.12 - 27 Jul 2008 02:53:29 UTC
Unisyn::Parse - Parse a Unisyn expression.
Parse a Unisyn expression. Version "20211013". The following sections describe the methods in each functional area of this module. For an alphabetic listing of all methods by name see Index....
PRBRENAN/Unisyn-Parse-20211013 - 13 Oct 2021 19:35:06 UTC
Parse::Template - Processor for templates containing Perl expressions
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...
PSCUST/ParseTemplate-3.08 - 28 Feb 2012 19:28:17 UTC
Parse::Stallion - EBNF based regexp backtracking parser and tree evaluator.
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...
ARTHUR/Parse-Stallion-2.01 - 28 Jan 2012 18:27:13 UTC
Parse::FSM::Lexer - Companion Lexer for the Parse::FSM parser
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...
PSCUST/Parse-FSM-1.13 - 16 May 2016 19:57:45 UTC
Parse::RecDescent - Generate Recursive-Descent Parsers
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...
JTBRAUN/Parse-RecDescent-1.967015 - 04 Apr 2017 14:54:55 UTC