trident-beta
Version:
trident is a sample and lightly tools aims to improve collaboration efficiency between SDET and QA based on initiative from Einstein/TestIT.
1,474 lines (1,428 loc) • 36.3 kB
JavaScript
/* parser generated by jison 0.4.18 */
/*
Returns a Parser object of the following structure:
Parser: {
yy: {}
}
Parser.prototype: {
yy: {},
trace: function(),
symbols_: {associative list: name ==> number},
terminals_: {associative list: number ==> name},
productions_: [...],
performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$),
table: [...],
defaultActions: {...},
parseError: function(str, hash),
parse: function(input),
lexer: {
EOF: 1,
parseError: function(str, hash),
setInput: function(input),
input: function(),
unput: function(str),
more: function(),
less: function(n),
pastInput: function(),
upcomingInput: function(),
showPosition: function(),
test_match: function(regex_match_array, rule_index),
next: function(),
lex: function(),
begin: function(condition),
popState: function(),
_currentRules: function(),
topState: function(),
pushState: function(condition),
options: {
ranges: boolean (optional: true ==> token location info will include a .range[] member)
flex: boolean (optional: true ==> flex-like lexing behaviour where the rules are tested exhaustively to find the longest match)
backtrack_lexer: boolean (optional: true ==> lexer regexes are tested in order and for each matching regex the action code is invoked; the lexer terminates the scan when a token is returned by the action code)
},
performAction: function(yy, yy_, $avoiding_name_collisions, YY_START),
rules: [...],
conditions: {associative list: name ==> set},
}
}
token location info (@$, _$, etc.): {
first_line: n,
last_line: n,
first_column: n,
last_column: n,
range: [start_number, end_number] (where the numbers are indexes into the input string, regular zero-based)
}
the parseError function receives a 'hash' object with these members for lexer and parser errors: {
text: (matched text)
token: (the produced terminal token, if any)
line: (yylineno)
}
while parser (grammar) errors will also provide these members, i.e. parser errors deliver a superset of attributes: {
loc: (yylloc)
expected: (string describing the set of expected tokens)
recoverable: (boolean: TRUE when the parser has a error recovery rule available for this particular error)
}
*/
var parser = (function() {
var o = function(k, v, o, l) {
for (o = o || {}, l = k.length; l--; o[k[l]] = v);
return o;
},
$V0 = [1, 7],
$V1 = [1, 9],
$V2 = [1, 10],
$V3 = [1, 11],
$V4 = [1, 12],
$V5 = [1, 13],
$V6 = [1, 14],
$V7 = [1, 15],
$V8 = [1, 16],
$V9 = [1, 17],
$Va = [1, 18],
$Vb = [1, 19],
$Vc = [1, 20],
$Vd = [1, 21],
$Ve = [1, 22],
$Vf = [1, 23],
$Vg = [1, 24],
$Vh = [1, 25],
$Vi = [1, 26],
$Vj = [1, 27],
$Vk = [1, 28],
$Vl = [1, 29],
$Vm = [1, 30],
$Vn = [1, 31],
$Vo = [1, 32],
$Vp = [1, 33],
$Vq = [1, 34],
$Vr = [1, 35],
$Vs = [1, 36],
$Vt = [1, 37],
$Vu = [1, 38],
$Vv = [1, 41],
$Vw = [1, 40],
$Vx = [5, 11, 12, 13],
$Vy = [46, 47, 48, 49, 50, 51, 52, 53];
var parser = {
trace: function trace() {},
yy: {},
symbols_: {
error: 2,
start: 3,
expression: 4,
EOF: 5,
custom_expression: 6,
logical_and_expression: 7,
logical_or_expression: 8,
logical_not_expression: 9,
LPAREN: 10,
RPAREN: 11,
OR: 12,
AND: 13,
NOT: 14,
property_specifier: 15,
PROJECT: 16,
TEST_PLAN: 17,
CASE_ID: 18,
CASE_NAME: 19,
SUITE: 20,
SUITE_NAME: 21,
SUMMARY: 22,
PRECONDITIONS: 23,
TEST_STEP: 24,
EXPECTED_RESULT: 25,
TEXT: 26,
PRIORITY: 27,
EXECUTION_TYPE: 28,
LAST_EXECUTION_STATUS: 29,
EXECUTION_STATUS: 30,
TESTED_BY: 31,
VERSION: 32,
VERSION_NUMBER: 33,
CREATED_BY: 34,
DATE_CREATED: 35,
UPDATED_BY: 36,
LAST_UPDATED: 37,
DOCUMENT_ID: 38,
CUSTOM_FIELD: 39,
RUN: 40,
SUBTYPE: 41,
KEYWORDS: 42,
PROJECT_ID: 43,
AUTOMATED_BY: 44,
op_specifier: 45,
EQ: 46,
NEQ: 47,
IN: 48,
LIKE: 49,
LT: 50,
LTE: 51,
GT: 52,
GTE: 53,
STRING_LITERAL: 54,
$accept: 0,
$end: 1
},
terminals_: {
2: "error",
5: "EOF",
10: "LPAREN",
11: "RPAREN",
12: "OR",
13: "AND",
14: "NOT",
16: "PROJECT",
17: "TEST_PLAN",
18: "CASE_ID",
19: "CASE_NAME",
20: "SUITE",
21: "SUITE_NAME",
22: "SUMMARY",
23: "PRECONDITIONS",
24: "TEST_STEP",
25: "EXPECTED_RESULT",
26: "TEXT",
27: "PRIORITY",
28: "EXECUTION_TYPE",
29: "LAST_EXECUTION_STATUS",
30: "EXECUTION_STATUS",
31: "TESTED_BY",
32: "VERSION",
33: "VERSION_NUMBER",
34: "CREATED_BY",
35: "DATE_CREATED",
36: "UPDATED_BY",
37: "LAST_UPDATED",
38: "DOCUMENT_ID",
39: "CUSTOM_FIELD",
40: "RUN",
41: "SUBTYPE",
42: "KEYWORDS",
43: "PROJECT_ID",
44: "AUTOMATED_BY",
46: "EQ",
47: "NEQ",
48: "IN",
49: "LIKE",
50: "LT",
51: "LTE",
52: "GT",
53: "GTE",
54: "STRING_LITERAL"
},
productions_: [
0,
[3, 2],
[4, 1],
[4, 1],
[4, 1],
[4, 1],
[4, 3],
[8, 3],
[7, 3],
[9, 2],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[15, 1],
[45, 1],
[45, 1],
[45, 1],
[45, 1],
[45, 1],
[45, 1],
[45, 1],
[45, 1],
[6, 3]
],
performAction: function anonymous(
yytext,
yyleng,
yylineno,
yy,
yystate /* action[1] */,
$$ /* vstack */,
_$ /* lstack */
) {
/* this == yyval */
var $0 = $$.length - 1;
switch (yystate) {
case 1:
return $$[$0 - 1];
break;
case 5:
case 38:
case 46:
this.$ = $$[$0];
break;
case 6:
this.$ = $$[$0 - 1];
break;
case 7:
this.$ = {
type: $$[$0 - 1],
left: $$[$0 - 2],
right: $$[$0]
};
break;
case 8:
this.$ = {
type: $$[$0 - 1],
left: $$[$0 - 2],
right: $$[$0]
};
break;
case 9:
this.$ = {
type: (function getOp(op) {
if (op === "!") {
return "not";
}
return op;
})($$[$0 - 1]),
operation: $$[$0]
};
break;
case 47:
this.$ = (function(left, op, right) {
if (op === "!=") {
return {
type: "not",
operation: {
property: $$[$0 - 2],
type: "=",
value: $$[$0]
}
};
} else {
return {
property: $$[$0 - 2],
type: $$[$0 - 1],
value: $$[$0]
};
}
})($$[$0 - 2], $$[$0 - 1], $$[$0]);
break;
}
},
table: [
{
3: 1,
4: 2,
6: 3,
7: 4,
8: 5,
9: 6,
10: $V0,
14: $V1,
15: 8,
16: $V2,
17: $V3,
18: $V4,
19: $V5,
20: $V6,
21: $V7,
22: $V8,
23: $V9,
24: $Va,
25: $Vb,
26: $Vc,
27: $Vd,
28: $Ve,
29: $Vf,
30: $Vg,
31: $Vh,
32: $Vi,
33: $Vj,
34: $Vk,
35: $Vl,
36: $Vm,
37: $Vn,
38: $Vo,
39: $Vp,
40: $Vq,
41: $Vr,
42: $Vs,
43: $Vt,
44: $Vu
},
{ 1: [3] },
{ 5: [1, 39], 12: $Vv, 13: $Vw },
o($Vx, [2, 2]),
o($Vx, [2, 3]),
o($Vx, [2, 4]),
o($Vx, [2, 5]),
{
4: 42,
6: 3,
7: 4,
8: 5,
9: 6,
10: $V0,
14: $V1,
15: 8,
16: $V2,
17: $V3,
18: $V4,
19: $V5,
20: $V6,
21: $V7,
22: $V8,
23: $V9,
24: $Va,
25: $Vb,
26: $Vc,
27: $Vd,
28: $Ve,
29: $Vf,
30: $Vg,
31: $Vh,
32: $Vi,
33: $Vj,
34: $Vk,
35: $Vl,
36: $Vm,
37: $Vn,
38: $Vo,
39: $Vp,
40: $Vq,
41: $Vr,
42: $Vs,
43: $Vt,
44: $Vu
},
{
45: 43,
46: [1, 44],
47: [1, 45],
48: [1, 46],
49: [1, 47],
50: [1, 48],
51: [1, 49],
52: [1, 50],
53: [1, 51]
},
{
4: 52,
6: 3,
7: 4,
8: 5,
9: 6,
10: $V0,
14: $V1,
15: 8,
16: $V2,
17: $V3,
18: $V4,
19: $V5,
20: $V6,
21: $V7,
22: $V8,
23: $V9,
24: $Va,
25: $Vb,
26: $Vc,
27: $Vd,
28: $Ve,
29: $Vf,
30: $Vg,
31: $Vh,
32: $Vi,
33: $Vj,
34: $Vk,
35: $Vl,
36: $Vm,
37: $Vn,
38: $Vo,
39: $Vp,
40: $Vq,
41: $Vr,
42: $Vs,
43: $Vt,
44: $Vu
},
o($Vy, [2, 10]),
o($Vy, [2, 11]),
o($Vy, [2, 12]),
o($Vy, [2, 13]),
o($Vy, [2, 14]),
o($Vy, [2, 15]),
o($Vy, [2, 16]),
o($Vy, [2, 17]),
o($Vy, [2, 18]),
o($Vy, [2, 19]),
o($Vy, [2, 20]),
o($Vy, [2, 21]),
o($Vy, [2, 22]),
o($Vy, [2, 23]),
o($Vy, [2, 24]),
o($Vy, [2, 25]),
o($Vy, [2, 26]),
o($Vy, [2, 27]),
o($Vy, [2, 28]),
o($Vy, [2, 29]),
o($Vy, [2, 30]),
o($Vy, [2, 31]),
o($Vy, [2, 32]),
o($Vy, [2, 33]),
o($Vy, [2, 34]),
o($Vy, [2, 35]),
o($Vy, [2, 36]),
o($Vy, [2, 37]),
o($Vy, [2, 38]),
{ 1: [2, 1] },
{
4: 53,
6: 3,
7: 4,
8: 5,
9: 6,
10: $V0,
14: $V1,
15: 8,
16: $V2,
17: $V3,
18: $V4,
19: $V5,
20: $V6,
21: $V7,
22: $V8,
23: $V9,
24: $Va,
25: $Vb,
26: $Vc,
27: $Vd,
28: $Ve,
29: $Vf,
30: $Vg,
31: $Vh,
32: $Vi,
33: $Vj,
34: $Vk,
35: $Vl,
36: $Vm,
37: $Vn,
38: $Vo,
39: $Vp,
40: $Vq,
41: $Vr,
42: $Vs,
43: $Vt,
44: $Vu
},
{
4: 54,
6: 3,
7: 4,
8: 5,
9: 6,
10: $V0,
14: $V1,
15: 8,
16: $V2,
17: $V3,
18: $V4,
19: $V5,
20: $V6,
21: $V7,
22: $V8,
23: $V9,
24: $Va,
25: $Vb,
26: $Vc,
27: $Vd,
28: $Ve,
29: $Vf,
30: $Vg,
31: $Vh,
32: $Vi,
33: $Vj,
34: $Vk,
35: $Vl,
36: $Vm,
37: $Vn,
38: $Vo,
39: $Vp,
40: $Vq,
41: $Vr,
42: $Vs,
43: $Vt,
44: $Vu
},
{ 11: [1, 55], 12: $Vv, 13: $Vw },
{ 54: [1, 56] },
{ 54: [2, 39] },
{ 54: [2, 40] },
{ 54: [2, 41] },
{ 54: [2, 42] },
{ 54: [2, 43] },
{ 54: [2, 44] },
{ 54: [2, 45] },
{ 54: [2, 46] },
o($Vx, [2, 9]),
o($Vx, [2, 8]),
o($Vx, [2, 7]),
o($Vx, [2, 6]),
o($Vx, [2, 47])
],
defaultActions: {
39: [2, 1],
44: [2, 39],
45: [2, 40],
46: [2, 41],
47: [2, 42],
48: [2, 43],
49: [2, 44],
50: [2, 45],
51: [2, 46]
},
parseError: function parseError(str, hash) {
if (hash.recoverable) {
this.trace(str);
} else {
var error = new Error(str);
error.hash = hash;
throw error;
}
},
parse: function parse(input) {
var self = this,
stack = [0],
tstack = [],
vstack = [null],
lstack = [],
table = this.table,
yytext = "",
yylineno = 0,
yyleng = 0,
recovering = 0,
TERROR = 2,
EOF = 1;
var args = lstack.slice.call(arguments, 1);
var lexer = Object.create(this.lexer);
var sharedState = { yy: {} };
for (var k in this.yy) {
if (Object.prototype.hasOwnProperty.call(this.yy, k)) {
sharedState.yy[k] = this.yy[k];
}
}
lexer.setInput(input, sharedState.yy);
sharedState.yy.lexer = lexer;
sharedState.yy.parser = this;
if (typeof lexer.yylloc == "undefined") {
lexer.yylloc = {};
}
var yyloc = lexer.yylloc;
lstack.push(yyloc);
var ranges = lexer.options && lexer.options.ranges;
if (typeof sharedState.yy.parseError === "function") {
this.parseError = sharedState.yy.parseError;
} else {
this.parseError = Object.getPrototypeOf(this).parseError;
}
function popStack(n) {
stack.length = stack.length - 2 * n;
vstack.length = vstack.length - n;
lstack.length = lstack.length - n;
}
_token_stack: var lex = function() {
var token;
token = lexer.lex() || EOF;
if (typeof token !== "number") {
token = self.symbols_[token] || token;
}
return token;
};
var symbol,
preErrorSymbol,
state,
action,
a,
r,
yyval = {},
p,
len,
newState,
expected;
while (true) {
state = stack[stack.length - 1];
if (this.defaultActions[state]) {
action = this.defaultActions[state];
} else {
if (symbol === null || typeof symbol == "undefined") {
symbol = lex();
}
action = table[state] && table[state][symbol];
}
if (typeof action === "undefined" || !action.length || !action[0]) {
var errStr = "";
expected = [];
for (p in table[state]) {
if (this.terminals_[p] && p > TERROR) {
expected.push("'" + this.terminals_[p] + "'");
}
}
if (lexer.showPosition) {
errStr =
"Parse error on line " +
(yylineno + 1) +
":\n" +
lexer.showPosition() +
"\nExpecting " +
expected.join(", ") +
", got '" +
(this.terminals_[symbol] || symbol) +
"'";
} else {
errStr =
"Parse error on line " +
(yylineno + 1) +
": Unexpected " +
(symbol == EOF
? "end of input"
: "'" + (this.terminals_[symbol] || symbol) + "'");
}
this.parseError(errStr, {
text: lexer.match,
token: this.terminals_[symbol] || symbol,
line: lexer.yylineno,
loc: yyloc,
expected: expected
});
}
if (action[0] instanceof Array && action.length > 1) {
throw new Error(
"Parse Error: multiple actions possible at state: " +
state +
", token: " +
symbol
);
}
switch (action[0]) {
case 1:
stack.push(symbol);
vstack.push(lexer.yytext);
lstack.push(lexer.yylloc);
stack.push(action[1]);
symbol = null;
if (!preErrorSymbol) {
yyleng = lexer.yyleng;
yytext = lexer.yytext;
yylineno = lexer.yylineno;
yyloc = lexer.yylloc;
if (recovering > 0) {
recovering--;
}
} else {
symbol = preErrorSymbol;
preErrorSymbol = null;
}
break;
case 2:
len = this.productions_[action[1]][1];
yyval.$ = vstack[vstack.length - len];
yyval._$ = {
first_line: lstack[lstack.length - (len || 1)].first_line,
last_line: lstack[lstack.length - 1].last_line,
first_column: lstack[lstack.length - (len || 1)].first_column,
last_column: lstack[lstack.length - 1].last_column
};
if (ranges) {
yyval._$.range = [
lstack[lstack.length - (len || 1)].range[0],
lstack[lstack.length - 1].range[1]
];
}
r = this.performAction.apply(
yyval,
[
yytext,
yyleng,
yylineno,
sharedState.yy,
action[1],
vstack,
lstack
].concat(args)
);
if (typeof r !== "undefined") {
return r;
}
if (len) {
stack = stack.slice(0, -1 * len * 2);
vstack = vstack.slice(0, -1 * len);
lstack = lstack.slice(0, -1 * len);
}
stack.push(this.productions_[action[1]][0]);
vstack.push(yyval.$);
lstack.push(yyval._$);
newState = table[stack[stack.length - 2]][stack[stack.length - 1]];
stack.push(newState);
break;
case 3:
return true;
}
}
return true;
}
};
/* generated by jison-lex 0.3.4 */
var lexer = (function() {
var lexer = {
EOF: 1,
parseError: function parseError(str, hash) {
if (this.yy.parser) {
this.yy.parser.parseError(str, hash);
} else {
throw new Error(str);
}
},
// resets the lexer, sets new input
setInput: function(input, yy) {
this.yy = yy || this.yy || {};
this._input = input;
this._more = this._backtrack = this.done = false;
this.yylineno = this.yyleng = 0;
this.yytext = this.matched = this.match = "";
this.conditionStack = ["INITIAL"];
this.yylloc = {
first_line: 1,
first_column: 0,
last_line: 1,
last_column: 0
};
if (this.options.ranges) {
this.yylloc.range = [0, 0];
}
this.offset = 0;
return this;
},
// consumes and returns one char from the input
input: function() {
var ch = this._input[0];
this.yytext += ch;
this.yyleng++;
this.offset++;
this.match += ch;
this.matched += ch;
var lines = ch.match(/(?:\r\n?|\n).*/g);
if (lines) {
this.yylineno++;
this.yylloc.last_line++;
} else {
this.yylloc.last_column++;
}
if (this.options.ranges) {
this.yylloc.range[1]++;
}
this._input = this._input.slice(1);
return ch;
},
// unshifts one char (or a string) into the input
unput: function(ch) {
var len = ch.length;
var lines = ch.split(/(?:\r\n?|\n)/g);
this._input = ch + this._input;
this.yytext = this.yytext.substr(0, this.yytext.length - len);
//this.yyleng -= len;
this.offset -= len;
var oldLines = this.match.split(/(?:\r\n?|\n)/g);
this.match = this.match.substr(0, this.match.length - 1);
this.matched = this.matched.substr(0, this.matched.length - 1);
if (lines.length - 1) {
this.yylineno -= lines.length - 1;
}
var r = this.yylloc.range;
this.yylloc = {
first_line: this.yylloc.first_line,
last_line: this.yylineno + 1,
first_column: this.yylloc.first_column,
last_column: lines
? (lines.length === oldLines.length
? this.yylloc.first_column
: 0) +
oldLines[oldLines.length - lines.length].length -
lines[0].length
: this.yylloc.first_column - len
};
if (this.options.ranges) {
this.yylloc.range = [r[0], r[0] + this.yyleng - len];
}
this.yyleng = this.yytext.length;
return this;
},
// When called from action, caches matched text and appends it on next action
more: function() {
this._more = true;
return this;
},
// When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
reject: function() {
if (this.options.backtrack_lexer) {
this._backtrack = true;
} else {
return this.parseError(
"Lexical error on line " +
(this.yylineno + 1) +
". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\n" +
this.showPosition(),
{
text: "",
token: null,
line: this.yylineno
}
);
}
return this;
},
// retain first n characters of the match
less: function(n) {
this.unput(this.match.slice(n));
},
// displays already matched input, i.e. for error messages
pastInput: function() {
var past = this.matched.substr(
0,
this.matched.length - this.match.length
);
return (
(past.length > 20 ? "..." : "") + past.substr(-20).replace(/\n/g, "")
);
},
// displays upcoming input, i.e. for error messages
upcomingInput: function() {
var next = this.match;
if (next.length < 20) {
next += this._input.substr(0, 20 - next.length);
}
return (next.substr(0, 20) + (next.length > 20 ? "..." : "")).replace(
/\n/g,
""
);
},
// displays the character position where the lexing error occurred, i.e. for error messages
showPosition: function() {
var pre = this.pastInput();
var c = new Array(pre.length + 1).join("-");
return pre + this.upcomingInput() + "\n" + c + "^";
},
// test the lexed token: return FALSE when not a match, otherwise return token
test_match: function(match, indexed_rule) {
var token, lines, backup;
if (this.options.backtrack_lexer) {
// save context
backup = {
yylineno: this.yylineno,
yylloc: {
first_line: this.yylloc.first_line,
last_line: this.last_line,
first_column: this.yylloc.first_column,
last_column: this.yylloc.last_column
},
yytext: this.yytext,
match: this.match,
matches: this.matches,
matched: this.matched,
yyleng: this.yyleng,
offset: this.offset,
_more: this._more,
_input: this._input,
yy: this.yy,
conditionStack: this.conditionStack.slice(0),
done: this.done
};
if (this.options.ranges) {
backup.yylloc.range = this.yylloc.range.slice(0);
}
}
lines = match[0].match(/(?:\r\n?|\n).*/g);
if (lines) {
this.yylineno += lines.length;
}
this.yylloc = {
first_line: this.yylloc.last_line,
last_line: this.yylineno + 1,
first_column: this.yylloc.last_column,
last_column: lines
? lines[lines.length - 1].length -
lines[lines.length - 1].match(/\r?\n?/)[0].length
: this.yylloc.last_column + match[0].length
};
this.yytext += match[0];
this.match += match[0];
this.matches = match;
this.yyleng = this.yytext.length;
if (this.options.ranges) {
this.yylloc.range = [this.offset, (this.offset += this.yyleng)];
}
this._more = false;
this._backtrack = false;
this._input = this._input.slice(match[0].length);
this.matched += match[0];
token = this.performAction.call(
this,
this.yy,
this,
indexed_rule,
this.conditionStack[this.conditionStack.length - 1]
);
if (this.done && this._input) {
this.done = false;
}
if (token) {
return token;
} else if (this._backtrack) {
// recover context
for (var k in backup) {
this[k] = backup[k];
}
return false; // rule action called reject() implying the next rule should be tested instead.
}
return false;
},
// return next match in input
next: function() {
if (this.done) {
return this.EOF;
}
if (!this._input) {
this.done = true;
}
var token, match, tempMatch, index;
if (!this._more) {
this.yytext = "";
this.match = "";
}
var rules = this._currentRules();
for (var i = 0; i < rules.length; i++) {
tempMatch = this._input.match(this.rules[rules[i]]);
if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {
match = tempMatch;
index = i;
if (this.options.backtrack_lexer) {
token = this.test_match(tempMatch, rules[i]);
if (token !== false) {
return token;
} else if (this._backtrack) {
match = false;
continue; // rule action called reject() implying a rule MISmatch.
} else {
// else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
return false;
}
} else if (!this.options.flex) {
break;
}
}
}
if (match) {
token = this.test_match(match, rules[index]);
if (token !== false) {
return token;
}
// else: this is a lexer rule which consumes input without producing a token (e.g. whitespace)
return false;
}
if (this._input === "") {
return this.EOF;
} else {
return this.parseError(
"Lexical error on line " +
(this.yylineno + 1) +
". Unrecognized text.\n" +
this.showPosition(),
{
text: "",
token: null,
line: this.yylineno
}
);
}
},
// return next match that has a token
lex: function lex() {
var r = this.next();
if (r) {
return r;
} else {
return this.lex();
}
},
// activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
begin: function begin(condition) {
this.conditionStack.push(condition);
},
// pop the previously active lexer condition state off the condition stack
popState: function popState() {
var n = this.conditionStack.length - 1;
if (n > 0) {
return this.conditionStack.pop();
} else {
return this.conditionStack[0];
}
},
// produce the lexer rule set which is active for the currently active lexer condition state
_currentRules: function _currentRules() {
if (
this.conditionStack.length &&
this.conditionStack[this.conditionStack.length - 1]
) {
return this.conditions[
this.conditionStack[this.conditionStack.length - 1]
].rules;
} else {
return this.conditions["INITIAL"].rules;
}
},
// return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
topState: function topState(n) {
n = this.conditionStack.length - 1 - Math.abs(n || 0);
if (n >= 0) {
return this.conditionStack[n];
} else {
return "INITIAL";
}
},
// alias for begin(condition)
pushState: function pushState(condition) {
this.begin(condition);
},
// return the number of states currently on the stack
stateStackSize: function stateStackSize() {
return this.conditionStack.length;
},
options: {},
performAction: function anonymous(
yy,
yy_,
$avoiding_name_collisions,
YY_START
) {
var YYSTATE = YY_START;
switch ($avoiding_name_collisions) {
case 0 /* skip whitespace */:
break;
case 1:
return 13;
break;
case 2:
return 12;
break;
case 3:
return 51;
break;
case 4:
return 53;
break;
case 5:
return 53;
break;
case 6:
return 50;
break;
case 7:
return 50;
break;
case 8:
return 52;
break;
case 9:
return 46;
break;
case 10:
return 46;
break;
case 11:
return 47;
break;
case 12:
return 14;
break;
case 13:
return 10;
break;
case 14:
return 11;
break;
case 15:
return 48;
break;
case 16:
return 49;
break;
case 17:
return 39;
break;
case 18:
return 54;
break;
case 19:
return 16;
break;
case 20:
return 43;
break;
case 21:
return 17;
break;
case 22:
return 18;
break;
case 23:
return 19;
break;
case 24:
return 20;
break;
case 25:
return 21;
break;
case 26:
return 22;
break;
case 27:
return 23;
break;
case 28:
return 24;
break;
case 29:
return 25;
break;
case 30:
return 26;
break;
case 31:
return 27;
break;
case 32:
return 28;
break;
case 33:
return 29;
break;
case 34:
return 30;
break;
case 35:
return 31;
break;
case 36:
return 32;
break;
case 37:
return 33;
break;
case 38:
return 34;
break;
case 39:
return 35;
break;
case 40:
return 36;
break;
case 41:
return 37;
break;
case 42:
return 38;
break;
case 43:
return 40;
break;
case 44:
return 41;
break;
case 45:
return 42;
break;
case 46:
return 42;
break;
case 47:
return 41;
break;
case 48:
return 44;
break;
case 49:
return 43;
break;
case 50:
return 5;
break;
case 51:
return "INVALID";
break;
}
},
rules: [
/^(?:\s+)/,
/^(?:and\b)/,
/^(?:or\b)/,
/^(?:<=)/,
/^(?:>=)/,
/^(?:gte\b)/,
/^(?:<)/,
/^(?:lt\b)/,
/^(?:>)/,
/^(?:=)/,
/^(?:eq\b)/,
/^(?:!=)/,
/^(?:!)/,
/^(?:\()/,
/^(?:\))/,
/^(?:in\b)/,
/^(?:like\b)/,
/^(?:@([\s\S]+?)@)/,
/^(?:L?"(\\.|[^\\"])*")/,
/^(?:project\b)/,
/^(?:project_id\b)/,
/^(?:test_plan\b)/,
/^(?:case_id\b)/,
/^(?:case_name\b)/,
/^(?:suite\b)/,
/^(?:suite_name\b)/,
/^(?:summary\b)/,
/^(?:preconditions\b)/,
/^(?:test_step\b)/,
/^(?:expected_result\b)/,
/^(?:text\b)/,
/^(?:priority\b)/,
/^(?:execution_type\b)/,
/^(?:last_execution_status\b)/,
/^(?:execution_status\b)/,
/^(?:tested_by\b)/,
/^(?:version\b)/,
/^(?:version_number\b)/,
/^(?:created_by\b)/,
/^(?:date_created\b)/,
/^(?:updated_by\b)/,
/^(?:last_updated\b)/,
/^(?:document_id\b)/,
/^(?:run\b)/,
/^(?:subtype\b)/,
/^(?:keywords\b)/,
/^(?:field\.224\b)/,
/^(?:field\.5371560\b)/,
/^(?:field\.6615030\b)/,
/^(?:project_id\b)/,
/^(?:$)/,
/^(?:.)/
],
conditions: {
INITIAL: {
rules: [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
37,
38,
39,
40,
41,
42,
43,
44,
45,
46,
47,
48,
49,
50,
51
],
inclusive: true
}
}
};
return lexer;
})();
parser.lexer = lexer;
function Parser() {
this.yy = {};
}
Parser.prototype = parser;
parser.Parser = Parser;
return new Parser();
})();
if (typeof require !== "undefined" && typeof exports !== "undefined") {
exports.parser = parser;
exports.Parser = parser.Parser;
exports.parse = function() {
return parser.parse.apply(parser, arguments);
};
exports.main = function commonjsMain(args) {
if (!args[1]) {
console.log("Usage: " + args[0] + " FILE");
process.exit(1);
}
var source = require("fs").readFileSync(
require("path").normalize(args[1]),
"utf8"
);
return exports.parser.parse(source);
};
if (typeof module !== "undefined" && require.main === module) {
exports.main(process.argv.slice(1));
}
}