Source for file Parser.php
Documentation is available at Parser.php
/* Driver template for the PHP_PHP_LexerGenerator_ParserrGenerator parser generator. (PHP port of LEMON)
* This can be used to store both the string representation of
* a token, and any useful meta-data associated with the token.
* meta-data should be stored as an array
$value->metadata : $value;
$this->metadata[$offset] = $value->metadata;
/** The following structure represents a single element of the
* parser's stack. Information stored includes:
* + The state number for the parser at this level of the stack.
* + The value of the token stored at this level of the stack.
* (In other words, the "major" token.)
* + The semantic value stored at this level of the stack. This is
* the information used by the action routines in the grammar.
* It is sometimes called the "minor" token.
public $major; /* The major token value. This is the code
** number for the token at this stack level */
public $minor; /* The user-supplied minor token value. This
** is the value of the token */
// code external to the class is included here
* PHP_LexerGenerator, a php 5 lexer generator.
* This lexer generator translates a file in a format similar to
* re2c ({@link http://re2c.org}) and translates it into a PHP 5-based lexer
* Copyright (c) 2006, Gregory Beaver <cellog@php.net>
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the distribution.
* * Neither the name of the PHP_LexerGenerator nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
* @package PHP_LexerGenerator
* @author Gregory Beaver <cellog@php.net>
* @copyright 2006 Gregory Beaver
* @license http://www.opensource.org/licenses/bsd-license.php New BSD License
* @since File available since Release 0.1.0
* For regular expression validation
require_once 'PHP/LexerGenerator/Regex/Lexer.php';
require_once 'PHP/LexerGenerator/Regex/Parser.php';
require_once 'PHP/LexerGenerator/Exception.php';
* Token parser for plex files.
* This parser converts tokens pulled from {@link PHP_LexerGenerator_Lexer}
* into abstract patterns and rules, then creates the output file
* @package PHP_LexerGenerator
* @author Gregory Beaver <cellog@php.net>
* @copyright 2006 Gregory Beaver
* @license http://www.php.net/license/3_01.txt PHP License 3.01
* @version @package_version@
* @since Class available since Release 0.1.0
// declare_class is output here
/* First off, code is included which follows the "include_class" declaration
private $_patternIndex = 0;
$this->out = fopen($outfile, 'wb');
throw new Exception('unable to open lexer output file "' . $outfile . '"');
foreach ($rules as $rule) {
$ruleMap[$i++ ] = $actualindex;
$tokenindex[$actualindex] = $rule['subpatterns'];
$actualindex += $rule['subpatterns'] + 1;
$patterns[] = '^(' . $rule['pattern'] . ')';
$tokenindex = var_export($tokenindex, true);
$tokenindex = explode("\n", $tokenindex);
$tokenindex = implode("\n ", $tokenindex);
$pattern .= implode('|', $patterns);
function yylex' . $ruleindex . '()
$tokenMap = ' . $tokenindex . ';
if (' . $this->counter . ' >= strlen(' . $this->input . ')) {
return false; // end of input
fwrite($this->out, '$yy_global_pattern = "' .
if (preg_match($yy_global_pattern, substr(' . $this->input . ', ' .
$yysubmatches = $yymatches;
$yymatches = array_filter($yymatches, \'strlen\'); // remove empty sub-patterns
if (!count($yymatches)) {
throw new Exception(\'Error: lexing failed because a rule matched\' .
\'an empty string. Input "\' . substr(' . $this->input . ',
' . $this->counter . ', 5) . \'... state ' . $statename . '\');
next($yymatches); // skip global match
' . $this->token . ' = key($yymatches); // token number
if ($tokenMap[' . $this->token . ']) {
// extract sub-patterns for passing to lex function
$yysubmatches = array_slice($yysubmatches, ' . $this->token . ' + 1,
$tokenMap[' . $this->token . ']);
' . $this->value . ' = current($yymatches); // token value
$r = $this->{\'yy_r' . $ruleindex . '_\' . ' . $this->token . '}($yysubmatches);
' . $this->counter . ' += strlen($this->value);
' . $this->line . ' += substr_count("\n", ' . $this->value . ');
// process this token in the new state
} elseif ($r === false) {
' . $this->counter . ' += strlen($this->value);
' . $this->line . ' += substr_count("\n", ' . $this->value . ');
if (' . $this->counter . ' >= strlen(' . $this->input . ')) {
return false; // end of input
fwrite($this->out, ' $yy_yymore_patterns = array(' . "\n");
for($i = 0; count($patterns); $i++ ) {
fwrite($this->out, ' ' . $ruleMap[$i] . ' => "' .
implode('|', $patterns) . "\",\n");
fwrite($this->out, ' );' . "\n");
if (!strlen($yy_yymore_patterns[' . $this->token . '])) {
throw new Exception(\'cannot do yymore for the last token\');
if (preg_match($yy_yymore_patterns[' . $this->token . '],
substr(' . $this->input . ', ' . $this->counter . '), $yymatches)) {
$yymatches = array_filter($yymatches, \'strlen\'); // remove empty sub-patterns
next($yymatches); // skip global match
' . $this->token . ' = key($yymatches); // token number
' . $this->value . ' = current($yymatches); // token value
' . $this->line . ' = substr_count("\n", ' . $this->value . ');
} while ($this->{\'yy_r' . $ruleindex . '_\' . ' . $this->token . '}() !== null);
' . $this->counter . ' += strlen($this->value);
' . $this->line . ' += substr_count("\n", ' . $this->value . ');
throw new Exception(\'Unexpected input at line\' . ' . $this->line . ' .
\': \' . ' . $this->input . '[' . $this->counter . ']);
const ' . $statename . ' = ' . $ruleindex . ';
foreach ($rules as $i => $rule) {
fwrite($this->out, ' function yy_r' . $ruleindex . '_' . $ruleMap[$i] . '($yy_subpatterns)
$ruleindex++ ; // for next set of rules
echo 'Error on line ' . $this->lex->line . ': ' , $msg;
$this->_regexLexer->reset($pattern);
$this->_regexParser->reset($this->_patternIndex, $update);
while ($this->_regexLexer->yylex()) {
$this->_regexLexer->token, $this->_regexLexer->value);
$this->_regexParser->doParse(0, 0);
$this->error($e->getMessage());
return $this->_regexParser->result;
/* Next is all token values, as class constants
** These constants (all generated automatically by the parser generator)
** specify the various kinds of tokens (terminals) that the parser
** Each symbol here is a terminal symbol in the grammar.
/* Next are that tables used to determine what action to take based on the
** current state and lookahead token. These tables are used to implement
** functions that take a state number and lookahead value and return an
** Suppose the action integer is N. Then the action is determined as
** 0 <= N < self::YYNSTATE Shift N. That is,
** self::YYNSTATE <= N < self::YYNSTATE+self::YYNRULE Reduce by rule N-YYNSTATE.
** N == self::YYNSTATE+self::YYNRULE A syntax error has occurred.
** N == self::YYNSTATE+self::YYNRULE+1 The parser accepts its
** input. (and concludes parsing)
** N == self::YYNSTATE+self::YYNRULE+2 No such action. Denotes unused
** slots in the yy_action[] table.
** The action table is constructed as a single large static array $yy_action.
** Given state S and lookahead X, the action is computed as
** self::$yy_action[self::$yy_shift_ofst[S] + X ]
** If the index value self::$yy_shift_ofst[S]+X is out of range or if the value
** self::$yy_lookahead[self::$yy_shift_ofst[S]+X] is not equal to X or if
** self::$yy_shift_ofst[S] is equal to self::YY_SHIFT_USE_DFLT, it means that
** the action is not in the table and that self::$yy_default[S] should be used instead.
** The formula above is for computing the action when the lookahead is
** a terminal symbol. If the lookahead is a non-terminal (as occurs after
** a reduce action) then the static $yy_reduce_ofst array is used in place of
** the static $yy_shift_ofst array and self::YY_REDUCE_USE_DFLT is used in place of
** self::YY_SHIFT_USE_DFLT.
** The following are the tables generated in this section:
** self::$yy_action A single table containing all actions.
** self::$yy_lookahead A table containing the lookahead for each entry in
** yy_action. Used to detect hash collisions.
** self::$yy_shift_ofst For each state, the offset into self::$yy_action for
** self::$yy_reduce_ofst For each state, the offset into self::$yy_action for
** shifting non-terminals after a reduce.
** self::$yy_default Default action for each state.
static public $yy_action = array(
/* 0 */ 35, 24, 50, 50, 48, 51, 51, 54, 47, 43,
/* 10 */ 53, 54, 45, 31, 53, 32, 30, 50, 50, 1,
/* 20 */ 51, 51, 34, 50, 17, 8, 51, 90, 52, 6,
/* 30 */ 3, 29, 50, 50, 25, 51, 51, 11, 38, 18,
/* 40 */ 1, 41, 42, 39, 10, 36, 18, 12, 37, 18,
/* 50 */ 20, 7, 2, 16, 13, 15, 18, 27, 9, 2,
/* 60 */ 5, 28, 14, 1, 44, 40, 33, 49, 56, 46,
/* 70 */ 26, 19, 1, 55, 2, 21, 4, 23, 22, 8,
static public $yy_lookahead = array(
/* 0 */ 3, 3, 5, 5, 1, 8, 8, 5, 6, 2,
/* 10 */ 8, 5, 6, 13, 8, 3, 3, 5, 5, 19,
/* 20 */ 8, 8, 4, 5, 1, 2, 8, 10, 11, 12,
/* 30 */ 5, 4, 5, 5, 13, 8, 8, 18, 5, 20,
/* 40 */ 19, 8, 5, 6, 18, 5, 20, 18, 8, 20,
/* 50 */ 4, 1, 2, 7, 18, 7, 20, 13, 1, 2,
/* 60 */ 5, 14, 15, 19, 5, 6, 13, 1, 1, 1,
/* 70 */ 16, 20, 19, 3, 2, 17, 12, 4, 17, 2,
static public $yy_shift_ofst = array(
/* 0 */ 23, 27, 18, 28, 50, 28, 57, 72, 73, 72,
/* 10 */ 13, 12, - 3, - 2, 46, 40, 40, 77, 2, 6,
/* 20 */ 59, 33, 33, 37, 3, 7, 48, 7, 70, 55,
/* 30 */ 68, 7, 67, 7, 25, 66,
static public $yy_reduce_ofst = array(
/* 0 */ 17, 29, 19, 26, 21, 36, 53, 44, 47, 0,
/* 10 */ 51, 51, 51, 51, 54, 58, 61, 64,
static public $yyExpectedTokens = array(
/* 1 */ array(4, 5, 8, ),
/* 2 */ array(4, 5, 8, ),
/* 10 */ array(3, 5, 8, ),
/* 11 */ array(3, 5, 8, ),
/* 12 */ array(3, 5, 8, ),
/* 13 */ array(3, 5, 8, ),
/* 18 */ array(5, 6, 8, ),
/* 19 */ array(5, 6, 8, ),
static public $yy_default = array(
/* 0 */ 89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
/* 10 */ 89, 89, 89, 89, 89, 89, 89, 89, 89, 89,
/* 20 */ 89, 69, 68, 89, 75, 60, 63, 61, 89, 89,
/* 30 */ 71, 59, 70, 58, 89, 74, 86, 85, 88, 65,
/* 40 */ 67, 87, 64, 78, 66, 80, 73, 79, 77, 76,
/* 50 */ 82, 81, 57, 83, 84, 62, 72,
/* The next thing included is series of defines which control
** various aspects of the generated parser.
** self::YYNOCODE is a number which corresponds
** to no legal terminal or nonterminal number. This
** number is used to fill in empty slots of the hash
** self::YYFALLBACK If defined, this indicates that one or more tokens
** have fall-back values which should be used if the
** original value of the token will not parse.
** self::YYSTACKDEPTH is the maximum depth of the parser's stack.
** self::YYNSTATE the combined number of states.
** self::YYNRULE the number of rules in the grammar
** self::YYERRORSYMBOL is the code number of the error symbol. If not
** defined, then do no error processing.
/** The next table maps tokens into fallback tokens. If a construct
* appears in the grammer, then ID becomes a fallback token for X, Y,
* and Z. Whenever one of the tokens X, Y, or Z is input to the parser
* but it does not parse, the type of the token is changed to ID and
* the parse is retried before an error is thrown.
static public $yyFallback = array(
* Turn parser tracing on by giving a stream to which to write the trace
* and a prompt to preface each trace message. Tracing is turned off
* by making either argument NULL
* - A stream resource to which trace output should be written.
* If NULL, then tracing is turned off.
* - A prefix string written at the beginning of every
* line of trace output. If NULL, then tracing is
static function Trace($TraceFILE, $zTracePrompt)
} elseif (!$zTracePrompt) {
self::$yyTraceFILE = $TraceFILE;
self::$yyTracePrompt = $zTracePrompt;
* Output debug information to output (php://output stream)
static function PrintTrace()
self::$yyTraceFILE = fopen('php://output', 'w');
self::$yyTracePrompt = '';
static public $yyTraceFILE;
* String to prepend to debug output
static public $yyTracePrompt;
public $yyidx; /* Index of top element in stack */
public $yyerrcnt; /* Shifts left before out of the error */
public $yystack = array(); /* The parser's stack */
* For tracing shifts, the names of all terminals and nonterminals
* are required. The following table supplies these names
static public $yyTokenName = array(
'$', 'PHPCODE', 'COMMENTSTART', 'COMMENTEND',
'PI', 'SUBPATTERN', 'CODE', 'PATTERN',
'QUOTE', 'error', 'start', 'lexfile',
'declare', 'rules', 'declarations', 'processing_instructions',
'pattern_declarations', 'subpattern', 'rule', 'reset_rules',
* For tracing reduce actions, the names of all rules are required.
static public $yyRuleName = array(
/* 0 */ "start ::= lexfile",
/* 1 */ "lexfile ::= declare rules",
/* 2 */ "lexfile ::= declare PHPCODE rules",
/* 3 */ "lexfile ::= PHPCODE declare rules",
/* 4 */ "lexfile ::= PHPCODE declare PHPCODE rules",
/* 5 */ "declare ::= COMMENTSTART declarations COMMENTEND",
/* 6 */ "declarations ::= processing_instructions pattern_declarations",
/* 7 */ "processing_instructions ::= PI SUBPATTERN",
/* 8 */ "processing_instructions ::= PI CODE",
/* 9 */ "processing_instructions ::= processing_instructions PI SUBPATTERN",
/* 10 */ "processing_instructions ::= processing_instructions PI CODE",
/* 11 */ "pattern_declarations ::= PATTERN subpattern",
/* 12 */ "pattern_declarations ::= pattern_declarations PATTERN subpattern",
/* 13 */ "rules ::= COMMENTSTART rule COMMENTEND",
/* 14 */ "rules ::= COMMENTSTART PI SUBPATTERN rule COMMENTEND",
/* 15 */ "rules ::= COMMENTSTART rule COMMENTEND PHPCODE",
/* 16 */ "rules ::= COMMENTSTART PI SUBPATTERN rule COMMENTEND PHPCODE",
/* 17 */ "rules ::= reset_rules rule COMMENTEND",
/* 18 */ "rules ::= reset_rules PI SUBPATTERN rule COMMENTEND",
/* 19 */ "rules ::= reset_rules rule COMMENTEND PHPCODE",
/* 20 */ "rules ::= reset_rules PI SUBPATTERN rule COMMENTEND PHPCODE",
/* 21 */ "reset_rules ::= rules COMMENTSTART",
/* 22 */ "rule ::= rule_subpattern CODE",
/* 23 */ "rule ::= rule rule_subpattern CODE",
/* 24 */ "rule_subpattern ::= QUOTE",
/* 25 */ "rule_subpattern ::= SUBPATTERN",
/* 26 */ "rule_subpattern ::= rule_subpattern QUOTE",
/* 27 */ "rule_subpattern ::= rule_subpattern SUBPATTERN",
/* 28 */ "subpattern ::= QUOTE",
/* 29 */ "subpattern ::= SUBPATTERN",
/* 30 */ "subpattern ::= subpattern QUOTE",
/* 31 */ "subpattern ::= subpattern SUBPATTERN",
* This function returns the symbolic name associated with a token
function tokenName($tokenType)
if ($tokenType > 0 && $tokenType < count(self::$yyTokenName)) {
return self::$yyTokenName[$tokenType];
* The following function deletes the value associated with a
* symbol. The symbol can be either a terminal or nonterminal.
* @param int the symbol code
* @param mixed the symbol's value
static function yy_destructor($yymajor, $yypminor)
/* Here is inserted the actions which take place when a
** terminal or non-terminal is destroyed. This can happen
** when the symbol is popped from the stack during a
** reduce or during error processing or when a parser is
** being destroyed before it is finished parsing.
** Note: during a reduce, the only symbols destroyed are those
** which appear on the RHS of the rule, but which are not used
default: break; /* If no destructor action specified: do nothing */
* Pop the parser's stack once.
* If there is a destructor routine associated with the token which
* is popped from the stack, then call it.
* Return the major token number for the symbol popped.
* @param PHP_LexerGenerator_ParseryyParser
if (self::$yyTraceFILE && $this->yyidx >= 0) {
self::$yyTracePrompt . 'Popping ' . self::$yyTokenName[$yytos->major] .
$yymajor = $yytos->major;
self::yy_destructor($yymajor, $yytos->minor);
* Deallocate and destroy a parser. Destructors are all called for
* all stack elements before shutting the parser down.
while ($this->yyidx >= 0) {
fclose(self::$yyTraceFILE);
* Based on the current state and parser stack, get a list of all
* possible lookahead tokens
function yy_get_expected_tokens($token)
$expected = self::$yyExpectedTokens[$state];
if (in_array($token, self::$yyExpectedTokens[$state], true)) {
if ($yyact >= self::YYNSTATE && $yyact < self::YYNSTATE + self::YYNRULE) {
// too much recursion prevents proper detection
$yyruleno = $yyact - self::YYNSTATE;
$this->yyidx -= self::$yyRuleInfo[$yyruleno]['rhs'];
$nextstate = $this->yy_find_reduce_action(
self::$yyRuleInfo[$yyruleno]['lhs']);
if (isset (self::$yyExpectedTokens[$nextstate])) {
$expected += self::$yyExpectedTokens[$nextstate];
self::$yyExpectedTokens[$nextstate], true)) {
if ($nextstate < self::YYNSTATE) {
// we need to shift a non-terminal
$x->stateno = $nextstate;
$x->major = self::$yyRuleInfo[$yyruleno]['lhs'];
$this->yystack[$this->yyidx] = $x;
} elseif ($nextstate == self::YYNSTATE + self::YYNRULE + 1) {
// the last token was just ignored, we can't accept
// by ignoring input, this is in essence ignoring a
} elseif ($nextstate === self::YY_NO_ACTION) {
// input accepted, but not shifted (I guess)
* Based on the parser state and current parser stack, determine whether
* the lookahead token is possible.
* The parser will convert the token value to an error token if not. This
* catches some unusual edge cases where the parser would fail.
return true; // 0 is not part of this
if (in_array($token, self::$yyExpectedTokens[$state], true)) {
if ($yyact >= self::YYNSTATE && $yyact < self::YYNSTATE + self::YYNRULE) {
// too much recursion prevents proper detection
$yyruleno = $yyact - self::YYNSTATE;
$this->yyidx -= self::$yyRuleInfo[$yyruleno]['rhs'];
$nextstate = $this->yy_find_reduce_action(
self::$yyRuleInfo[$yyruleno]['lhs']);
if (isset (self::$yyExpectedTokens[$nextstate]) &&
in_array($token, self::$yyExpectedTokens[$nextstate], true)) {
if ($nextstate < self::YYNSTATE) {
// we need to shift a non-terminal
$x->stateno = $nextstate;
$x->major = self::$yyRuleInfo[$yyruleno]['lhs'];
$this->yystack[$this->yyidx] = $x;
} elseif ($nextstate == self::YYNSTATE + self::YYNRULE + 1) {
// end of input: this is valid
// the last token was just ignored, we can't accept
// by ignoring input, this is in essence ignoring a
} elseif ($nextstate === self::YY_NO_ACTION) {
// input accepted, but not shifted (I guess)
* Find the appropriate action for a parser given the terminal
* look-ahead token iLookAhead.
* If the look-ahead token is YYNOCODE, then check to see if the action is
* independent of the look-ahead. If it is, return the action, otherwise
* @param int The look-ahead token
/* if ($this->yyidx < 0) return self::YY_NO_ACTION; */
if (!isset (self::$yy_shift_ofst[$stateno])) {
return self::$yy_default[$stateno];
$i = self::$yy_shift_ofst[$stateno];
if ($i === self::YY_SHIFT_USE_DFLT) {
return self::$yy_default[$stateno];
if ($iLookAhead == self::YYNOCODE) {
return self::YY_NO_ACTION;
if ($i < 0 || $i >= self::YY_SZ_ACTTAB ||
self::$yy_lookahead[$i] != $iLookAhead) {
if (count(self::$yyFallback) && $iLookAhead < count(self::$yyFallback)
&& ($iFallback = self::$yyFallback[$iLookAhead]) != 0) {
if (self::$yyTraceFILE) {
fwrite(self::$yyTraceFILE, self::$yyTracePrompt . "FALLBACK " .
self::$yyTokenName[$iLookAhead] . " => " .
self::$yyTokenName[$iFallback] . "\n");
return $this->yy_find_shift_action($iFallback);
return self::$yy_default[$stateno];
return self::$yy_action[$i];
* Find the appropriate action for a parser given the non-terminal
* look-ahead token $iLookAhead.
* If the look-ahead token is self::YYNOCODE, then check to see if the action is
* independent of the look-ahead. If it is, return the action, otherwise
* return self::YY_NO_ACTION.
* @param int Current state number
* @param int The look-ahead token
function yy_find_reduce_action($stateno, $iLookAhead)
/* $stateno = $this->yystack[$this->yyidx]->stateno; */
if (!isset (self::$yy_reduce_ofst[$stateno])) {
return self::$yy_default[$stateno];
$i = self::$yy_reduce_ofst[$stateno];
if ($i == self::YY_REDUCE_USE_DFLT) {
return self::$yy_default[$stateno];
if ($iLookAhead == self::YYNOCODE) {
return self::YY_NO_ACTION;
if ($i < 0 || $i >= self::YY_SZ_ACTTAB ||
self::$yy_lookahead[$i] != $iLookAhead) {
return self::$yy_default[$stateno];
return self::$yy_action[$i];
* Perform a shift action.
* @param int The new state to shift in
* @param int The major token to shift in
* @param mixed the minor token to shift in
function yy_shift($yyNewState, $yyMajor, $yypMinor)
if ($this->yyidx >= self::YYSTACKDEPTH) {
if (self::$yyTraceFILE) {
fprintf(self::$yyTraceFILE, "%sStack Overflow!\n", self::$yyTracePrompt);
while ($this->yyidx >= 0) {
/* Here code is inserted which will execute if the parser
** stack ever overflows */
$yytos->stateno = $yyNewState;
$yytos->major = $yyMajor;
$yytos->minor = $yypMinor;
if (self::$yyTraceFILE && $this->yyidx > 0) {
fprintf(self::$yyTraceFILE, "%sShift %d\n", self::$yyTracePrompt,
fprintf(self::$yyTraceFILE, "%sStack:", self::$yyTracePrompt);
for($i = 1; $i <= $this->yyidx; $i++ ) {
self::$yyTokenName[$this->yystack[$i]->major]);
fwrite(self::$yyTraceFILE,"\n");
* The following table contains information about every rule that
* is used during the reduce.
* int $lhs; Symbol on the left-hand side of the rule
* int $nrhs; Number of right-hand side symbols in the rule
static public $yyRuleInfo = array(
array( 'lhs' => 10, 'rhs' => 1 ),
array( 'lhs' => 11, 'rhs' => 2 ),
array( 'lhs' => 11, 'rhs' => 3 ),
array( 'lhs' => 11, 'rhs' => 3 ),
array( 'lhs' => 11, 'rhs' => 4 ),
array( 'lhs' => 12, 'rhs' => 3 ),
array( 'lhs' => 14, 'rhs' => 2 ),
array( 'lhs' => 15, 'rhs' => 2 ),
array( 'lhs' => 15, 'rhs' => 2 ),
array( 'lhs' => 15, 'rhs' => 3 ),
array( 'lhs' => 15, 'rhs' => 3 ),
array( 'lhs' => 16, 'rhs' => 2 ),
array( 'lhs' => 16, 'rhs' => 3 ),
array( 'lhs' => 13, 'rhs' => 3 ),
array( 'lhs' => 13, 'rhs' => 5 ),
array( 'lhs' => 13, 'rhs' => 4 ),
array( 'lhs' => 13, 'rhs' => 6 ),
array( 'lhs' => 13, 'rhs' => 3 ),
array( 'lhs' => 13, 'rhs' => 5 ),
array( 'lhs' => 13, 'rhs' => 4 ),
array( 'lhs' => 13, 'rhs' => 6 ),
array( 'lhs' => 19, 'rhs' => 2 ),
array( 'lhs' => 18, 'rhs' => 2 ),
array( 'lhs' => 18, 'rhs' => 3 ),
array( 'lhs' => 20, 'rhs' => 1 ),
array( 'lhs' => 20, 'rhs' => 1 ),
array( 'lhs' => 20, 'rhs' => 2 ),
array( 'lhs' => 20, 'rhs' => 2 ),
array( 'lhs' => 17, 'rhs' => 1 ),
array( 'lhs' => 17, 'rhs' => 1 ),
array( 'lhs' => 17, 'rhs' => 2 ),
array( 'lhs' => 17, 'rhs' => 2 ),
* The following table contains a mapping of reduce action to method name
* that handles the reduction.
* If a rule is not set, it has no handler.
static public $yyReduceMap = array(
/* Beginning here are the reduction cases. A typical example
** #line <lineno> <grammarfile>
** function yy_r0($yymsp){ ... } // User supplied code
** #line <lineno> <thisfile>
private $_yy_stack = array();
return $this->{\'yylex\' . $this->_yy_state}();
function yypushstate($state)
array_push($this->_yy_stack, $this->_yy_state);
$this->_yy_state = $state;
$this->_yy_state = array_pop($this->_yy_stack);
$this->_yy_state = $state;
foreach ($this->yystack[$this->yyidx + 0]->minor as $rule) {
$this->outputRules($rule['rules'], $rule['statename']);
fwrite($this->out, $rule['code']);
private $_yy_stack = array();
return $this->{\'yylex\' . $this->_yy_state}();
function yypushstate($state)
array_push($this->_yy_stack, $this->_yy_state);
$this->_yy_state = $state;
$this->_yy_state = array_pop($this->_yy_stack);
$this->_yy_state = $state;
foreach ($this->yystack[$this->yyidx + 0]->minor as $rule) {
$this->outputRules($rule['rules'], $rule['statename']);
fwrite($this->out, $rule['code']);
private $_yy_stack = array();
return $this->{\'yylex\' . $this->_yy_state}();
function yypushstate($state)
array_push($this->_yy_stack, $this->_yy_state);
$this->_yy_state = $state;
$this->_yy_state = array_pop($this->_yy_stack);
$this->_yy_state = $state;
foreach ($this->yystack[$this->yyidx + 0]->minor as $rule) {
$this->outputRules($rule['rules'], $rule['statename']);
fwrite($this->out, $rule['code']);
private $_yy_stack = array();
return $this->{\'yylex\' . $this->_yy_state}();
function yypushstate($state)
array_push($this->_yy_stack, $this->_yy_state);
$this->_yy_state = $state;
$this->_yy_state = array_pop($this->_yy_stack);
$this->_yy_state = $state;
foreach ($this->yystack[$this->yyidx + 0]->minor as $rule) {
$this->outputRules($rule['rules'], $rule['statename']);
fwrite($this->out, $rule['code']);
$this->_retvalue = $this->yystack[$this->yyidx + - 1]->minor;
$this->patterns = $this->yystack[$this->yyidx + - 1]->minor['patterns'];
$this->_patternIndex = 1;
if (isset ($expected[$pi['pi']])) {
unset ($expected[$pi['pi']]);
throw new Exception('Processing Instructions "' .
if (isset ($expected[$pi['pi']])) {
$this->{$pi['pi']} = $pi['definition'];
$this->error('Unknown processing instruction %' . $pi['pi'] .
$this->_retvalue = array('patterns' => $this->yystack[$this->yyidx + 0]->minor, 'pis' => $this->yystack[$this->yyidx + - 1]->minor);
$this->_patternIndex = 1;
$this->_retvalue = array(array('pi' => $this->yystack[$this->yyidx + - 1]->minor, 'definition' => $this->yystack[$this->yyidx + 0]->minor));
$this->_retvalue = $this->yystack[$this->yyidx + - 2]->minor;
$this->_retvalue[] = array('pi' => $this->yystack[$this->yyidx + - 1]->minor, 'definition' => $this->yystack[$this->yyidx + 0]->minor);
// reset internal indicator of where we are in a pattern
$this->_patternIndex = 0;
$this->_retvalue = $this->yystack[$this->yyidx + - 2]->minor;
if (isset ($this->_retvalue[$this->yystack[$this->yyidx + - 1]->minor])) {
throw new Exception('Pattern "' . $this->yystack[$this->yyidx + - 1]->minor . '" is already defined as "' .
$this->_retvalue[$this->yystack[$this->yyidx + - 1]->minor] . '", cannot redefine as "' . $this->yystack[$this->yyidx + 0]->minor->string . '"');
// reset internal indicator of where we are in a pattern declaration
$this->_patternIndex = 0;
$this->_retvalue = array(array('rules' => $this->yystack[$this->yyidx + - 1]->minor, 'code' => '', 'statename' => ''));
if ($this->yystack[$this->yyidx + - 3]->minor != 'statename') {
throw new Exception('Error: only %statename processing instruction ' .
'is allowed in rule sections');
$this->_retvalue = array(array('rules' => $this->yystack[$this->yyidx + - 1]->minor, 'code' => '', 'statename' => $this->yystack[$this->yyidx + - 2]->minor));
$this->_retvalue = array(array('rules' => $this->yystack[$this->yyidx + - 2]->minor, 'code' => $this->yystack[$this->yyidx + 0]->minor, 'statename' => ''));
if ($this->yystack[$this->yyidx + - 4]->minor != 'statename') {
throw new Exception('Error: only %statename processing instruction ' .
'is allowed in rule sections');
$this->_retvalue = array(array('rules' => $this->yystack[$this->yyidx + - 2]->minor, 'code' => $this->yystack[$this->yyidx + 0]->minor, 'statename' => $this->yystack[$this->yyidx + - 3]->minor));
$this->_patternIndex = 1;
$this->_retvalue = $this->yystack[$this->yyidx + - 2]->minor;
$this->_retvalue[] = array('rules' => $this->yystack[$this->yyidx + - 1]->minor, 'code' => '', 'statename' => '');
$this->_patternIndex = 1;
if ($this->yystack[$this->yyidx + - 3]->minor != 'statename') {
throw new Exception('Error: only %statename processing instruction ' .
'is allowed in rule sections');
$this->_retvalue = $this->yystack[$this->yyidx + - 4]->minor;
$this->_retvalue[] = array('rules' => $this->yystack[$this->yyidx + - 1]->minor, 'code' => '', 'statename' => $this->yystack[$this->yyidx + - 2]->minor);
$this->_retvalue = $this->yystack[$this->yyidx + - 3]->minor;
$this->_retvalue[] = array('rules' => $this->yystack[$this->yyidx + - 2]->minor, 'code' => $this->yystack[$this->yyidx + 0]->minor, 'statename' => '');
if ($this->yystack[$this->yyidx + - 4]->minor != 'statename') {
throw new Exception('Error: only %statename processing instruction ' .
'is allowed in rule sections');
$this->_retvalue = $this->yystack[$this->yyidx + - 5]->minor;
$this->_retvalue[] = array('rules' => $this->yystack[$this->yyidx + - 2]->minor, 'code' => $this->yystack[$this->yyidx + 0]->minor, 'statename' => $this->yystack[$this->yyidx + - 3]->minor);
$this->_retvalue = $this->yystack[$this->yyidx + - 1]->minor;
$this->_patternIndex = 1;
$this->_patternIndex += $this->yystack[$this->yyidx + - 1]->minor['subpatterns'] + 1;
$this->error('Rule "' . $name . '" can match the empty string, this will break lexing');
$this->_retvalue = array(array('pattern' => str_replace('/', '\\', $this->yystack[$this->yyidx + - 1]->minor->string), 'code' => $this->yystack[$this->yyidx + 0]->minor, 'subpatterns' => $this->yystack[$this->yyidx + - 1]->minor['subpatterns']));
$this->_retvalue = $this->yystack[$this->yyidx + - 2]->minor;
$this->_patternIndex += $this->yystack[$this->yyidx + - 1]->minor['subpatterns'] + 1;
$this->error('Rule "' . $name . '" can match the empty string, this will break lexing');
$this->_retvalue[] = array('pattern' => str_replace('/', '\\', $this->yystack[$this->yyidx + - 1]->minor->string), 'code' => $this->yystack[$this->yyidx + 0]->minor, 'subpatterns' => $this->yystack[$this->yyidx + - 1]->minor['subpatterns']);
if (!isset ($this->patterns[$this->yystack[$this->yyidx + 0]->minor])) {
$this->error('Undefined pattern "' . $this->yystack[$this->yyidx + 0]->minor . '" used in rules');
throw new Exception('Undefined pattern "' . $this->yystack[$this->yyidx + 0]->minor . '" used in rules');
$this->_retvalue = array($this->patterns[$this->yystack[$this->yyidx + 0]->minor], $this->yystack[$this->yyidx + 0]->minor);
if (!isset ($this->patterns[$this->yystack[$this->yyidx + 0]->minor])) {
$this->error('Undefined pattern "' . $this->yystack[$this->yyidx + 0]->minor . '" used in rules');
throw new Exception('Undefined pattern "' . $this->yystack[$this->yyidx + 0]->minor . '" used in rules');
// increment internal sub-pattern counter
// adjust back-references in pattern based on previous pattern
$this->_patternIndex += $test['subpatterns'];
$this->_retvalue = $test['pattern'];
// increment internal sub-pattern counter
// adjust back-references in pattern based on previous pattern
$this->_patternIndex += $test['subpatterns'];
$this->_retvalue = $this->yystack[$this->yyidx + - 1]->minor . $test['pattern'];
* placeholder for the left hand side in a reduce operation.
* For a parser with a rule like this:
* rule(A) ::= B. { A = 1; }
* The parser will translate to something like:
* function yy_r0(){$this->_retvalue = 1;}
* Perform a reduce action and the shift that must immediately
* A ::= B blah C. { dosomething(); }
* This function will first call the action, if any, ("dosomething();" in our
* example), and then it will pop three states from the stack,
* one for each entry on the right-hand side of the expression
* (B, blah, and C in our example rule), and then push the result of the action
* back on to the stack with the resulting state reduced to (as described in the .out
* @param int Number of the rule by which to reduce
//int $yygoto; /* The next state */
//int $yyact; /* The next action */
//mixed $yygotominor; /* The LHS of the rule reduced */
//PHP_LexerGenerator_ParseryyStackEntry $yymsp; /* The top of the parser's stack */
//int $yysize; /* Amount to pop the stack */
if (self::$yyTraceFILE && $yyruleno >= 0
&& $yyruleno < count(self::$yyRuleName)) {
fprintf(self::$yyTraceFILE, "%sReduce (%d) [%s].\n",
self::$yyTracePrompt, $yyruleno,
self::$yyRuleName[$yyruleno]);
$this->_retvalue = $yy_lefthand_side = null;
$this->{'yy_r' . self::$yyReduceMap[$yyruleno]}();
$yy_lefthand_side = $this->_retvalue;
$yygoto = self::$yyRuleInfo[$yyruleno]['lhs'];
$yysize = self::$yyRuleInfo[$yyruleno]['rhs'];
for($i = $yysize; $i; $i-- ) {
// pop all of the right-hand side parameters
if ($yyact < self::YYNSTATE) {
/* If we are not debugging and the reduce action popped at least
** one element off the stack, then we can push the new element back
** onto the stack here, and skip the stack overflow test in yy_shift().
** That gives a significant speed improvement. */
if (!self::$yyTraceFILE && $yysize) {
$x->minor = $yy_lefthand_side;
$this->yy_shift($yyact, $yygoto, $yy_lefthand_side);
} elseif ($yyact == self::YYNSTATE + self::YYNRULE + 1) {
* The following code executes when the parse fails
* Code from %parse_fail is inserted here
if (self::$yyTraceFILE) {
fprintf(self::$yyTraceFILE, "%sFail!\n", self::$yyTracePrompt);
while ($this->yyidx >= 0) {
/* Here code is inserted which will be executed whenever the
* The following code executes when a syntax error first occurs.
* %syntax_error code is inserted here
* @param int The major type of the error token
* @param mixed The minor type of the error token
echo "Syntax Error on line " . $this->lex->line . ": token '" .
$this->lex->value . "' while parsing rule:";
foreach ($this->yystack as $entry) {
$expect[] = self::$yyTokenName[$token];
throw new Exception('Unexpected ' . $this->tokenName($yymajor) . '(' . $TOKEN
. '), expected one of: ' . implode(',', $expect));
* The following is executed when the parser accepts
* %parse_accept code is inserted here
if (self::$yyTraceFILE) {
fprintf(self::$yyTraceFILE, "%sAccept!\n", self::$yyTracePrompt);
while ($this->yyidx >= 0) {
/* Here code is inserted which will be executed whenever the
* The main parser program.
* The first argument is the major token number. The second is
* the token value string as scanned from the input.
* @param int the token number
* @param mixed the token value
* @param mixed any extra arguments that should be passed to handlers
function doParse($yymajor, $yytokenvalue)
// $yyact; /* The parser action. */
// $yyendofinput; /* True if we are at the end of input */
$yyerrorhit = 0; /* True if yymajor has invoked an error */
/* (re)initialize the parser, if necessary */
/* if ($yymajor == 0) return; // not sure why this was here... */
$yyendofinput = ($yymajor== 0);
if (self::$yyTraceFILE) {
fprintf(self::$yyTraceFILE, "%sInput %s\n",
self::$yyTracePrompt, self::$yyTokenName[$yymajor]);
$yyact = $this->yy_find_shift_action($yymajor);
if ($yymajor < self::YYERRORSYMBOL &&
$yyact = self::YY_ERROR_ACTION;
if ($yyact < self::YYNSTATE) {
$this->yy_shift($yyact, $yymajor, $yytokenvalue);
if ($yyendofinput && $this->yyidx >= 0) {
$yymajor = self::YYNOCODE;
} elseif ($yyact < self::YYNSTATE + self::YYNRULE) {
} elseif ($yyact == self::YY_ERROR_ACTION) {
if (self::$yyTraceFILE) {
fprintf(self::$yyTraceFILE, "%sSyntax Error!\n",
if (self::YYERRORSYMBOL) {
/* A syntax error has occurred.
** The response to an error depends upon whether or not the
** grammar defines an error token "ERROR".
** This is what we do if the grammar does define ERROR:
** * Call the %syntax_error function.
** * Begin popping the stack until we enter a state where
|