PPIx::Regexp::Lexer(3) Assemble tokenizer output.


use PPIx::Regexp::Lexer;
use PPIx::Regexp::Dumper;
my $lex = PPIx::Regexp::Lexer->new('qr{foo}smx');
my $dmp = PPIx::Regexp::Dumper->new( $lex );


"PPIx::Regexp::Lexer" is a PPIx::Regexp::Support.

"PPIx::Regexp::Lexer" has no descendants.


This class takes the token stream generated by PPIx::Regexp::Tokenizer and generates the parse tree.


This class provides the following public methods. Methods not documented here are private, and unsupported in the sense that the author reserves the right to change or remove them without notice.


This method instantiates the lexer. It takes as its argument either a PPIx::Regexp::Tokenizer or the text to be parsed. In the latter case the tokenizer is instantiated from the text.

Any optional name/value pairs after the first argument are passed to the tokenizer, which interprets them or not as the case may be.


This method returns the error string from the last attempt to instantiate a "PPIx::Regexp::Lexer". If the last attempt succeeded, the error will be "undef".


 print $lexer->failures(), " parse failures\n";

This method returns the number of parse failures encountered. A parse failure is either a tokenization failure (see PPIx::Regexp::Tokenizer->failures()) or a structural error.


This method lexes the tokens in the text, and returns the lexed list of elements.


This method returns true or false based on the value of the 'strict' argument to "new()".


Support is by the author. Please file bug reports at <http://rt.cpan.org>, or in electronic mail to the author.


Thomas R. Wyant, III wyant at cpan dot org


Copyright (C) 2009-2016 by Thomas R. Wyant, III

This program is free software; you can redistribute it and/or modify it under the same terms as Perl 5.10.0. For more details, see the full text of the licenses in the directory LICENSES.

This program is distributed in the hope that it will be useful, but without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose.