UNPKG

t-code-generator

Version:
727 lines (686 loc) 26.2 kB
/* 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 taf = (function(){ var o=function(k,v,o,l){for(o=o||{},l=k.length;l--;o[k[l]]=v);return o},$V0=[1,5],$V1=[1,6],$V2=[1,19],$V3=[1,20],$V4=[1,21],$V5=[1,29],$V6=[1,39],$V7=[1,44],$V8=[1,43],$V9=[1,45],$Va=[1,46],$Vb=[1,47],$Vc=[13,37,39],$Vd=[13,34,35,36,38],$Ve=[1,70],$Vf=[33,39]; var parser = {trace: function trace() { }, yy: {}, symbols_: {"error":2,"expressions":3,"content":4,"EOF":5,"include":6,"module":7,"SEMICOLON":8,"INCLUDE":9,"QUOTES":10,"WORDS":11,"MODULE":12,"ID":13,"LBRACE":14,"moduleContent":15,"RBRACE":16,"struct":17,"interface":18,"key":19,"STRUCT":20,"fields":21,"field":22,"NATLITERAL":23,"isRequire":24,"dataType":25,"EQUAL":26,"constant":27,"INTERFACE":28,"methods":29,"method":30,"LPAREN":31,"args":32,"RPAREN":33,"LONGLONG":34,"UNSIGNED":35,"VECTOR":36,"GT":37,"MAP":38,"COMMA":39,"REQUIRE":40,"OPTIONAL":41,"arg":42,"OUT":43,"KEY":44,"keyItems":45,"RSBRACE":46,"$accept":0,"$end":1}, terminals_: {2:"error",5:"EOF",8:"SEMICOLON",9:"INCLUDE",10:"QUOTES",11:"WORDS",12:"MODULE",13:"ID",14:"LBRACE",16:"RBRACE",20:"STRUCT",23:"NATLITERAL",26:"EQUAL",28:"INTERFACE",31:"LPAREN",33:"RPAREN",34:"LONGLONG",35:"UNSIGNED",36:"VECTOR",37:"GT",38:"MAP",39:"COMMA",40:"REQUIRE",41:"OPTIONAL",43:"OUT",44:"KEY",46:"RSBRACE"}, productions_: [0,[3,2],[4,1],[4,2],[4,2],[6,4],[7,5],[15,2],[15,2],[15,2],[15,3],[15,3],[15,3],[17,5],[21,2],[21,3],[22,4],[22,6],[18,5],[29,2],[29,3],[30,5],[25,1],[25,1],[25,2],[25,3],[25,5],[24,1],[24,1],[42,2],[42,3],[32,3],[32,1],[27,1],[27,2],[27,3],[19,3],[45,1],[45,3]], performAction: function anonymous(yytext, yyleng, yylineno, yy, yystate /* action[1] */, $$ /* vstack */, _$ /* lstack */) { /* this == yyval */ var $0 = $$.length - 1; switch (yystate) { case 1: return this.$ break; case 2: case 32: case 37: this.$ = [$$[$0]] break; case 3: case 7: case 8: case 9: case 14: case 19: this.$ = [$$[$0-1]] break; case 4: this.$ = [$$[$0-1]].concat($$[$0]) break; case 5: this.$ = { type: 'include', path: $$[$0-1] } break; case 6: this.$ = { type: 'module', name: $$[$0-3], content: $$[$0-1] } break; case 10: case 11: case 12: case 15: case 20: case 31: case 38: this.$ = [$$[$0-2]].concat($$[$0]) break; case 13: this.$ = { type: 'struct', name: $$[$0-3], fields: $$[$0-1] } break; case 16: this.$ = { tag: $$[$0-3], require: $$[$0-2], dataType: $$[$0-1], name: $$[$0] } break; case 17: this.$ = { tag: $$[$0-5], require: $$[$0-4], dataType: $$[$0-3], name: $$[$0-2], defaultValue: $$[$0] } break; case 18: this.$ = { type: 'interface', name: $$[$0-3], methods: $$[$0-1] } break; case 21: this.$ = { returnDataType: $$[$0-4], name: $$[$0-3], args: $$[$0-1] } break; case 22: this.$ = 'longlong' break; case 23: case 33: this.$ = $$[$0] break; case 24: this.$ = 'u' + $$[$0] break; case 25: this.$ = { name: 'vector', proto: $$[$0-1] } break; case 26: this.$ = { name: 'map', kproto: $$[$0-3], vproto: $$[$0-1] } break; case 27: this.$ = true break; case 28: this.$ = false break; case 29: this.$ = { dataType: $$[$0-1], name: $$[$0] } break; case 30: this.$ = { out: true, dataType: $$[$0-1], name: $$[$0] } break; case 34: this.$ = '' break; case 35: this.$ = String($$[$0-1]) break; case 36: this.$ = { type: 'key', items: $$[$0-1] } break; } }, table: [{3:1,4:2,6:3,7:4,9:$V0,12:$V1},{1:[3]},{5:[1,7]},{4:8,5:[2,2],6:3,7:4,9:$V0,12:$V1},{8:[1,9]},{10:[1,10]},{13:[1,11]},{1:[2,1]},{5:[2,4]},{5:[2,3]},{11:[1,12]},{14:[1,13]},{10:[1,14]},{15:15,17:16,18:17,19:18,20:$V2,28:$V3,44:$V4},o([5,9,12],[2,5]),{16:[1,22]},{8:[1,23]},{8:[1,24]},{8:[1,25]},{13:[1,26]},{13:[1,27]},{13:$V5,45:28},{8:[2,6]},{15:30,16:[2,7],17:16,18:17,19:18,20:$V2,28:$V3,44:$V4},{15:31,16:[2,8],17:16,18:17,19:18,20:$V2,28:$V3,44:$V4},{15:32,16:[2,9],17:16,18:17,19:18,20:$V2,28:$V3,44:$V4},{14:[1,33]},{14:[1,34]},{46:[1,35]},{39:[1,36],46:[2,37]},{16:[2,10]},{16:[2,11]},{16:[2,12]},{21:37,22:38,23:$V6},{13:$V7,25:42,29:40,30:41,34:$V8,35:$V9,36:$Va,38:$Vb},{8:[2,36]},{13:$V5,45:48},{16:[1,49]},{8:[1,50]},{24:51,40:[1,52],41:[1,53]},{16:[1,54]},{8:[1,55]},{13:[1,56]},o($Vc,[2,22]),o($Vc,[2,23]),{13:[1,57]},{13:$V7,25:58,34:$V8,35:$V9,36:$Va,38:$Vb},{13:$V7,25:59,34:$V8,35:$V9,36:$Va,38:$Vb},{46:[2,38]},{8:[2,13]},{16:[2,14],21:60,22:38,23:$V6},{13:$V7,25:61,34:$V8,35:$V9,36:$Va,38:$Vb},o($Vd,[2,27]),o($Vd,[2,28]),{8:[2,18]},{13:$V7,16:[2,19],25:42,29:62,30:41,34:$V8,35:$V9,36:$Va,38:$Vb},{31:[1,63]},o($Vc,[2,24]),{37:[1,64]},{39:[1,65]},{16:[2,15]},{13:[1,66]},{16:[2,20]},{13:$V7,25:69,32:67,34:$V8,35:$V9,36:$Va,38:$Vb,42:68,43:$Ve},o($Vc,[2,25]),{13:$V7,25:71,34:$V8,35:$V9,36:$Va,38:$Vb},{8:[2,16],26:[1,72]},{33:[1,73]},{33:[2,32],39:[1,74]},{13:[1,75]},{13:$V7,25:76,34:$V8,35:$V9,36:$Va,38:$Vb},{37:[1,77]},{10:[1,80],23:[1,79],27:78},{8:[2,21]},{13:$V7,25:69,32:81,34:$V8,35:$V9,36:$Va,38:$Vb,42:68,43:$Ve},o($Vf,[2,29]),{13:[1,82]},o($Vc,[2,26]),{8:[2,17]},{8:[2,33]},{10:[1,83],11:[1,84]},{33:[2,31]},o($Vf,[2,30]),{8:[2,34]},{10:[1,85]},{8:[2,35]}], defaultActions: {7:[2,1],8:[2,4],9:[2,3],22:[2,6],30:[2,10],31:[2,11],32:[2,12],35:[2,36],48:[2,38],49:[2,13],54:[2,18],60:[2,15],62:[2,20],73:[2,21],78:[2,17],79:[2,33],81:[2,31],83:[2,34],85:[2,35]}, 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 34 break; case 2:return 35 break; case 3:return 12 break; case 4:return 20 break; case 5:return 40 break; case 6:return 41 break; case 7:return 28 break; case 8:return 9 break; case 9:return 43 break; case 10:return 44 break; case 11:return 36 break; case 12:return 38 break; case 13:return 23 break; case 14:return 13 break; case 15:return 14 break; case 16:return 16 break; case 17:return 'LSBRACE' break; case 18:return 46 break; case 19:return 31 break; case 20:return 33 break; case 21:return 8 break; case 22:return 'LT' break; case 23:return 37 break; case 24:return 26 break; case 25:return 39 break; case 26:return 'HASHTAG' break; case 27:return 10 break; case 28:return 11 break; case 29:return 5 break; } }, rules: [/^(?:\s+)/,/^(?:long\slong\s)/,/^(?:unsigned\s)/,/^(?:module\s)/,/^(?:struct\s)/,/^(?:require\s)/,/^(?:optional\s)/,/^(?:interface\s)/,/^(?:#include\s)/,/^(?:out\s)/,/^(?:key\[)/,/^(?:vector<)/,/^(?:map<)/,/^(?:[0-9]+)/,/^(?:[a-zA-Z][a-zA-Z0-9]*)/,/^(?:{)/,/^(?:})/,/^(?:\[)/,/^(?:\])/,/^(?:\()/,/^(?:\))/,/^(?:;)/,/^(?:<)/,/^(?:>)/,/^(?:=)/,/^(?:,)/,/^(?:#)/,/^(?:")/,/^(?:[^"]+)/,/^(?:$)/], 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],"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 = taf; exports.Parser = taf.Parser; exports.parse = function () { return taf.parse.apply(taf, 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)); } }