Source for file Lempar.php
Documentation is available at Lempar.php
/* Driver template for the PHP_ParserGenerator 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
class ParseyyToken implements ArrayAccess
public $metadata = array ();
function __construct ($s, $m = array ())
if ($s instanceof ParseyyToken ) {
$this->string = $s->string;
$this->metadata = $s->metadata;
$this->string = (string) $s;
if ($m instanceof ParseyyToken ) {
$this->metadata = $m->metadata;
function offsetExists ($offset)
return isset ($this->metadata[$offset]);
function offsetGet ($offset)
return $this->metadata[$offset];
function offsetSet ($offset, $value)
$x = ($value instanceof ParseyyToken ) ?
$value->metadata : $value;
$offset = count($this->metadata);
if ($value instanceof ParseyyToken ) {
$this->metadata[$offset] = $value->metadata;
$this->metadata[$offset] = $value;
function offsetUnset ($offset)
unset ($this->metadata[$offset]);
/** 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 $stateno; /* The state-number */
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
// declare_class is output here
/* First off, code is included which follows the "include_class" declaration
/* 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.
/* 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 = -1; /* 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 (
* For tracing reduce actions, the names of all rules are required.
static public $yyRuleName = array (
* 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.
if (!count($this->yystack )) {
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)
$state = $this->yystack [$this->yyidx ]->stateno;
$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 (
$this->yystack [$this->yyidx ]->stateno ,
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 = new ParseyyStackEntry;
$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
$state = $this->yystack [$this->yyidx ]->stateno;
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 (
$this->yystack [$this->yyidx ]->stateno ,
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 = new ParseyyStackEntry;
$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
$stateno = $this->yystack [$this->yyidx ]->stateno;
/* 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 = new ParseyyStackEntry;
$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 (
* 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>
* 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
function yy_reduce ($yyruleno)
//int $yygoto; /* The next state */
//int $yyact; /* The next action */
//mixed $yygotominor; /* The LHS of the rule reduced */
//ParseyyStackEntry $yymsp; /* The top of the parser's stack */
//int $yysize; /* Amount to pop the stack */
$yymsp = $this->yystack [$this->yyidx ];
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 = new ParseyyStackEntry;
$x->minor = $yy_lefthand_side;
$this->yystack [$this->yyidx ] = $x;
$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
* 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 $yymajor the token number
* @param mixed $yytokenvalue 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 ($this->yyidx === null || $this->yyidx < 0 ) {
/* if ($yymajor == 0) return; // not sure why this was here... */
$x = new ParseyyStackEntry;
$this->yystack = array ();
$yyendofinput = ($yymajor==0 );
if (self ::$yyTraceFILE) {
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) {
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
** it is legal to shift the error symbol, then shift
** * Set the error count to three.
** * Begin accepting and shifting new tokens. No new error
** processing will occur until three tokens have been
if ($this->yyerrcnt < 0 ) {
$yymx = $this->yystack [$this->yyidx ]->major;
if ($yymx == self ::YYERRORSYMBOL || $yyerrorhit ) {
if (self ::$yyTraceFILE) {
"%sDiscard input token %s\n",
self ::$yyTokenName[$yymajor]
$this->yy_destructor ($yymajor, $yytokenvalue);
$yymajor = self ::YYNOCODE;
&& $yymx != self ::YYERRORSYMBOL
if ($this->yyidx < 0 || $yymajor==0 ) {
$yymajor = self ::YYNOCODE;
} elseif ($yymx != self ::YYERRORSYMBOL ) {
$this->yy_shift($yyact, self ::YYERRORSYMBOL , $u2);
/* YYERRORSYMBOL is not defined */
/* This is what we do if the grammar does not define ERROR:
** * Report an error message, and throw away the input token.
** * If the input token is $, then fail the parse.
** As before, subsequent error messages are suppressed until
** three input tokens have been successfully shifted.
if ($this->yyerrcnt <= 0 ) {
$yymajor = self ::YYNOCODE;
$yymajor = self ::YYNOCODE;
} while ($yymajor != self ::YYNOCODE && $this->yyidx >= 0 );
Documentation generated on Mon, 11 Mar 2019 15:40:55 -0400 by phpDocumentor 1.4.4. PEAR Logo Copyright © PHP Group 2004.
|