string = $s->string; $this->metadata = $s->metadata; } else { $this->string = (string) $s; if ($m instanceof OQLParser_yyToken) { $this->metadata = $m->metadata; } elseif (is_array($m)) { $this->metadata = $m; } } } function __toString() { return $this->string; } function offsetExists($offset) { return isset($this->metadata[$offset]); } function offsetGet($offset) { return $this->metadata[$offset]; } function offsetSet($offset, $value) { if ($offset === null) { if (isset($value[0])) { $x = ($value instanceof OQLParser_yyToken) ? $value->metadata : $value; $this->metadata = array_merge($this->metadata, $x); return; } $offset = count($this->metadata); } if ($value === null) { return; } if ($value instanceof OQLParser_yyToken) { if ($value->metadata) { $this->metadata[$offset] = $value->metadata; } } elseif ($value) { $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. */ class OQLParser_yyStackEntry { 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 #line 24 "..\oql-parser.y" class OQLParserRaw#line 102 "..\oql-parser.php" { /* First off, code is included which follows the "include_class" declaration ** in the input file. */ /* 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 ** understands. ** ** Each symbol here is a terminal symbol in the grammar. */ const UNION = 1; const SELECT = 2; const AS_ALIAS = 3; const FROM = 4; const COMA = 5; const WHERE = 6; const JOIN = 7; const ON = 8; const EQ = 9; const BELOW = 10; const BELOW_STRICT = 11; const NOT_BELOW = 12; const NOT_BELOW_STRICT = 13; const ABOVE = 14; const ABOVE_STRICT = 15; const NOT_ABOVE = 16; const NOT_ABOVE_STRICT = 17; const PAR_OPEN = 18; const PAR_CLOSE = 19; const INTERVAL = 20; const F_SECOND = 21; const F_MINUTE = 22; const F_HOUR = 23; const F_DAY = 24; const F_MONTH = 25; const F_YEAR = 26; const DOT = 27; const VARNAME = 28; const NAME = 29; const NUMVAL = 30; const MATH_MINUS = 31; const HEXVAL = 32; const STRVAL = 33; const REGEXP = 34; const NOT_EQ = 35; const LOG_AND = 36; const LOG_OR = 37; const MATH_DIV = 38; const MATH_MULT = 39; const MATH_PLUS = 40; const GT = 41; const LT = 42; const GE = 43; const LE = 44; const LIKE = 45; const NOT_LIKE = 46; const BITWISE_LEFT_SHIFT = 47; const BITWISE_RIGHT_SHIFT = 48; const BITWISE_AND = 49; const BITWISE_OR = 50; const BITWISE_XOR = 51; const IN = 52; const NOT_IN = 53; const F_IF = 54; const F_ELT = 55; const F_COALESCE = 56; const F_ISNULL = 57; const F_CONCAT = 58; const F_SUBSTR = 59; const F_TRIM = 60; const F_DATE = 61; const F_DATE_FORMAT = 62; const F_CURRENT_DATE = 63; const F_NOW = 64; const F_TIME = 65; const F_TO_DAYS = 66; const F_FROM_DAYS = 67; const F_DATE_ADD = 68; const F_DATE_SUB = 69; const F_ROUND = 70; const F_FLOOR = 71; const F_INET_ATON = 72; const F_INET_NTOA = 73; const YY_NO_ACTION = 290; const YY_ACCEPT_ACTION = 289; const YY_ERROR_ACTION = 288; /* 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 ** action integer. ** ** Suppose the action integer is N. Then the action is determined as ** follows ** ** 0 <= N < self::YYNSTATE Shift N. That is, ** push the lookahead ** token onto the stack ** and goto state N. ** ** 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 ** shifting terminals. ** 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. */ const YY_SZ_ACTTAB = 549; static public $yy_action = array( /* 0 */ 7, 30, 6, 66, 60, 4, 153, 152, 155, 98, /* 10 */ 107, 106, 105, 65, 101, 102, 25, 22, 23, 21, /* 20 */ 19, 27, 26, 28, 24, 162, 151, 43, 177, 177, /* 30 */ 80, 41, 62, 85, 150, 140, 103, 108, 109, 114, /* 40 */ 115, 113, 112, 110, 111, 133, 134, 157, 158, 156, /* 50 */ 154, 159, 160, 165, 166, 164, 20, 121, 125, 3, /* 60 */ 68, 70, 69, 75, 99, 93, 142, 66, 76, 64, /* 70 */ 119, 120, 7, 79, 50, 122, 121, 42, 153, 152, /* 80 */ 155, 139, 107, 106, 105, 65, 101, 102, 149, 119, /* 90 */ 120, 137, 143, 121, 132, 130, 62, 148, 147, 100, /* 100 */ 146, 144, 145, 167, 61, 116, 119, 120, 103, 108, /* 110 */ 109, 114, 115, 113, 112, 110, 111, 133, 134, 157, /* 120 */ 158, 156, 154, 159, 160, 165, 166, 164, 7, 106, /* 130 */ 11, 66, 9, 80, 153, 152, 155, 81, 107, 106, /* 140 */ 105, 65, 101, 102, 163, 161, 72, 8, 10, 88, /* 150 */ 78, 1, 46, 38, 44, 104, 54, 51, 41, 42, /* 160 */ 62, 118, 135, 136, 103, 108, 109, 114, 115, 113, /* 170 */ 112, 110, 111, 133, 134, 157, 158, 156, 154, 159, /* 180 */ 160, 165, 166, 164, 289, 138, 67, 86, 66, 39, /* 190 */ 87, 58, 37, 45, 126, 34, 48, 131, 124, 63, /* 200 */ 13, 40, 66, 17, 230, 15, 12, 36, 97, 2, /* 210 */ 47, 55, 41, 129, 127, 128, 117, 62, 66, 80, /* 220 */ 80, 80, 80, 123, 126, 31, 48, 131, 124, 63, /* 230 */ 59, 62, 237, 17, 91, 15, 20, 36, 73, 80, /* 240 */ 237, 92, 237, 129, 127, 128, 117, 62, 66, 237, /* 250 */ 94, 74, 237, 42, 126, 31, 48, 131, 124, 63, /* 260 */ 237, 237, 66, 17, 66, 15, 66, 36, 83, 95, /* 270 */ 56, 77, 82, 129, 127, 128, 117, 62, 141, 66, /* 280 */ 237, 237, 237, 237, 237, 126, 34, 48, 131, 124, /* 290 */ 63, 62, 237, 62, 17, 62, 15, 52, 36, 5, /* 300 */ 42, 237, 237, 237, 129, 127, 128, 117, 62, 66, /* 310 */ 237, 8, 237, 71, 237, 126, 32, 48, 131, 124, /* 320 */ 63, 237, 237, 66, 17, 118, 15, 53, 36, 89, /* 330 */ 42, 57, 237, 237, 129, 127, 128, 117, 62, 66, /* 340 */ 237, 237, 237, 237, 237, 126, 16, 48, 131, 124, /* 350 */ 63, 237, 62, 66, 17, 237, 15, 237, 36, 90, /* 360 */ 237, 237, 237, 237, 129, 127, 128, 117, 62, 66, /* 370 */ 237, 237, 237, 237, 237, 126, 29, 48, 131, 124, /* 380 */ 63, 237, 62, 237, 17, 237, 15, 237, 36, 237, /* 390 */ 237, 237, 237, 237, 129, 127, 128, 117, 62, 66, /* 400 */ 237, 237, 237, 237, 237, 126, 33, 48, 131, 124, /* 410 */ 63, 237, 237, 237, 17, 237, 15, 237, 36, 237, /* 420 */ 237, 237, 237, 237, 129, 127, 128, 117, 62, 66, /* 430 */ 237, 237, 237, 237, 237, 126, 237, 48, 131, 124, /* 440 */ 63, 237, 237, 237, 17, 237, 15, 237, 35, 237, /* 450 */ 237, 237, 237, 237, 129, 127, 128, 117, 62, 66, /* 460 */ 237, 237, 237, 237, 237, 126, 237, 48, 131, 124, /* 470 */ 63, 237, 237, 237, 17, 237, 14, 66, 237, 237, /* 480 */ 237, 237, 84, 56, 129, 127, 128, 117, 62, 66, /* 490 */ 237, 237, 237, 237, 237, 126, 237, 48, 131, 124, /* 500 */ 63, 237, 237, 237, 18, 66, 62, 237, 237, 237, /* 510 */ 237, 96, 237, 237, 129, 127, 128, 117, 62, 66, /* 520 */ 237, 237, 237, 237, 237, 126, 237, 49, 131, 124, /* 530 */ 63, 237, 237, 237, 62, 237, 237, 237, 237, 237, /* 540 */ 237, 237, 237, 237, 129, 127, 128, 117, 62, ); static public $yy_lookahead = array( /* 0 */ 18, 79, 20, 79, 82, 6, 24, 25, 26, 85, /* 10 */ 28, 29, 30, 31, 32, 33, 9, 10, 11, 12, /* 20 */ 13, 14, 15, 16, 17, 38, 39, 3, 4, 5, /* 30 */ 108, 7, 108, 81, 47, 48, 54, 55, 56, 57, /* 40 */ 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, /* 50 */ 68, 69, 70, 71, 72, 73, 2, 37, 93, 18, /* 60 */ 21, 22, 23, 24, 25, 26, 9, 79, 76, 77, /* 70 */ 50, 51, 18, 85, 80, 19, 37, 83, 24, 25, /* 80 */ 26, 81, 28, 29, 30, 31, 32, 33, 31, 50, /* 90 */ 51, 34, 35, 37, 52, 53, 108, 40, 41, 42, /* 100 */ 43, 44, 45, 46, 79, 108, 50, 51, 54, 55, /* 110 */ 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, /* 120 */ 66, 67, 68, 69, 70, 71, 72, 73, 18, 29, /* 130 */ 95, 79, 99, 108, 24, 25, 26, 85, 28, 29, /* 140 */ 30, 31, 32, 33, 109, 110, 113, 100, 97, 81, /* 150 */ 103, 18, 4, 5, 3, 30, 80, 27, 7, 83, /* 160 */ 108, 114, 111, 112, 54, 55, 56, 57, 58, 59, /* 170 */ 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, /* 180 */ 70, 71, 72, 73, 75, 76, 77, 78, 79, 1, /* 190 */ 79, 79, 79, 79, 85, 86, 87, 88, 89, 90, /* 200 */ 8, 3, 79, 94, 27, 96, 8, 98, 85, 5, /* 210 */ 79, 92, 7, 104, 105, 106, 107, 108, 79, 108, /* 220 */ 108, 108, 108, 19, 85, 86, 87, 88, 89, 90, /* 230 */ 91, 108, 115, 94, 81, 96, 2, 98, 36, 108, /* 240 */ 115, 102, 115, 104, 105, 106, 107, 108, 79, 115, /* 250 */ 80, 49, 115, 83, 85, 86, 87, 88, 89, 90, /* 260 */ 115, 115, 79, 94, 79, 96, 79, 98, 85, 84, /* 270 */ 85, 102, 85, 104, 105, 106, 107, 108, 78, 79, /* 280 */ 115, 115, 115, 115, 115, 85, 86, 87, 88, 89, /* 290 */ 90, 108, 115, 108, 94, 108, 96, 80, 98, 5, /* 300 */ 83, 115, 115, 115, 104, 105, 106, 107, 108, 79, /* 310 */ 115, 100, 115, 19, 115, 85, 86, 87, 88, 89, /* 320 */ 90, 115, 115, 79, 94, 114, 96, 80, 98, 85, /* 330 */ 83, 101, 115, 115, 104, 105, 106, 107, 108, 79, /* 340 */ 115, 115, 115, 115, 115, 85, 86, 87, 88, 89, /* 350 */ 90, 115, 108, 79, 94, 115, 96, 115, 98, 85, /* 360 */ 115, 115, 115, 115, 104, 105, 106, 107, 108, 79, /* 370 */ 115, 115, 115, 115, 115, 85, 86, 87, 88, 89, /* 380 */ 90, 115, 108, 115, 94, 115, 96, 115, 98, 115, /* 390 */ 115, 115, 115, 115, 104, 105, 106, 107, 108, 79, /* 400 */ 115, 115, 115, 115, 115, 85, 86, 87, 88, 89, /* 410 */ 90, 115, 115, 115, 94, 115, 96, 115, 98, 115, /* 420 */ 115, 115, 115, 115, 104, 105, 106, 107, 108, 79, /* 430 */ 115, 115, 115, 115, 115, 85, 115, 87, 88, 89, /* 440 */ 90, 115, 115, 115, 94, 115, 96, 115, 98, 115, /* 450 */ 115, 115, 115, 115, 104, 105, 106, 107, 108, 79, /* 460 */ 115, 115, 115, 115, 115, 85, 115, 87, 88, 89, /* 470 */ 90, 115, 115, 115, 94, 115, 96, 79, 115, 115, /* 480 */ 115, 115, 84, 85, 104, 105, 106, 107, 108, 79, /* 490 */ 115, 115, 115, 115, 115, 85, 115, 87, 88, 89, /* 500 */ 90, 115, 115, 115, 94, 79, 108, 115, 115, 115, /* 510 */ 115, 85, 115, 115, 104, 105, 106, 107, 108, 79, /* 520 */ 115, 115, 115, 115, 115, 85, 115, 87, 88, 89, /* 530 */ 90, 115, 115, 115, 108, 115, 115, 115, 115, 115, /* 540 */ 115, 115, 115, 115, 104, 105, 106, 107, 108, ); const YY_SHIFT_USE_DFLT = -19; const YY_SHIFT_MAX = 67; static public $yy_shift_ofst = array( /* 0 */ 54, -18, -18, 110, 110, 110, 110, 110, 110, 110, /* 10 */ 110, 110, 100, 100, 57, 57, 39, -13, -13, 100, /* 20 */ 100, 100, 100, 100, 100, 100, 100, 100, 100, 56, /* 30 */ 24, 20, 20, 20, 20, 202, 202, 151, 100, 234, /* 40 */ 100, 100, 205, 100, 100, 205, 100, 205, 42, 42, /* 50 */ -1, 100, -1, -1, -1, 41, 7, 294, 198, 204, /* 60 */ 148, 192, 177, 133, 188, 125, 130, 188, ); const YY_REDUCE_USE_DFLT = -79; const YY_REDUCE_MAX = 55; static public $yy_reduce_ofst = array( /* 0 */ 109, 139, 169, 230, 200, 320, 260, 290, 350, 380, /* 10 */ 410, 440, 398, 185, 51, 51, 47, 35, 35, 274, /* 20 */ -78, 426, -12, 123, 52, -76, 183, 244, 187, 211, /* 30 */ 247, 211, 211, 211, 211, 33, 33, 76, 111, -8, /* 40 */ 25, 112, 170, 131, 114, 217, 113, -6, 119, 119, /* 50 */ 153, -3, 68, 0, -48, -35, ); static public $yyExpectedTokens = array( /* 0 */ array(2, 18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 1 */ array(18, 20, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 2 */ array(18, 20, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 3 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 4 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 5 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 6 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 7 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 8 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 9 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 10 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 11 */ array(18, 24, 25, 26, 28, 29, 30, 31, 32, 33, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, ), /* 12 */ array(29, ), /* 13 */ array(29, ), /* 14 */ array(9, 31, 34, 35, 40, 41, 42, 43, 44, 45, 46, ), /* 15 */ array(9, 31, 34, 35, 40, 41, 42, 43, 44, 45, 46, ), /* 16 */ array(21, 22, 23, 24, 25, 26, 37, 50, 51, ), /* 17 */ array(38, 39, 47, 48, ), /* 18 */ array(38, 39, 47, 48, ), /* 19 */ array(29, ), /* 20 */ array(29, ), /* 21 */ array(29, ), /* 22 */ array(29, ), /* 23 */ array(29, ), /* 24 */ array(29, ), /* 25 */ array(29, ), /* 26 */ array(29, ), /* 27 */ array(29, ), /* 28 */ array(29, ), /* 29 */ array(19, 37, 50, 51, ), /* 30 */ array(3, 4, 5, 7, ), /* 31 */ array(37, 50, 51, ), /* 32 */ array(37, 50, 51, ), /* 33 */ array(37, 50, 51, ), /* 34 */ array(37, 50, 51, ), /* 35 */ array(36, 49, ), /* 36 */ array(36, 49, ), /* 37 */ array(3, 7, ), /* 38 */ array(29, ), /* 39 */ array(2, ), /* 40 */ array(29, ), /* 41 */ array(29, ), /* 42 */ array(7, ), /* 43 */ array(29, ), /* 44 */ array(29, ), /* 45 */ array(7, ), /* 46 */ array(29, ), /* 47 */ array(7, ), /* 48 */ array(52, 53, ), /* 49 */ array(52, 53, ), /* 50 */ array(6, ), /* 51 */ array(29, ), /* 52 */ array(6, ), /* 53 */ array(6, ), /* 54 */ array(6, ), /* 55 */ array(18, ), /* 56 */ array(9, 10, 11, 12, 13, 14, 15, 16, 17, ), /* 57 */ array(5, 19, ), /* 58 */ array(3, 8, ), /* 59 */ array(5, 19, ), /* 60 */ array(4, 5, ), /* 61 */ array(8, ), /* 62 */ array(27, ), /* 63 */ array(18, ), /* 64 */ array(1, ), /* 65 */ array(30, ), /* 66 */ array(27, ), /* 67 */ array(1, ), /* 68 */ array(), /* 69 */ array(), /* 70 */ array(), /* 71 */ array(), /* 72 */ array(), /* 73 */ array(), /* 74 */ array(), /* 75 */ array(), /* 76 */ array(), /* 77 */ array(), /* 78 */ array(), /* 79 */ array(), /* 80 */ array(), /* 81 */ array(), /* 82 */ array(), /* 83 */ array(), /* 84 */ array(), /* 85 */ array(), /* 86 */ array(), /* 87 */ array(), /* 88 */ array(), /* 89 */ array(), /* 90 */ array(), /* 91 */ array(), /* 92 */ array(), /* 93 */ array(), /* 94 */ array(), /* 95 */ array(), /* 96 */ array(), /* 97 */ array(), /* 98 */ array(), /* 99 */ array(), /* 100 */ array(), /* 101 */ array(), /* 102 */ array(), /* 103 */ array(), /* 104 */ array(), /* 105 */ array(), /* 106 */ array(), /* 107 */ array(), /* 108 */ array(), /* 109 */ array(), /* 110 */ array(), /* 111 */ array(), /* 112 */ array(), /* 113 */ array(), /* 114 */ array(), /* 115 */ array(), /* 116 */ array(), /* 117 */ array(), /* 118 */ array(), /* 119 */ array(), /* 120 */ array(), /* 121 */ array(), /* 122 */ array(), /* 123 */ array(), /* 124 */ array(), /* 125 */ array(), /* 126 */ array(), /* 127 */ array(), /* 128 */ array(), /* 129 */ array(), /* 130 */ array(), /* 131 */ array(), /* 132 */ array(), /* 133 */ array(), /* 134 */ array(), /* 135 */ array(), /* 136 */ array(), /* 137 */ array(), /* 138 */ array(), /* 139 */ array(), /* 140 */ array(), /* 141 */ array(), /* 142 */ array(), /* 143 */ array(), /* 144 */ array(), /* 145 */ array(), /* 146 */ array(), /* 147 */ array(), /* 148 */ array(), /* 149 */ array(), /* 150 */ array(), /* 151 */ array(), /* 152 */ array(), /* 153 */ array(), /* 154 */ array(), /* 155 */ array(), /* 156 */ array(), /* 157 */ array(), /* 158 */ array(), /* 159 */ array(), /* 160 */ array(), /* 161 */ array(), /* 162 */ array(), /* 163 */ array(), /* 164 */ array(), /* 165 */ array(), /* 166 */ array(), /* 167 */ array(), ); static public $yy_default = array( /* 0 */ 288, 213, 288, 288, 288, 288, 288, 288, 288, 288, /* 10 */ 288, 288, 288, 288, 207, 206, 288, 204, 205, 288, /* 20 */ 288, 288, 288, 288, 288, 288, 288, 288, 288, 288, /* 30 */ 183, 216, 211, 212, 195, 209, 208, 183, 288, 288, /* 40 */ 288, 288, 182, 288, 288, 183, 288, 183, 202, 203, /* 50 */ 180, 288, 180, 180, 180, 288, 288, 288, 288, 288, /* 60 */ 288, 288, 228, 288, 171, 288, 288, 169, 218, 220, /* 70 */ 219, 210, 245, 244, 260, 221, 172, 215, 217, 187, /* 80 */ 230, 194, 193, 192, 185, 175, 170, 178, 176, 191, /* 90 */ 190, 174, 214, 223, 181, 184, 189, 188, 186, 222, /* 100 */ 253, 235, 236, 265, 234, 233, 232, 231, 266, 267, /* 110 */ 272, 273, 271, 270, 268, 269, 229, 227, 247, 261, /* 120 */ 262, 246, 200, 199, 198, 201, 197, 225, 226, 224, /* 130 */ 264, 196, 263, 274, 275, 239, 240, 241, 168, 173, /* 140 */ 259, 179, 242, 243, 255, 256, 254, 252, 250, 251, /* 150 */ 258, 249, 280, 281, 282, 279, 278, 276, 277, 283, /* 160 */ 284, 238, 248, 237, 287, 285, 286, 257, ); /* 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 ** table. ** 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. */ const YYNOCODE = 116; const YYSTACKDEPTH = 100; const YYNSTATE = 168; const YYNRULE = 120; const YYERRORSYMBOL = 74; const YYERRSYMDT = 'yy0'; const YYFALLBACK = 0; /** The next table maps tokens into fallback tokens. If a construct * like the following: * * %fallback ID X Y Z. * * 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 * * Inputs: * * - 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 * turned off. * * Outputs: * * - None. * @param resource * @param string */ static function Trace($TraceFILE, $zTracePrompt) { if (!$TraceFILE) { $zTracePrompt = 0; } elseif (!$zTracePrompt) { $TraceFILE = 0; } 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 = ''; } /** * @var resource|0 */ static public $yyTraceFILE; /** * String to prepend to debug output * @var string|0 */ static public $yyTracePrompt; /** * @var int */ public $yyidx = -1; /* Index of top element in stack */ /** * @var int */ public $yyerrcnt; /* Shifts left before out of the error */ /** * @var array */ 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 * @var array */ static public $yyTokenName = array( '$', 'UNION', 'SELECT', 'AS_ALIAS', 'FROM', 'COMA', 'WHERE', 'JOIN', 'ON', 'EQ', 'BELOW', 'BELOW_STRICT', 'NOT_BELOW', 'NOT_BELOW_STRICT', 'ABOVE', 'ABOVE_STRICT', 'NOT_ABOVE', 'NOT_ABOVE_STRICT', 'PAR_OPEN', 'PAR_CLOSE', 'INTERVAL', 'F_SECOND', 'F_MINUTE', 'F_HOUR', 'F_DAY', 'F_MONTH', 'F_YEAR', 'DOT', 'VARNAME', 'NAME', 'NUMVAL', 'MATH_MINUS', 'HEXVAL', 'STRVAL', 'REGEXP', 'NOT_EQ', 'LOG_AND', 'LOG_OR', 'MATH_DIV', 'MATH_MULT', 'MATH_PLUS', 'GT', 'LT', 'GE', 'LE', 'LIKE', 'NOT_LIKE', 'BITWISE_LEFT_SHIFT', 'BITWISE_RIGHT_SHIFT', 'BITWISE_AND', 'BITWISE_OR', 'BITWISE_XOR', 'IN', 'NOT_IN', 'F_IF', 'F_ELT', 'F_COALESCE', 'F_ISNULL', 'F_CONCAT', 'F_SUBSTR', 'F_TRIM', 'F_DATE', 'F_DATE_FORMAT', 'F_CURRENT_DATE', 'F_NOW', 'F_TIME', 'F_TO_DAYS', 'F_FROM_DAYS', 'F_DATE_ADD', 'F_DATE_SUB', 'F_ROUND', 'F_FLOOR', 'F_INET_ATON', 'F_INET_NTOA', 'error', 'result', 'union', 'query', 'condition', 'class_name', 'join_statement', 'where_statement', 'class_list', 'join_item', 'join_condition', 'field_id', 'expression_prio4', 'expression_basic', 'scalar', 'var_name', 'func_name', 'arg_list', 'list_operator', 'list', 'expression_prio1', 'operator1', 'expression_prio2', 'operator2', 'expression_prio3', 'operator3', 'operator4', 'list_items', 'argument', 'interval_unit', 'num_scalar', 'str_scalar', 'num_value', 'str_value', 'name', 'num_operator1', 'bitwise_operator1', 'num_operator2', 'str_operator', 'bitwise_operator3', 'bitwise_operator4', ); /** * For tracing reduce actions, the names of all rules are required. * @var array */ static public $yyRuleName = array( /* 0 */ "result ::= union", /* 1 */ "result ::= query", /* 2 */ "result ::= condition", /* 3 */ "union ::= query UNION query", /* 4 */ "union ::= query UNION union", /* 5 */ "query ::= SELECT class_name join_statement where_statement", /* 6 */ "query ::= SELECT class_name AS_ALIAS class_name join_statement where_statement", /* 7 */ "query ::= SELECT class_list FROM class_name join_statement where_statement", /* 8 */ "query ::= SELECT class_list FROM class_name AS_ALIAS class_name join_statement where_statement", /* 9 */ "class_list ::= class_name", /* 10 */ "class_list ::= class_list COMA class_name", /* 11 */ "where_statement ::= WHERE condition", /* 12 */ "where_statement ::=", /* 13 */ "join_statement ::= join_item join_statement", /* 14 */ "join_statement ::= join_item", /* 15 */ "join_statement ::=", /* 16 */ "join_item ::= JOIN class_name AS_ALIAS class_name ON join_condition", /* 17 */ "join_item ::= JOIN class_name ON join_condition", /* 18 */ "join_condition ::= field_id EQ field_id", /* 19 */ "join_condition ::= field_id BELOW field_id", /* 20 */ "join_condition ::= field_id BELOW_STRICT field_id", /* 21 */ "join_condition ::= field_id NOT_BELOW field_id", /* 22 */ "join_condition ::= field_id NOT_BELOW_STRICT field_id", /* 23 */ "join_condition ::= field_id ABOVE field_id", /* 24 */ "join_condition ::= field_id ABOVE_STRICT field_id", /* 25 */ "join_condition ::= field_id NOT_ABOVE field_id", /* 26 */ "join_condition ::= field_id NOT_ABOVE_STRICT field_id", /* 27 */ "condition ::= expression_prio4", /* 28 */ "expression_basic ::= scalar", /* 29 */ "expression_basic ::= field_id", /* 30 */ "expression_basic ::= var_name", /* 31 */ "expression_basic ::= func_name PAR_OPEN arg_list PAR_CLOSE", /* 32 */ "expression_basic ::= PAR_OPEN expression_prio4 PAR_CLOSE", /* 33 */ "expression_basic ::= expression_basic list_operator list", /* 34 */ "expression_prio1 ::= expression_basic", /* 35 */ "expression_prio1 ::= expression_prio1 operator1 expression_basic", /* 36 */ "expression_prio2 ::= expression_prio1", /* 37 */ "expression_prio2 ::= expression_prio2 operator2 expression_prio1", /* 38 */ "expression_prio3 ::= expression_prio2", /* 39 */ "expression_prio3 ::= expression_prio3 operator3 expression_prio2", /* 40 */ "expression_prio4 ::= expression_prio3", /* 41 */ "expression_prio4 ::= expression_prio4 operator4 expression_prio3", /* 42 */ "list ::= PAR_OPEN list_items PAR_CLOSE", /* 43 */ "list_items ::= expression_prio4", /* 44 */ "list_items ::= list_items COMA expression_prio4", /* 45 */ "arg_list ::=", /* 46 */ "arg_list ::= argument", /* 47 */ "arg_list ::= arg_list COMA argument", /* 48 */ "argument ::= expression_prio4", /* 49 */ "argument ::= INTERVAL expression_prio4 interval_unit", /* 50 */ "interval_unit ::= F_SECOND", /* 51 */ "interval_unit ::= F_MINUTE", /* 52 */ "interval_unit ::= F_HOUR", /* 53 */ "interval_unit ::= F_DAY", /* 54 */ "interval_unit ::= F_MONTH", /* 55 */ "interval_unit ::= F_YEAR", /* 56 */ "scalar ::= num_scalar", /* 57 */ "scalar ::= str_scalar", /* 58 */ "num_scalar ::= num_value", /* 59 */ "str_scalar ::= str_value", /* 60 */ "field_id ::= name", /* 61 */ "field_id ::= class_name DOT name", /* 62 */ "class_name ::= name", /* 63 */ "var_name ::= VARNAME", /* 64 */ "name ::= NAME", /* 65 */ "num_value ::= NUMVAL", /* 66 */ "num_value ::= MATH_MINUS NUMVAL", /* 67 */ "num_value ::= HEXVAL", /* 68 */ "str_value ::= STRVAL", /* 69 */ "operator1 ::= num_operator1", /* 70 */ "operator1 ::= bitwise_operator1", /* 71 */ "operator2 ::= num_operator2", /* 72 */ "operator2 ::= str_operator", /* 73 */ "operator2 ::= REGEXP", /* 74 */ "operator2 ::= EQ", /* 75 */ "operator2 ::= NOT_EQ", /* 76 */ "operator3 ::= LOG_AND", /* 77 */ "operator3 ::= bitwise_operator3", /* 78 */ "operator4 ::= LOG_OR", /* 79 */ "operator4 ::= bitwise_operator4", /* 80 */ "num_operator1 ::= MATH_DIV", /* 81 */ "num_operator1 ::= MATH_MULT", /* 82 */ "num_operator2 ::= MATH_PLUS", /* 83 */ "num_operator2 ::= MATH_MINUS", /* 84 */ "num_operator2 ::= GT", /* 85 */ "num_operator2 ::= LT", /* 86 */ "num_operator2 ::= GE", /* 87 */ "num_operator2 ::= LE", /* 88 */ "str_operator ::= LIKE", /* 89 */ "str_operator ::= NOT_LIKE", /* 90 */ "bitwise_operator1 ::= BITWISE_LEFT_SHIFT", /* 91 */ "bitwise_operator1 ::= BITWISE_RIGHT_SHIFT", /* 92 */ "bitwise_operator3 ::= BITWISE_AND", /* 93 */ "bitwise_operator4 ::= BITWISE_OR", /* 94 */ "bitwise_operator4 ::= BITWISE_XOR", /* 95 */ "list_operator ::= IN", /* 96 */ "list_operator ::= NOT_IN", /* 97 */ "func_name ::= F_IF", /* 98 */ "func_name ::= F_ELT", /* 99 */ "func_name ::= F_COALESCE", /* 100 */ "func_name ::= F_ISNULL", /* 101 */ "func_name ::= F_CONCAT", /* 102 */ "func_name ::= F_SUBSTR", /* 103 */ "func_name ::= F_TRIM", /* 104 */ "func_name ::= F_DATE", /* 105 */ "func_name ::= F_DATE_FORMAT", /* 106 */ "func_name ::= F_CURRENT_DATE", /* 107 */ "func_name ::= F_NOW", /* 108 */ "func_name ::= F_TIME", /* 109 */ "func_name ::= F_TO_DAYS", /* 110 */ "func_name ::= F_FROM_DAYS", /* 111 */ "func_name ::= F_YEAR", /* 112 */ "func_name ::= F_MONTH", /* 113 */ "func_name ::= F_DAY", /* 114 */ "func_name ::= F_DATE_ADD", /* 115 */ "func_name ::= F_DATE_SUB", /* 116 */ "func_name ::= F_ROUND", /* 117 */ "func_name ::= F_FLOOR", /* 118 */ "func_name ::= F_INET_ATON", /* 119 */ "func_name ::= F_INET_NTOA", ); /** * This function returns the symbolic name associated with a token * value. * @param int * @return string */ function tokenName($tokenType) { if ($tokenType === 0) { return 'End of Input'; } if ($tokenType > 0 && $tokenType < count(self::$yyTokenName)) { return self::$yyTokenName[$tokenType]; } else { return "Unknown"; } } /** * 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) { switch ($yymajor) { /* 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 ** inside the C code. */ 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 OQLParser_yyParser * @return int */ function yy_pop_parser_stack() { if (!count($this->yystack)) { return; } $yytos = array_pop($this->yystack); if (self::$yyTraceFILE && $this->yyidx >= 0) { fwrite(self::$yyTraceFILE, self::$yyTracePrompt . 'Popping ' . self::$yyTokenName[$yytos->major] . "\n"); } $yymajor = $yytos->major; self::yy_destructor($yymajor, $yytos->minor); $this->yyidx--; return $yymajor; } /** * Deallocate and destroy a parser. Destructors are all called for * all stack elements before shutting the parser down. */ function __destruct() { while ($this->yyidx >= 0) { $this->yy_pop_parser_stack(); } if (is_resource(self::$yyTraceFILE)) { fclose(self::$yyTraceFILE); } } /** * Based on the current state and parser stack, get a list of all * possible lookahead tokens * @param int * @return array */ function yy_get_expected_tokens($token) { $state = $this->yystack[$this->yyidx]->stateno; $expected = self::$yyExpectedTokens[$state]; if (in_array($token, self::$yyExpectedTokens[$state], true)) { return $expected; } $stack = $this->yystack; $yyidx = $this->yyidx; do { $yyact = $this->yy_find_shift_action($token); if ($yyact >= self::YYNSTATE && $yyact < self::YYNSTATE + self::YYNRULE) { // reduce action $done = 0; do { if ($done++ == 100) { $this->yyidx = $yyidx; $this->yystack = $stack; // too much recursion prevents proper detection // so give up return array_unique($expected); } $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]; if (in_array($token, self::$yyExpectedTokens[$nextstate], true)) { $this->yyidx = $yyidx; $this->yystack = $stack; return array_unique($expected); } } if ($nextstate < self::YYNSTATE) { // we need to shift a non-terminal $this->yyidx++; $x = new OQLParser_yyStackEntry; $x->stateno = $nextstate; $x->major = self::$yyRuleInfo[$yyruleno]['lhs']; $this->yystack[$this->yyidx] = $x; continue 2; } elseif ($nextstate == self::YYNSTATE + self::YYNRULE + 1) { $this->yyidx = $yyidx; $this->yystack = $stack; // the last token was just ignored, we can't accept // by ignoring input, this is in essence ignoring a // syntax error! return array_unique($expected); } elseif ($nextstate === self::YY_NO_ACTION) { $this->yyidx = $yyidx; $this->yystack = $stack; // input accepted, but not shifted (I guess) return $expected; } else { $yyact = $nextstate; } } while (true); } break; } while (true); return array_unique($expected); } /** * 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. * @param int * @return bool */ function yy_is_expected_token($token) { if ($token === 0) { return true; // 0 is not part of this } $state = $this->yystack[$this->yyidx]->stateno; if (in_array($token, self::$yyExpectedTokens[$state], true)) { return true; } $stack = $this->yystack; $yyidx = $this->yyidx; do { $yyact = $this->yy_find_shift_action($token); if ($yyact >= self::YYNSTATE && $yyact < self::YYNSTATE + self::YYNRULE) { // reduce action $done = 0; do { if ($done++ == 100) { $this->yyidx = $yyidx; $this->yystack = $stack; // too much recursion prevents proper detection // so give up return true; } $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)) { $this->yyidx = $yyidx; $this->yystack = $stack; return true; } if ($nextstate < self::YYNSTATE) { // we need to shift a non-terminal $this->yyidx++; $x = new OQLParser_yyStackEntry; $x->stateno = $nextstate; $x->major = self::$yyRuleInfo[$yyruleno]['lhs']; $this->yystack[$this->yyidx] = $x; continue 2; } elseif ($nextstate == self::YYNSTATE + self::YYNRULE + 1) { $this->yyidx = $yyidx; $this->yystack = $stack; if (!$token) { // end of input: this is valid return true; } // the last token was just ignored, we can't accept // by ignoring input, this is in essence ignoring a // syntax error! return false; } elseif ($nextstate === self::YY_NO_ACTION) { $this->yyidx = $yyidx; $this->yystack = $stack; // input accepted, but not shifted (I guess) return true; } else { $yyact = $nextstate; } } while (true); } break; } while (true); $this->yyidx = $yyidx; $this->yystack = $stack; return true; } /** * 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 * return YY_NO_ACTION. * @param int The look-ahead token */ function yy_find_shift_action($iLookAhead) { $stateno = $this->yystack[$this->yyidx]->stateno; /* if ($this->yyidx < 0) return self::YY_NO_ACTION; */ if (!isset(self::$yy_shift_ofst[$stateno])) { // no shift actions 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; } $i += $iLookAhead; 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]; } else { 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; } $i += $iLookAhead; if ($i < 0 || $i >= self::YY_SZ_ACTTAB || self::$yy_lookahead[$i] != $iLookAhead) { return self::$yy_default[$stateno]; } else { 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) { $this->yyidx++; if ($this->yyidx >= self::YYSTACKDEPTH) { $this->yyidx--; if (self::$yyTraceFILE) { fprintf(self::$yyTraceFILE, "%sStack Overflow!\n", self::$yyTracePrompt); } while ($this->yyidx >= 0) { $this->yy_pop_parser_stack(); } /* Here code is inserted which will execute if the parser ** stack ever overflows */ return; } $yytos = new OQLParser_yyStackEntry; $yytos->stateno = $yyNewState; $yytos->major = $yyMajor; $yytos->minor = $yypMinor; array_push($this->yystack, $yytos); if (self::$yyTraceFILE && $this->yyidx > 0) { fprintf(self::$yyTraceFILE, "%sShift %d\n", self::$yyTracePrompt, $yyNewState); fprintf(self::$yyTraceFILE, "%sStack:", self::$yyTracePrompt); for ($i = 1; $i <= $this->yyidx; $i++) { fprintf(self::$yyTraceFILE, " %s", self::$yyTokenName[$this->yystack[$i]->major]); } fwrite(self::$yyTraceFILE,"\n"); } } /** * The following table contains information about every rule that * is used during the reduce. * *
* array( * array( * 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' => 75, 'rhs' => 1 ), array( 'lhs' => 75, 'rhs' => 1 ), array( 'lhs' => 75, 'rhs' => 1 ), array( 'lhs' => 76, 'rhs' => 3 ), array( 'lhs' => 76, 'rhs' => 3 ), array( 'lhs' => 77, 'rhs' => 4 ), array( 'lhs' => 77, 'rhs' => 6 ), array( 'lhs' => 77, 'rhs' => 6 ), array( 'lhs' => 77, 'rhs' => 8 ), array( 'lhs' => 82, 'rhs' => 1 ), array( 'lhs' => 82, 'rhs' => 3 ), array( 'lhs' => 81, 'rhs' => 2 ), array( 'lhs' => 81, 'rhs' => 0 ), array( 'lhs' => 80, 'rhs' => 2 ), array( 'lhs' => 80, 'rhs' => 1 ), array( 'lhs' => 80, 'rhs' => 0 ), array( 'lhs' => 83, 'rhs' => 6 ), array( 'lhs' => 83, 'rhs' => 4 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 84, 'rhs' => 3 ), array( 'lhs' => 78, 'rhs' => 1 ), array( 'lhs' => 87, 'rhs' => 1 ), array( 'lhs' => 87, 'rhs' => 1 ), array( 'lhs' => 87, 'rhs' => 1 ), array( 'lhs' => 87, 'rhs' => 4 ), array( 'lhs' => 87, 'rhs' => 3 ), array( 'lhs' => 87, 'rhs' => 3 ), array( 'lhs' => 94, 'rhs' => 1 ), array( 'lhs' => 94, 'rhs' => 3 ), array( 'lhs' => 96, 'rhs' => 1 ), array( 'lhs' => 96, 'rhs' => 3 ), array( 'lhs' => 98, 'rhs' => 1 ), array( 'lhs' => 98, 'rhs' => 3 ), array( 'lhs' => 86, 'rhs' => 1 ), array( 'lhs' => 86, 'rhs' => 3 ), array( 'lhs' => 93, 'rhs' => 3 ), array( 'lhs' => 101, 'rhs' => 1 ), array( 'lhs' => 101, 'rhs' => 3 ), array( 'lhs' => 91, 'rhs' => 0 ), array( 'lhs' => 91, 'rhs' => 1 ), array( 'lhs' => 91, 'rhs' => 3 ), array( 'lhs' => 102, 'rhs' => 1 ), array( 'lhs' => 102, 'rhs' => 3 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 103, 'rhs' => 1 ), array( 'lhs' => 88, 'rhs' => 1 ), array( 'lhs' => 88, 'rhs' => 1 ), array( 'lhs' => 104, 'rhs' => 1 ), array( 'lhs' => 105, 'rhs' => 1 ), array( 'lhs' => 85, 'rhs' => 1 ), array( 'lhs' => 85, 'rhs' => 3 ), array( 'lhs' => 79, 'rhs' => 1 ), array( 'lhs' => 89, 'rhs' => 1 ), array( 'lhs' => 108, 'rhs' => 1 ), array( 'lhs' => 106, 'rhs' => 1 ), array( 'lhs' => 106, 'rhs' => 2 ), array( 'lhs' => 106, 'rhs' => 1 ), array( 'lhs' => 107, 'rhs' => 1 ), array( 'lhs' => 95, 'rhs' => 1 ), array( 'lhs' => 95, 'rhs' => 1 ), array( 'lhs' => 97, 'rhs' => 1 ), array( 'lhs' => 97, 'rhs' => 1 ), array( 'lhs' => 97, 'rhs' => 1 ), array( 'lhs' => 97, 'rhs' => 1 ), array( 'lhs' => 97, 'rhs' => 1 ), array( 'lhs' => 99, 'rhs' => 1 ), array( 'lhs' => 99, 'rhs' => 1 ), array( 'lhs' => 100, 'rhs' => 1 ), array( 'lhs' => 100, 'rhs' => 1 ), array( 'lhs' => 109, 'rhs' => 1 ), array( 'lhs' => 109, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 111, 'rhs' => 1 ), array( 'lhs' => 112, 'rhs' => 1 ), array( 'lhs' => 112, 'rhs' => 1 ), array( 'lhs' => 110, 'rhs' => 1 ), array( 'lhs' => 110, 'rhs' => 1 ), array( 'lhs' => 113, 'rhs' => 1 ), array( 'lhs' => 114, 'rhs' => 1 ), array( 'lhs' => 114, 'rhs' => 1 ), array( 'lhs' => 92, 'rhs' => 1 ), array( 'lhs' => 92, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), array( 'lhs' => 90, 'rhs' => 1 ), ); /** * 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( 0 => 0, 1 => 0, 2 => 0, 3 => 3, 4 => 3, 5 => 5, 6 => 6, 7 => 7, 8 => 8, 9 => 9, 43 => 9, 46 => 9, 10 => 10, 44 => 10, 47 => 10, 11 => 11, 12 => 12, 15 => 12, 13 => 13, 14 => 14, 16 => 16, 17 => 17, 18 => 18, 19 => 19, 20 => 20, 21 => 21, 22 => 22, 23 => 23, 24 => 24, 25 => 25, 26 => 26, 27 => 27, 28 => 27, 29 => 27, 30 => 27, 34 => 27, 36 => 27, 38 => 27, 40 => 27, 48 => 27, 50 => 27, 51 => 27, 52 => 27, 53 => 27, 54 => 27, 55 => 27, 56 => 27, 57 => 27, 31 => 31, 32 => 32, 33 => 33, 35 => 33, 37 => 33, 39 => 33, 41 => 33, 42 => 42, 45 => 45, 49 => 49, 58 => 58, 59 => 58, 60 => 60, 61 => 61, 62 => 62, 97 => 62, 98 => 62, 99 => 62, 100 => 62, 101 => 62, 102 => 62, 103 => 62, 104 => 62, 105 => 62, 106 => 62, 107 => 62, 108 => 62, 109 => 62, 110 => 62, 111 => 62, 112 => 62, 113 => 62, 114 => 62, 115 => 62, 116 => 62, 117 => 62, 118 => 62, 119 => 62, 63 => 63, 64 => 64, 65 => 65, 66 => 66, 67 => 67, 68 => 68, 69 => 69, 70 => 69, 71 => 69, 72 => 69, 73 => 69, 74 => 69, 75 => 69, 76 => 69, 77 => 69, 78 => 69, 79 => 69, 80 => 69, 81 => 69, 82 => 69, 83 => 69, 84 => 69, 85 => 69, 86 => 69, 87 => 69, 88 => 69, 89 => 69, 90 => 69, 91 => 69, 92 => 69, 93 => 69, 94 => 69, 95 => 69, 96 => 69, ); /* Beginning here are the reduction cases. A typical example ** follows: ** #line
* rule(A) ::= B. { A = 1; } ** * The parser will translate to something like: * *
* function yy_r0(){$this->_retvalue = 1;}
*
*/
private $_retvalue;
/**
* Perform a reduce action and the shift that must immediately
* follow the reduce.
*
* For a rule such as:
*
* * 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 * file) * @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 */ //OQLParser_yyStackEntry $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; if (array_key_exists($yyruleno, self::$yyReduceMap)) { // call the action $this->_retvalue = null; $this->{'yy_r' . self::$yyReduceMap[$yyruleno]}(); $yy_lefthand_side = $this->_retvalue; } $yygoto = self::$yyRuleInfo[$yyruleno]['lhs']; $yysize = self::$yyRuleInfo[$yyruleno]['rhs']; $this->yyidx -= $yysize; for ($i = $yysize; $i; $i--) { // pop all of the right-hand side parameters array_pop($this->yystack); } $yyact = $this->yy_find_reduce_action($this->yystack[$this->yyidx]->stateno, $yygoto); 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) { $this->yyidx++; $x = new OQLParser_yyStackEntry; $x->stateno = $yyact; $x->major = $yygoto; $x->minor = $yy_lefthand_side; $this->yystack[$this->yyidx] = $x; } else { $this->yy_shift($yyact, $yygoto, $yy_lefthand_side); } } elseif ($yyact == self::YYNSTATE + self::YYNRULE + 1) { $this->yy_accept(); } } /** * The following code executes when the parse fails * * Code from %parse_fail is inserted here */ function yy_parse_failed() { if (self::$yyTraceFILE) { fprintf(self::$yyTraceFILE, "%sFail!\n", self::$yyTracePrompt); } while ($this->yyidx >= 0) { $this->yy_pop_parser_stack(); } /* Here code is inserted which will be executed whenever the ** parser fails */ } /** * 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 */ function yy_syntax_error($yymajor, $TOKEN) { #line 25 "..\oql-parser.y" throw new OQLParserException($this->m_sSourceQuery, $this->m_iLine, $this->m_iCol, $this->tokenName($yymajor), $TOKEN); #line 1727 "..\oql-parser.php" } /** * The following is executed when the parser accepts * * %parse_accept code is inserted here */ function yy_accept() { if (self::$yyTraceFILE) { fprintf(self::$yyTraceFILE, "%sAccept!\n", self::$yyTracePrompt); } while ($this->yyidx >= 0) { $stack = $this->yy_pop_parser_stack(); } /* Here code is inserted which will be executed whenever the ** parser accepts */ } /** * 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 * * @return void */ 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... */ $this->yyidx = 0; $this->yyerrcnt = -1; $x = new OQLParser_yyStackEntry; $x->stateno = 0; $x->major = 0; $this->yystack = array(); array_push($this->yystack, $x); } $yyendofinput = ($yymajor==0); if (self::$yyTraceFILE) { fprintf( self::$yyTraceFILE, "%sInput %s\n", self::$yyTracePrompt, self::$yyTokenName[$yymajor] ); } do { $yyact = $this->yy_find_shift_action($yymajor); if ($yymajor < self::YYERRORSYMBOL && !$this->yy_is_expected_token($yymajor) ) { // force a syntax error $yyact = self::YY_ERROR_ACTION; } if ($yyact < self::YYNSTATE) { $this->yy_shift($yyact, $yymajor, $yytokenvalue); $this->yyerrcnt--; if ($yyendofinput && $this->yyidx >= 0) { $yymajor = 0; } else { $yymajor = self::YYNOCODE; } } elseif ($yyact < self::YYNSTATE + self::YYNRULE) { $this->yy_reduce($yyact - self::YYNSTATE); } elseif ($yyact == self::YY_ERROR_ACTION) { if (self::$yyTraceFILE) { fprintf( self::$yyTraceFILE, "%sSyntax Error!\n", self::$yyTracePrompt ); } 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 ** the error symbol. ** ** * Set the error count to three. ** ** * Begin accepting and shifting new tokens. No new error ** processing will occur until three tokens have been ** shifted successfully. ** */ if ($this->yyerrcnt < 0) { $this->yy_syntax_error($yymajor, $yytokenvalue); } $yymx = $this->yystack[$this->yyidx]->major; if ($yymx == self::YYERRORSYMBOL || $yyerrorhit ) { if (self::$yyTraceFILE) { fprintf( self::$yyTraceFILE, "%sDiscard input token %s\n", self::$yyTracePrompt, self::$yyTokenName[$yymajor] ); } $this->yy_destructor($yymajor, $yytokenvalue); $yymajor = self::YYNOCODE; } else { while ($this->yyidx >= 0 && $yymx != self::YYERRORSYMBOL && ($yyact = $this->yy_find_shift_action(self::YYERRORSYMBOL)) >= self::YYNSTATE ) { $this->yy_pop_parser_stack(); } if ($this->yyidx < 0 || $yymajor==0) { $this->yy_destructor($yymajor, $yytokenvalue); $this->yy_parse_failed(); $yymajor = self::YYNOCODE; } elseif ($yymx != self::YYERRORSYMBOL) { $u2 = 0; $this->yy_shift($yyact, self::YYERRORSYMBOL, $u2); } } $this->yyerrcnt = 3; $yyerrorhit = 1; } else { /* 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) { $this->yy_syntax_error($yymajor, $yytokenvalue); } $this->yyerrcnt = 3; $this->yy_destructor($yymajor, $yytokenvalue); if ($yyendofinput) { $this->yy_parse_failed(); } $yymajor = self::YYNOCODE; } } else { $this->yy_accept(); $yymajor = self::YYNOCODE; } } while ($yymajor != self::YYNOCODE && $this->yyidx >= 0); } } #line 239 "..\oql-parser.y" class OQLParserException extends OQLException { public function __construct($sInput, $iLine, $iCol, $sTokenName, $sTokenValue) { $sIssue = "Unexpected token $sTokenName"; parent::__construct($sIssue, $sInput, $iLine, $iCol, $sTokenValue); } } class OQLParser extends OQLParserRaw { // dirty, but working for us (no other mean to get the final result :-( protected $my_result; public function GetResult() { return $this->my_result; } // More info on the source query and the current position while parsing it // Data used when an exception is raised protected $m_iLine; // still not used protected $m_iCol; protected $m_iColPrev; // this is the interesting one, because the parser will reduce on the next token protected $m_sSourceQuery; public function __construct($sQuery) { $this->m_iLine = 0; $this->m_iCol = 0; $this->m_iColPrev = 0; $this->m_sSourceQuery = $sQuery; // no constructor - parent::__construct(); } public function doParse($token, $value, $iCurrPosition = 0) { $this->m_iColPrev = $this->m_iCol; $this->m_iCol = $iCurrPosition; return parent::DoParse($token, $value); } public function doFinish() { $this->doParse(0, 0); return $this->my_result; } public function __destruct() { // Bug in the original destructor, causing an infinite loop ! // This is a real issue when a fatal error occurs on the first token (the error could not be seen) if (is_null($this->yyidx)) { $this->yyidx = -1; } parent::__destruct(); } } #line 1960 "..\oql-parser.php"