📄 `chevrotain.module.min.js`¶

📊 Analysis Summary¶

Metric	Count
🔧 Functions	608
📊 Variables & Constants	523

📚 Table of Contents¶

Variables & Constants
Functions

🛠️ File Location:¶

📂 examples/jsm/libs/chevrotain.module.min.js

Variables & Constants¶

Name	Type	Kind	Value	Exported
`__spreadArray`	`any`	let/var	`exports&&exports.__spreadArray\\|\\|function(t,e){for(var r=0,n=e.length,i=t.le...`	✗
`a`	`string`	let/var	`n[i]`	✗
`n`	`any`	let/var	`t[r]`	✗
`e`	`any`	let/var	`t&&t.length`	✗
`i`	`string`	let/var	`n[r]`	✗
`a`	`any`	let/var	`t[i]`	✗
`r`	`any[]`	let/var	`[]`	✗
`i`	`any`	let/var	`t[n]`	✗
`a`	`string`	let/var	`r[i]`	✗
`o`	`any`	let/var	`t[a]`	✗
`e`	`{}`	let/var	`{}`	✗
`n`	`any`	let/var	`t[r]`	✗
`i`	`any`	let/var	`t[n]`	✗
`r`	`any[]`	let/var	`[]`	✗
`n`	`any[]`	let/var	`[null]`	✗
`s`	`string`	let/var	`a[o]`	✗
`s`	`string`	let/var	`a[o]`	✗
`r`	`{}`	let/var	`{}`	✗
`a`	`any`	let/var	`r[i]`	✗
`a`	`string`	let/var	`n[i]`	✗
`o`	`any`	let/var	`e[a]`	✗
`n`	`any`	let/var	`t[r]`	✗
`i`	`number`	let/var	`n-e`	✗
`fakeInstance`	`any`	let/var	`new FakeConstructor`	✗
`u`	`any[]`	let/var	`[]`	✗
`d`	`any`	let/var	`this.idx`	✗
`u`	`any`	let/var	`this.idx`	✗
`d`	`any`	let/var	`not shown`	✗
`d`	`any`	let/var	`not shown`	✗
`A`	`any`	let/var	`this.idx`	✗
`g`	`any`	let/var	`not shown`	✗
`u`	`any`	let/var	`not shown`	✗
`d`	`any`	let/var	`this.idx`	✗
`u`	`any`	let/var	`not shown`	✗
`d`	`boolean`	let/var	`!1`	✗
`u`	`any`	let/var	`not shown`	✗
`d`	`number`	let/var	`u.toUpperCase().charCodeAt(0)-64`	✗
`u`	`any[]`	let/var	`[]`	✗
`d`	`boolean`	let/var	`!1`	✗
`_`	`boolean`	let/var	`A.type==="Character"`	✗
`y`	`boolean`	let/var	`g.type==="Character"`	✗
`u`	`boolean`	let/var	`!0`	✗
`A`	`any`	let/var	`{type:"Group",capturing:u,value:d}`	✗
`e`	`RegExp`	let/var	`/[0-9a-fA-F]/`	✗
`r`	`RegExp`	let/var	`/[0-9]/`	✗
`n`	`RegExp`	let/var	`/[1-9]/`	✗
`f`	`any`	let/var	`not shown`	✗
`p`	`any[]`	let/var	`[]`	✗
`m`	`any[]`	let/var	`[i(" "),i("\f"),i(` `),i("\r"),i(" "),i("\v"),i(" "),i("\xA0"),i("\u1680"),i(...`	✗
`A`	`any`	let/var	`u[d]`	✗
`Ct`	`{}`	let/var	`{}`	✗
`Wa`	`any`	let/var	`new Ga.RegExpParser`	✗
`ja`	`any`	let/var	`re&&re.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototy...`	✗
`ln`	`string`	let/var	`"Complement Sets are not supported for first char optimization"`	✗
`i`	`string`	let/var	`""`	✗
`a`	`any`	let/var	`i[n]`	✗
`o`	`any`	let/var	`a`	✗
`p`	`any`	let/var	`f`	✗
`s`	`boolean`	let/var	`o.quantifier!==void 0&&o.quantifier.atLeast===0`	✗
`n`	`any`	let/var	`r`	✗
`n`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`n`	`e`	let/var	`new za(t)`	✗
`hn`	`any`	let/var	`T&&T.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`Ae`	`string`	let/var	`"PATTERN"`	✗
`r`	`any`	let/var	`e.tracer`	✗
`n`	`any`	let/var	`not shown`	✗
`i`	`boolean`	let/var	`!1`	✗
`a`	`any`	let/var	`not shown`	✗
`y`	`any`	let/var	`g[Ae]`	✗
`b`	`any`	let/var	`y.source`	✗
`se`	`RegExp`	let/var	`new RegExp(L)`	✗
`o`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`not shown`	✗
`c`	`any`	let/var	`not shown`	✗
`f`	`any`	let/var	`not shown`	✗
`p`	`any`	let/var	`not shown`	✗
`y`	`any`	let/var	`g.GROUP`	✗
`y`	`any`	let/var	`g.LONGER_ALT`	✗
`l`	`any`	let/var	`not shown`	✗
`m`	`any`	let/var	`not shown`	✗
`v`	`any`	let/var	`not shown`	✗
`u`	`any`	let/var	`not shown`	✗
`d`	`any`	let/var	`not shown`	✗
`b`	`any`	let/var	`y.GROUP`	✗
`A`	`boolean`	let/var	`!0`	✗
`_`	`any[]`	let/var	`[]`	✗
`fe`	`any`	let/var	`not shown`	✗
`Q`	`any`	let/var	`typeof ue=="string"?ue.charCodeAt(0):ue`	✗
`r`	`any[]`	let/var	`[]`	✗
`a`	`any`	let/var	`i.valid`	✗
`e`	`any[]`	let/var	`[]`	✗
`a`	`any`	let/var	`i[Ae]`	✗
`eo`	`RegExp`	let/var	`/[^\\][\$]/`	✗
`o`	`any`	let/var	`i!==null&&i.apply(this,arguments)\\|\\|this`	✗
`a`	`any`	let/var	`i[Ae]`	✗
`s`	`a`	let/var	`new e`	✗
`i`	`any`	let/var	`n[Ae]`	✗
`to`	`RegExp`	let/var	`/[^\\[][\^]\\|^\^/`	✗
`o`	`any`	let/var	`i!==null&&i.apply(this,arguments)\\|\\|this`	✗
`a`	`any`	let/var	`i[Ae]`	✗
`s`	`a`	let/var	`new e`	✗
`i`	`any`	let/var	`n[Ae]`	✗
`e`	`any[]`	let/var	`[]`	✗
`s`	`any`	let/var	`h.first(a).PATTERN`	✗
`i`	`any`	let/var	`n.GROUP`	✗
`a`	`string`	let/var	`"Token Type: ->"+i.name+"<- static 'PUSH_MODE' value cannot refer to a Lexer ...`	✗
`e`	`any[]`	let/var	`[]`	✗
`o`	`any`	let/var	`i.PATTERN`	✗
`o`	`any`	let/var	`a.str`	✗
`s`	`any`	let/var	`a.idx`	✗
`c`	`any`	let/var	`a.tokenType`	✗
`f`	`string`	let/var	`"Token: ->"+c.name+`<- can never be matched. `+("Because it appears AFTER the...`	✗
`e`	`string[]`	let/var	`[".","\\","[","]","\\|","^","$","(",")","?","*","+","{"]`	✗
`e`	`string`	let/var	`t.ignoreCase?"i":""`	✗
`e`	`string`	let/var	`t.ignoreCase?"iy":"y"`	✗
`n`	`any[]`	let/var	`[]`	✗
`n`	`any[]`	let/var	`[]`	✗
`i`	`boolean`	let/var	`!1`	✗
`l`	`{ message: string; type: any; tokenTy...`	let/var	`{message:p,type:f.issue,tokenType:c}`	✗
`e`	`{}`	let/var	`{}`	✗
`i`	`any`	let/var	`t[n]`	✗
`e`	`any`	let/var	`t.PATTERN`	✗
`Ft`	`any[]`	let/var	`[]`	✗
`r`	`any`	let/var	`t.tokenTypeIdx`	✗
`vo`	`any`	let/var	`not shown`	✗
`pt`	`{ deferDefinitionErrorsHandling: bool...`	let/var	`{deferDefinitionErrorsHandling:!1,positionTracking:"full",lineTerminatorsPatt...`	✗
`n`	`this`	let/var	`this`	✗
`i`	`any`	let/var	`this.config.traceInitPerf`	✗
`a`	`any`	let/var	`not shown`	✗
`o`	`boolean`	let/var	`!0`	✗
`m`	`any`	let/var	`not shown`	✗
`n`	`this`	let/var	`this`	✗
`i`	`any`	let/var	`not shown`	✗
`a`	`any`	let/var	`not shown`	✗
`o`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`not shown`	✗
`c`	`any`	let/var	`not shown`	✗
`f`	`any`	let/var	`not shown`	✗
`p`	`any`	let/var	`not shown`	✗
`l`	`any`	let/var	`not shown`	✗
`m`	`any`	let/var	`not shown`	✗
`v`	`any`	let/var	`not shown`	✗
`u`	`any`	let/var	`not shown`	✗
`d`	`any`	let/var	`not shown`	✗
`A`	`any`	let/var	`not shown`	✗
`_`	`any`	let/var	`not shown`	✗
`g`	`any`	let/var	`not shown`	✗
`y`	`any`	let/var	`e`	✗
`b`	`any`	let/var	`y.length`	✗
`L`	`number`	let/var	`0`	✗
`se`	`number`	let/var	`0`	✗
`fe`	`number`	let/var	`this.hasCustom?0:Math.floor(e.length/10)`	✗
`Z`	`any[]`	let/var	`new Array(fe)`	✗
`ue`	`any[]`	let/var	`[]`	✗
`Q`	`number`	let/var	`this.trackStartLines?1:void 0`	✗
`te`	`number`	let/var	`this.trackStartLines?1:void 0`	✗
`it`	`boolean`	let/var	`this.trackStartLines`	✗
`at`	`any`	let/var	`this.config.lineTerminatorsPattern`	✗
`Ke`	`number`	let/var	`0`	✗
`we`	`any[]`	let/var	`[]`	✗
`ot`	`any[]`	let/var	`[]`	✗
`It`	`any[]`	let/var	`[]`	✗
`Qr`	`any[]`	let/var	`[]`	✗
`st`	`any`	let/var	`void 0`	✗
`ze`	`any`	let/var	`ot[lt]`	✗
`Ua`	`boolean`	let/var	`n.canModeBeOptimized[ze]&&n.config.safeMode===!1`	✗
`lt`	`boolean`	let/var	`this.canModeBeOptimized[J]&&this.config.safeMode===!1`	✗
`Da`	`any`	let/var	`nn.length`	✗
`De`	`any`	let/var	`me.pattern`	✗
`ut`	`any`	let/var	`me.short`	✗
`fr`	`any`	let/var	`we[s]`	✗
`pr`	`any`	let/var	`fr.pattern`	✗
`kt`	`number`	let/var	`0`	✗
`hr`	`any`	let/var	`void 0`	✗
`dr`	`any`	let/var	`void 0`	✗
`mr`	`any`	let/var	`we[a]`	✗
`a`	`any`	let/var	`e.push`	✗
`c`	`any`	let/var	`not shown`	✗
`f`	`any`	let/var	`not shown`	✗
`a`	`any`	let/var	`i.time`	✗
`o`	`any`	let/var	`i.value`	✗
`s`	`{ (...data: any[]): void; (message?: ...`	let/var	`a>10?console.warn:console.log`	✗
`_o`	`string`	let/var	`"parent"`	✗
`Un`	`string`	let/var	`"categories"`	✗
`Gn`	`string`	let/var	`"label"`	✗
`Wn`	`string`	let/var	`"group"`	✗
`Bn`	`string`	let/var	`"push_mode"`	✗
`qn`	`string`	let/var	`"pop_mode"`	✗
`jn`	`string`	let/var	`"longer_alt"`	✗
`Vn`	`string`	let/var	`"line_breaks"`	✗
`Kn`	`string`	let/var	`"start_chars_hint"`	✗
`e`	`any`	let/var	`t.pattern`	✗
`r`	`{ name: any; PATTERN: any; CATEGORIES...`	let/var	`{}`	✗
`Le`	`any`	let/var	`S&&S.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`n`	`any`	let/var	`t.call(this,[])\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`n`	`any`	let/var	`t.call(this,r.definition)\\|\\|this`	✗
`r`	`{ type: string; name: any; label: any...`	let/var	`{type:"Terminal",name:t.terminalType.name,label:Oo.tokenLabel(t.terminalType)...`	✗
`n`	`any`	let/var	`t.terminalType.PATTERN`	✗
`n`	`this`	let/var	`this`	✗
`i`	`this`	let/var	`this`	✗
`s`	`any`	let/var	`new ie.Alternative({definition:[o]})`	✗
`n`	`any[]`	let/var	`[new ie.Option({definition:[new ie.Terminal({terminalType:t.separator})].conc...`	✗
`r`	`any`	let/var	`e`	✗
`Po`	`any`	let/var	`X&&X.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`r`	`boolean`	let/var	`t instanceof W.Option\\|\\|t instanceof W.Repetition\\|\\|t instanceof W.Repetiti...`	✗
`r`	`any`	let/var	`t!==null&&t.apply(this,arguments)\\|\\|this`	✗
`n`	`string`	let/var	`r.terminalType.name+this.separator+"Terminal"`	✗
`n`	`string`	let/var	`r.nonTerminalName+this.separator+"Terminal"`	✗
`Bt`	`e`	let/var	`new ni`	✗
`e`	`{ option: any[]; alternation: any[]; ...`	let/var	`Bt.dslMethods`	✗
`bo`	`any`	let/var	`he&&he.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototy...`	✗
`n`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`a`	`any`	let/var	`li(r.referencedRule,r.idx)+this.topProd.name`	✗
`s`	`any`	let/var	`new Do.Alternative({definition:o})`	✗
`e`	`{}`	let/var	`{}`	✗
`e`	`any`	let/var	`t.terminalType.name`	✗
`e`	`any`	let/var	`t.expected`	✗
`r`	`any`	let/var	`t.actual`	✗
`n`	`any`	let/var	`t.previous`	✗
`i`	`any`	let/var	`t.ruleName`	✗
`o`	`string`	let/var	`a?"--> "+Ze.tokenLabel(e)+" <--":"token of type --> "+e.name+" <--"`	✗
`s`	`string`	let/var	`"Expecting "+o+" but found --> '"+r.image+"' <--"`	✗
`e`	`any`	let/var	`t.firstRedundant`	✗
`r`	`any`	let/var	`t.ruleName`	✗
`e`	`any`	let/var	`t.expectedPathsPerAlt`	✗
`r`	`any`	let/var	`t.actual`	✗
`n`	`any`	let/var	`t.previous`	✗
`i`	`any`	let/var	`t.customUserDescription`	✗
`a`	`any`	let/var	`t.ruleName`	✗
`o`	`string`	let/var	`"Expecting: "`	✗
`s`	`any`	let/var	`ye.first(r).image`	✗
`c`	`string`	let/var	` but found: '+s+"'"`	✗
`m`	`string`	let/var	`one of these possible Token sequences:+l.join()`	✗
`e`	`any`	let/var	`t.expectedIterationPaths`	✗
`r`	`any`	let/var	`t.actual`	✗
`n`	`any`	let/var	`t.customUserDescription`	✗
`i`	`any`	let/var	`t.ruleName`	✗
`a`	`string`	let/var	`"Expecting: "`	✗
`o`	`any`	let/var	`ye.first(r).image`	✗
`s`	`string`	let/var	` but found: '+o+"'"`	✗
`f`	`string`	let/var	`expecting at least one iteration which starts with one of these possible Tok...	✗
`r`	`string`	let/var	`"Invalid grammar, reference to a rule which is not defined: ->"+e.nonTerminal...`	✗
`n`	`any`	let/var	`t.name`	✗
`a`	`any`	let/var	`i.idx`	✗
`c`	`boolean`	let/var	`a>0`	✗
`f`	`string`	let/var	`"->"+o+(c?a:"")+"<- "+(s?"with argument: ->"+s+"<-":"")+` appears more than o...`	✗
`e`	`string`	let/var	`Namespace conflict found in grammar.+("The grammar has both a Terminal(Tok...`	✗
`r`	`any`	let/var	`t.alternation.idx===0?"":t.alternation.idx`	✗
`n`	`string`	let/var	`"Ambiguous alternatives: <"+t.ambiguityIndices.join(" ,")+`> due to common lo...`	✗
`r`	`any`	let/var	`t.alternation.idx===0?"":t.alternation.idx`	✗
`n`	`string`	let/var	`"Ambiguous Alternatives Detected: <"+t.ambiguityIndices.join(" ,")+"> in <OR"...`	✗
`r`	`string`	let/var	`"The repetition <"+e+"> within Rule <"+t.topLevelRule.name+`> can never consu...`	✗
`e`	`string`	let/var	`"Ambiguous empty alternative: <"+(t.emptyChoiceIdx+1)+">"+(" in <OR"+t.altern...`	✗
`e`	`string`	let/var	`An Alternation cannot have more than 256 alternatives:+("<OR"+t.alternatio...`	✗
`e`	`any`	let/var	`t.topLevelRule.name`	✗
`n`	`string`	let/var	`e+" --> "+r.concat([e]).join(" --> ")`	✗
`i`	`string`	let/var	`Left Recursion found in grammar.+("rule: <"+e+`> can be invoked from itsel...`	✗
`e`	`any`	let/var	`not shown`	✗
`r`	`string`	let/var	`"Duplicate definition, rule: ->"+e+"<- is already defined in the grammar: ->"...`	✗
`Bo`	`any`	let/var	`Ge&&Ge.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototy...`	✗
`r`	`e`	let/var	`new vi(t,e)`	✗
`i`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`r`	`this`	let/var	`this`	✗
`n`	`any`	let/var	`this.nameToTopRule[r.nonTerminalName]`	✗
`je`	`any`	let/var	`j&&j.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`i`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`i`	`any`	let/var	`t.call(this,r,n)\\|\\|this`	✗
`o`	`any`	let/var	`new O.Alternative({definition:a})`	✗
`i`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`n`	`any[]`	let/var	`[]`	✗
`i`	`number`	let/var	`0`	✗
`s`	`any`	let/var	`t[i]`	✗
`i`	`string`	let/var	`"EXIT_NONE_TERMINAL"`	✗
`a`	`string[]`	let/var	`[i]`	✗
`o`	`string`	let/var	`"EXIT_ALTERNATIVE"`	✗
`s`	`boolean`	let/var	`!1`	✗
`c`	`any`	let/var	`e.length`	✗
`f`	`number`	let/var	`c-n-1`	✗
`p`	`any[]`	let/var	`[]`	✗
`l`	`any[]`	let/var	`[]`	✗
`v`	`any`	let/var	`m.def`	✗
`u`	`any`	let/var	`m.idx`	✗
`d`	`any`	let/var	`m.ruleStack`	✗
`A`	`any`	let/var	`m.occurrenceStack`	✗
`_`	`any`	let/var	`v[0]`	✗
`g`	`any`	let/var	`{idx:u,def:I.drop(v),ruleStack:I.dropRight(d),occurrenceStack:I.dropRight(A)}`	✗
`y`	`any`	let/var	`u+1`	✗
`b`	`any`	let/var	`e[y]`	✗
`fe`	`{ idx: any; def: any; ruleStack: any;...`	let/var	`{idx:u,def:I.drop(v),ruleStack:d,occurrenceStack:A}`	✗
`Z`	`{ idx: any; def: any; ruleStack: any;...`	let/var	`{idx:u,def:_.definition.concat(I.drop(v)),ruleStack:d,occurrenceStack:A}`	✗
`ue`	`any`	let/var	`new O.Repetition({definition:_.definition,idx:_.idx})`	✗
`te`	`any`	let/var	`new O.Terminal({terminalType:_.separator})`	✗
`xe`	`any`	let/var	`new O.Repetition({definition:[te].concat(_.definition),idx:_.idx})`	✗
`at`	`any`	let/var	`_.definition[it]`	✗
`Ke`	`{ idx: any; def: any; ruleStack: any;...`	let/var	`{idx:u,def:at.definition.concat(I.drop(v)),ruleStack:d,occurrenceStack:A}`	✗
`_i`	`any`	let/var	`C&&C.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`z`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`Fr(o)?Kt.tokenStructuredMatcherNoCategories:Kt.tokenStructuredMatcher`	✗
`s`	`any`	let/var	`Fr(o)?Kt.tokenStructuredMatcherNoCategories:Kt.tokenStructuredMatcher`	✗
`i`	`any`	let/var	`t.length`	✗
`l`	`any`	let/var	`t[p]`	✗
`m`	`any`	let/var	`l.length`	✗
`v`	`any`	let/var	`f[p]`	✗
`f`	`any`	let/var	`t[c]`	✗
`p`	`any`	let/var	`f.length`	✗
`i`	`any`	let/var	`t.length`	✗
`o`	`any`	let/var	`a[0]`	✗
`s`	`any`	let/var	`o.tokenTypeIdx`	✗
`a`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`a`	`any`	let/var	`t.call(this)\\|\\|this`	✗
`o`	`string`	let/var	`e[a]`	✗
`c`	`string`	let/var	`"_"+n.categoryMatches[s]`	✗
`o`	`any`	let/var	`e[a]`	✗
`l`	`{}`	let/var	`{}`	✗
`s`	`any`	let/var	`a`	✗
`v`	`any`	let/var	`l[m].partialPath`	✗
`u`	`any`	let/var	`l[m].suffixDef`	✗
`_`	`any`	let/var	`n[p]`	✗
`y`	`string`	let/var	`d[g]`	✗
`i`	`e`	let/var	`new Oi(t,z.ALTERNATION,n)`	✗
`i`	`e`	let/var	`new Oi(t,r)`	✗
`a`	`any`	let/var	`i.result`	✗
`o`	`e`	let/var	`new os(e,t,r)`	✗
`c`	`any`	let/var	`new We.Alternative({definition:a})`	✗
`f`	`any`	let/var	`new We.Alternative({definition:s})`	✗
`n`	`any`	let/var	`t[r]`	✗
`a`	`any`	let/var	`e[i]`	✗
`o`	`any`	let/var	`n[i]`	✗
`s`	`boolean`	let/var	`a===o\\|\\|o.categoryMatchesMap[a.tokenTypeIdx]!==void 0`	✗
`i`	`any`	let/var	`e[n]`	✗
`Ur`	`any`	let/var	`x&&x.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`s`	`any[]`	let/var	`[]`	✗
`c`	`any[]`	let/var	`[]`	✗
`f`	`any[]`	let/var	`[]`	✗
`r`	`e`	let/var	`new bi`	✗
`n`	`any`	let/var	`r.allProductions`	✗
`l`	`{ message: any; type: any; ruleName: ...`	let/var	`{message:f,type:Ie.ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,ruleName:t...`	✗
`r`	`any`	let/var	`t!==null&&t.apply(this,arguments)\\|\\|this`	✗
`i`	`any[]`	let/var	`[]`	✗
`n`	`any[]`	let/var	`[]`	✗
`i`	`any`	let/var	`not shown`	✗
`i`	`any[]`	let/var	`[]`	✗
`o`	`any`	let/var	`t.name`	✗
`e`	`any[]`	let/var	`[]`	✗
`i`	`boolean`	let/var	`t.length>1`	✗
`r`	`any`	let/var	`t!==null&&t.apply(this,arguments)\\|\\|this`	✗
`r`	`e`	let/var	`new qr`	✗
`n`	`any`	let/var	`r.alternations`	✗
`n`	`e`	let/var	`new qr`	✗
`i`	`any`	let/var	`n.alternations`	✗
`c`	`any`	let/var	`s.idx`	✗
`f`	`any`	let/var	`s.maxLookahead\\|\\|e`	✗
`r`	`any`	let/var	`t!==null&&t.apply(this,arguments)\\|\\|this`	✗
`r`	`e`	let/var	`new qr`	✗
`n`	`any`	let/var	`r.alternations`	✗
`n`	`any[]`	let/var	`[]`	✗
`a`	`e`	let/var	`new wi`	✗
`o`	`any`	let/var	`a.allProductions`	✗
`f`	`any`	let/var	`s.maxLookahead\\|\\|e`	✗
`p`	`any`	let/var	`s.idx`	✗
`m`	`any`	let/var	`l[0]`	✗
`i`	`any[]`	let/var	`[]`	✗
`l`	`any[]`	let/var	`[f]`	✗
`i`	`any[]`	let/var	`[]`	✗
`s`	`any`	let/var	`e.definition[o.idx]`	✗
`c`	`any`	let/var	`o.idx`	✗
`f`	`any`	let/var	`o.path`	✗
`v`	`any[]`	let/var	`[m.idx+1,c+1]`	✗
`u`	`any`	let/var	`e.idx===0?"":e.idx`	✗
`n`	`any[]`	let/var	`[]`	✗
`o`	`any`	let/var	`a.name`	✗
`e`	`{}`	let/var	`{}`	✗
`gt`	`any`	let/var	`ae&&ae.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototy...`	✗
`Gi`	`string`	let/var	`"MismatchedTokenException"`	✗
`Wi`	`string`	let/var	`"NoViableAltException"`	✗
`Bi`	`string`	let/var	`"EarlyExitException"`	✗
`qi`	`string`	let/var	`"NotAllInputParsedException"`	✗
`ji`	`string[]`	let/var	`[Gi,Wi,Bi,qi]`	✗
`i`	`any`	let/var	`this.constructor`	✗
`a`	`any`	let/var	`t.call(this,r)\\|\\|this`	✗
`a`	`any`	let/var	`t.call(this,r,n)\\|\\|this`	✗
`a`	`any`	let/var	`t.call(this,r,n)\\|\\|this`	✗
`i`	`any`	let/var	`t.call(this,r,n)\\|\\|this`	✗
`a`	`any`	let/var	`t.call(this,r,n)\\|\\|this`	✗
`d`	`any`	let/var	`new Ns.MismatchedTokenException(u,p,a.LA(0))`	✗
`n`	`this`	let/var	`this`	✗
`a`	`boolean`	let/var	`de.find(r,function(o){return n.tokenMatcher(i,o)})!==void 0`	✗
`i`	`any`	let/var	`r.tokenType`	✗
`e`	`this`	let/var	`this`	✗
`r`	`any`	let/var	`this.RULE_STACK`	✗
`n`	`any`	let/var	`this.RULE_OCCURRENCE_STACK`	✗
`e`	`this`	let/var	`this`	✗
`r`	`any`	let/var	`e.ruleName+e.idxInCallingRule+Is.IN+e.inRule`	✗
`a`	`{ ruleStack: any; occurrenceStack: an...`	let/var	`{ruleStack:n,occurrenceStack:i,lastTok:e,lastTokOccurrence:r}`	✗
`e`	`this`	let/var	`this`	✗
`c`	`any`	let/var	`this.firstAfterRepMap[s]`	✗
`p`	`any`	let/var	`this.getGAstProductions()[f]`	✗
`l`	`any`	let/var	`new a(p,i)`	✗
`m`	`any`	let/var	`c.token`	✗
`v`	`any`	let/var	`c.occurrence`	✗
`u`	`any`	let/var	`c.isEndOfRule`	✗
`ic`	`number`	let/var	`32-P.BITS_FOR_ALT_IDX`	✗
`r`	`this`	let/var	`this`	✗
`a`	`any`	let/var	`i.alternation`	✗
`o`	`any`	let/var	`i.repetition`	✗
`s`	`any`	let/var	`i.option`	✗
`c`	`any`	let/var	`i.repetitionMandatory`	✗
`f`	`any`	let/var	`i.repetitionMandatoryWithSeparator`	✗
`p`	`any`	let/var	`i.repetitionWithSeparator`	✗
`m`	`any`	let/var	`l.idx===0?"":l.idx`	✗
`s`	`this`	let/var	`this`	✗
`Xi`	`string`	let/var	`"name"`	✗
`e`	`any`	let/var	`t.name`	✗
`f`	`any`	let/var	`o[c]`	✗
`n`	`{ visit: (i: any, a: any) => any; val...`	let/var	`{visit:function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return thi...`	✗
`Yr`	`any`	let/var	`not shown`	✗
`Ws`	`string[]`	let/var	`["constructor","visit","validateVisitor"]`	✗
`r`	`any[]`	let/var	`[]`	✗
`n`	`{ name: any; children: {}; }`	let/var	`{name:e,children:{}}`	✗
`n`	`any`	let/var	`e.location`	✗
`n`	`any`	let/var	`e.location`	✗
`n`	`any`	let/var	`this.CST_STACK[this.CST_STACK.length-1]`	✗
`n`	`any`	let/var	`this.CST_STACK[this.CST_STACK.length-1]`	✗
`e`	`any`	let/var	`this.RULE_STACK`	✗
`e`	`any`	let/var	`this.RULE_STACK`	✗
`e`	`any`	let/var	`this.RULE_OCCURRENCE_STACK`	✗
`r`	`any`	let/var	`this.currIdx+e`	✗
`a`	`{ message: any; type: any; ruleName: ...`	let/var	`{message:i,type:Xr.ParserDefinitionErrorType.DUPLICATE_RULE_NAME,ruleName:e}`	✗
`i`	`any[]`	let/var	`[]`	✗
`i`	`any`	let/var	`q.has(n,"resyncEnabled")?n.resyncEnabled:ua.DEFAULT_RULE_CONFIG.resyncEnabled`	✗
`a`	`any`	let/var	`q.has(n,"recoveryValueFunc")?n.recoveryValueFunc:ua.DEFAULT_RULE_CONFIG.recov...`	✗
`o`	`number`	let/var	`this.ruleShortNameIdx<<le.BITS_FOR_METHOD_TYPE+le.BITS_FOR_OCCURRENCE_IDX`	✗
`l`	`any`	let/var	`this.CST_STACK[this.CST_STACK.length-1]`	✗
`f`	`string`	let/var	`"ruleName"`	✗
`i`	`boolean`	let/var	`this.RULE_STACK.length===1`	✗
`a`	`any`	let/var	`r&&!this.isBackTracking()&&this.recoveryEnabled`	✗
`o`	`any`	let/var	`e`	✗
`c`	`any`	let/var	`this.CST_STACK[this.CST_STACK.length-1]`	✗
`i`	`this`	let/var	`this`	✗
`o`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`not shown`	✗
`c`	`any`	let/var	`a`	✗
`i`	`this`	let/var	`this`	✗
`o`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`not shown`	✗
`c`	`any`	let/var	`a`	✗
`i`	`this`	let/var	`this`	✗
`a`	`any`	let/var	`r.DEF`	✗
`o`	`any`	let/var	`r.SEP`	✗
`i`	`this`	let/var	`this`	✗
`o`	`any`	let/var	`not shown`	✗
`s`	`any`	let/var	`not shown`	✗
`c`	`any`	let/var	`a`	✗
`i`	`this`	let/var	`this`	✗
`a`	`any`	let/var	`r.DEF`	✗
`o`	`any`	let/var	`r.SEP`	✗
`i`	`any`	let/var	`q.isArray(e)?e:e.DEF`	✗
`s`	`any`	let/var	`i[o]`	✗
`i`	`any`	let/var	`not shown`	✗
`a`	`any`	let/var	`n!==void 0?n.ARGS:void 0`	✗
`i`	`any`	let/var	`not shown`	✗
`i`	`any`	let/var	`not shown`	✗
`e`	`any`	let/var	`this.errors`	✗
`n`	`any`	let/var	`this.gastProductionsCache[e]`	✗
`i`	`any`	let/var	`n[r]`	✗
`ir`	`{ description: string; }`	let/var	`{description:"This Object indicates the Parser is during Recording Phase"}`	✗
`Ta`	`boolean`	let/var	`!0`	✗
`ya`	`number`	let/var	`Math.pow(2,nu.BITS_FOR_OCCURRENCE_IDX)-1`	✗
`iu`	`{ name: string; children: {}; }`	let/var	`{name:`This CSTNode indicates the Parser is in Recording Phase See: https://c...`	✗
`e`	`this`	let/var	`this`	✗
`a`	`any`	let/var	`i>0?i:""`	✗
`e`	`this`	let/var	`this`	✗
`n`	`string \\| number`	let/var	`r>0?r:""`	✗
`n`	`any`	let/var	`new Pe.Rule({definition:[],name:e})`	✗
`i`	`Error`	let/var	`new Error("<SUBRULE"+Aa(r)+"> argument is invalid"+(" expecting a Parser meth...`	✗
`o`	`any`	let/var	`e.ruleName`	✗
`s`	`any`	let/var	`new Pe.NonTerminal({idx:r,nonTerminalName:o,referencedRule:void 0})`	✗
`i`	`Error`	let/var	`new Error("<CONSUME"+Aa(r)+"> argument is invalid"+(" expecting a TokenType r...`	✗
`o`	`any`	let/var	`new Pe.Terminal({idx:r,terminalType:e})`	✗
`a`	`any`	let/var	`oe.isFunction(e)?e:e.DEF`	✗
`o`	`any`	let/var	`new t({definition:[],idx:r})`	✗
`r`	`any`	let/var	`this`	✗
`i`	`boolean`	let/var	`oe.isArray(t)===!1`	✗
`a`	`any`	let/var	`i===!1?t:t.DEF`	✗
`o`	`any`	let/var	`new Pe.Alternation({definition:[],idx:e,ignoreAmbiguities:i&&t.IGNORE_AMBIGUI...`	✗
`f`	`any`	let/var	`new Pe.Alternative({definition:[]})`	✗
`e`	`Error`	let/var	`new Error("Invalid DSL Method idx value: <"+t+`> `+("Idx value must be a none...`	✗
`r`	`any`	let/var	`e.traceInitPerf`	✗
`n`	`boolean`	let/var	`typeof r=="number"`	✗
`a`	`any`	let/var	`i.time`	✗
`o`	`any`	let/var	`i.value`	✗
`s`	`{ (...data: any[]): void; (message?: ...`	let/var	`a>10?console.warn:console.log`	✗
`n`	`any`	let/var	`r.prototype`	✗
`ka`	`any`	let/var	`U&&U.__extends\\|\\|function(){var t=function(e,r){return t=Object.setPrototype...`	✗
`Au`	`any`	let/var	`not shown`	✗
`n`	`this`	let/var	`this`	✗
`e`	`this`	let/var	`this`	✗
`r`	`any`	let/var	`not shown`	✗
`n`	`any`	let/var	`e.className`	✗
`o`	`any`	let/var	`e[a]`	✗
`s`	`any`	let/var	`o.originalGrammarAction`	✗
`c`	`any`	let/var	`void 0`	✗
`i`	`any[]`	let/var	`[]`	✗
`i`	`any`	let/var	`this`	✗
`i`	`any`	let/var	`this`	✗
`r`	`any`	let/var	`e===void 0?{}:e`	✗
`n`	`any`	let/var	`r.resourceBase`	✗
`i`	`any`	let/var	`n===void 0?"https://unpkg.com/chevrotain@"+Ca.VERSION+"/diagrams/":n`	✗
`a`	`any`	let/var	`r.css`	✗
`o`	`any`	let/var	`a===void 0?"https://unpkg.com/chevrotain@"+Ca.VERSION+"/diagrams/diagrams.css":a`	✗
`s`	`string`	let/var	` <!-- This is a generated file --> <!DOCTYPE html> <meta charset="utf-8"> <s...	✗
`c`	`string`	let/var	<link rel='stylesheet' href='`+o+`'>	✗
`f`	`string`	let/var	` <script src='+i+`vendor/railroad-diagrams.js'></script> <script src='`+i+`...`	✗
`p`	`string`	let/var	`<div id="diagrams" align="center"></div>`	✗
`l`	`string`	let/var	` <script> window.serializedGrammar =+JSON.stringify(t,null," ")+`; </scrip...`	✗
`m`	`string`	let/var	` <script> var diagramsDiv = document.getElementById("diagrams"); main.drawDi...	✗

Functions¶

`R(t: any, e: any): () => any`¶

Parameters:

t any
e any

Returns: () => any

Code

(t,e)=>()=>(e||(e={exports:{}},t(e.exports,e)),e.exports)

`isEmpty(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isEmpty(t){return t&&t.length===0}

`keys(t: any): string[]`¶

Parameters:

t any

Returns: string[]

Calls:

Object.keys

Code

function keys(t){return t==null?[]:Object.keys(t)}

`values(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

Object.keys
e.push

Code

function values(t){for(var e=[],r=Object.keys(t),n=0;n<r.length;n++)e.push(t[r[n]]);return e}

`mapValues(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

keys
r.push
e.call

Code

function mapValues(t,e){for(var r=[],n=keys(t),i=0;i<n.length;i++){var a=n[i];r.push(e.call(null,t[a],a))}return r}

`map(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

r.push
e.call

Code

function map(t,e){for(var r=[],n=0;n<t.length;n++)r.push(e.call(null,t[n],n));return r}

`flatten(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Array.isArray
e.concat
flatten
e.push

Code

function flatten(t){for(var e=[],r=0;r<t.length;r++){var n=t[r];Array.isArray(n)?e=e.concat(flatten(n)):e.push(n)}return e}

`first(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

isEmpty

Code

function first(t){return isEmpty(t)?void 0:t[0]}

`last(t: any): any`¶

Parameters:

t any

Returns: any

Code

function last(t){var e=t&&t.length;return e?t[e-1]:void 0}

`forEach(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

Array.isArray
e.call
isObject
keys
Error

Code

function forEach(t,e){if(Array.isArray(t))for(var r=0;r<t.length;r++)e.call(null,t[r],r);else if(isObject(t))for(var n=keys(t),r=0;r<n.length;r++){var i=n[r],a=t[i];e.call(null,a,i)}else throw Error("non exhaustive match")}

`isString(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isString(t){return typeof t=="string"}

`isUndefined(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isUndefined(t){return t===void 0}

`isFunction(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isFunction(t){return t instanceof Function}

`drop(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

t.slice

Code

function drop(t,e){return e===void 0&&(e=1),t.slice(e,t.length)}

`dropRight(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

t.slice

Code

function dropRight(t,e){return e===void 0&&(e=1),t.slice(0,t.length-e)}

`filter(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

Array.isArray
e.call
r.push

Code

function filter(t,e){var r=[];if(Array.isArray(t))for(var n=0;n<t.length;n++){var i=t[n];e.call(null,i)&&r.push(i)}return r}

`reject(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

filter
e

Code

function reject(t,e){return filter(t,function(r){return!e(r)})}

`pick(t: any, e: any): {}`¶

Parameters:

t any
e any

Returns: {}

Calls:

Object.keys
e

Code

function pick(t,e){for(var r=Object.keys(t),n={},i=0;i<r.length;i++){var a=r[i],o=t[a];e(o)&&(n[a]=o)}return n}

`has(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

isObject
t.hasOwnProperty

Code

function has(t,e){return isObject(t)?t.hasOwnProperty(e):!1}

`contains(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Calls:

find

Code

function contains(t,e){return find(t,function(r){return r===e})!==void 0}

`cloneArr(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

e.push

Code

function cloneArr(t){for(var e=[],r=0;r<t.length;r++)e.push(t[r]);return e}

`cloneObj(t: any): {}`¶

Parameters:

t any

Returns: {}

Calls:

Object.prototype.hasOwnProperty.call

Code

function cloneObj(t){var e={};for(var r in t)Object.prototype.hasOwnProperty.call(t,r)&&(e[r]=t[r]);return e}

`find(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

e.call

Code

function find(t,e){for(var r=0;r<t.length;r++){var n=t[r];if(e.call(null,n))return n}}

`findAll(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

e.call
r.push

Code

function findAll(t,e){for(var r=[],n=0;n<t.length;n++){var i=t[n];e.call(null,i)&&r.push(i)}return r}

`reduce(t: any, e: any, r: any): any`¶

Parameters:

t any
e any
r any

Returns: any

Calls:

Array.isArray
values
keys
e.call

Code

function reduce(t,e,r){for(var n=Array.isArray(t),i=n?t:values(t),a=n?[]:keys(t),o=r,s=0;s<i.length;s++)o=e.call(null,o,i[s],n?s:a[s]);return o}

`compact(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

reject

Code

function compact(t){return reject(t,function(e){return e==null})}

`uniq(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

reduce
e
contains
r.push
n.concat

Code

function uniq(t,e){e===void 0&&(e=function(n){return n});var r=[];return reduce(t,function(n,i){var a=e(i);return contains(r,a)?n:(r.push(a),n.concat(i))},[])}

`partial(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

n.concat
Function.bind.apply

Code

function partial(t){for(var e=[],r=1;r<arguments.length;r++)e[r-1]=arguments[r];var n=[null],i=n.concat(e);return Function.bind.apply(t,i)}

`isArray(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

Array.isArray

Code

function isArray(t){return Array.isArray(t)}

`isRegExp(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isRegExp(t){return t instanceof RegExp}

`isObject(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function isObject(t){return t instanceof Object}

`every(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Calls:

e

Code

function every(t,e){for(var r=0;r<t.length;r++)if(!e(t[r],r))return!1;return!0}

`difference(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

reject
contains

Code

function difference(t,e){return reject(t,function(r){return contains(e,r)})}

`some(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Calls:

e

Code

function some(t,e){for(var r=0;r<t.length;r++)if(e(t[r]))return!0;return!1}

`indexOf(t: any, e: any): number`¶

Parameters:

t any
e any

Returns: number

Code

function indexOf(t,e){for(var r=0;r<t.length;r++)if(t[r]===e)return r;return-1}

`sortBy(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

cloneArr
r.sort
e

Code

function sortBy(t,e){var r=cloneArr(t);return r.sort(function(n,i){return e(n)-e(i)}),r}

`zipObject(t: any, e: any): {}`¶

Parameters:

t any
e any

Returns: {}

Calls:

Error

Code

function zipObject(t,e){if(t.length!==e.length)throw Error("can't zipObject with different number of keys and values!");for(var r={},n=0;n<t.length;n++)r[t[n]]=e[n];return r}

`assign(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

keys

Code

function assign(t){for(var e=[],r=1;r<arguments.length;r++)e[r-1]=arguments[r];for(var n=0;n<e.length;n++)for(var i=e[n],a=keys(i),o=0;o<a.length;o++){var s=a[o];t[s]=i[s]}return t}

`assignNoOverwrite(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

keys
has

Code

function assignNoOverwrite(t){for(var e=[],r=1;r<arguments.length;r++)e[r-1]=arguments[r];for(var n=0;n<e.length;n++)for(var i=e[n],a=keys(i),o=0;o<a.length;o++){var s=a[o];has(t,s)||(t[s]=i[s])}return t}

`defaults(): any`¶

Returns: any

Calls:

assignNoOverwrite.apply
__spreadArray

Code

function defaults(){for(var t=[],e=0;e<arguments.length;e++)t[e]=arguments[e];return assignNoOverwrite.apply(void 0,__spreadArray([{}],t))}

`groupBy(t: any, e: any): {}`¶

Parameters:

t any
e any

Returns: {}

Calls:

forEach
e
a.push

Code

function groupBy(t,e){var r={};return forEach(t,function(n){var i=e(n),a=r[i];a?a.push(n):r[i]=[n]}),r}

`merge(t: any, e: any): {}`¶

Parameters:

t any
e any

Returns: {}

Calls:

cloneObj
keys

Code

function merge(t,e){for(var r=cloneObj(t),n=keys(e),i=0;i<n.length;i++){var a=n[i],o=e[a];r[a]=o}return r}

`NOOP(): void`¶

Returns: void

Code

function NOOP(){}

`IDENTITY(t: any): any`¶

Parameters:

t any

Returns: any

Code

function IDENTITY(t){return t}

`packArray(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

e.push

Code

function packArray(t){for(var e=[],r=0;r<t.length;r++){var n=t[r];e.push(n!==void 0?n:void 0)}return e}

`PRINT_ERROR(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

console.error

Code

function PRINT_ERROR(t){console&&console.error&&console.error("Error: "+t)}

`PRINT_WARNING(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

console.warn

Code

function PRINT_WARNING(t){console&&console.warn&&console.warn("Warning: "+t)}

`isES2015MapSupported(): boolean`¶

Returns: boolean

Code

function isES2015MapSupported(){return typeof Map=="function"}

`peek(t: any): any`¶

Parameters:

t any

Returns: any

Code

function peek(t){return t[t.length-1]}

`timer(t: any): { time: number; value: any; }`¶

Parameters:

t any

Returns: { time: number; value: any; }

Calls:

new Date().getTime
t

Code

function timer(t){var e=new Date().getTime(),r=t(),n=new Date().getTime(),i=n-e;return{time:i,value:r}}

`toFastProperties(toBecomeFast: any): any`¶

Parameters:

toBecomeFast any

Returns: any

Calls:

fakeAccess
eval

Code

function toFastProperties(toBecomeFast){function FakeConstructor(){}FakeConstructor.prototype=toBecomeFast;var fakeInstance=new FakeConstructor;function fakeAccess(){return typeof fakeInstance.bar}return fakeAccess(),fakeAccess(),toBecomeFast;eval(toBecomeFast)}

`FakeConstructor(): void`¶

Returns: void

Code

function FakeConstructor(){}

`fakeAccess(): "string" | "number" | "bigint" | "boolean" | "symbol" | "undefined" | "object" | "function"`¶

Code

function fakeAccess(){return typeof fakeInstance.bar}

`t(): void`¶

Returns: void

Code

function t(){}

`i(u: any): any`¶

Parameters:

u any

Returns: any

Calls:

u.charCodeAt

Code

function i(u){return u.charCodeAt(0)}

`a(u: any, d: any): void`¶

Parameters:

u any
d any

Returns: void

Calls:

u.forEach
d.push

Code

function a(u,d){u.length!==void 0?u.forEach(function(A){d.push(A)}):d.push(u)}

`o(u: any, d: any): void`¶

Parameters:

u any
d any

Returns: void

Code

function o(u,d){if(u[d]===!0)throw"duplicate flag "+d;u[d]=!0}

`s(u: any): void`¶

Parameters:

u any

Returns: void

Calls:

Error

Code

function s(u){if(u===void 0)throw Error("Internal Error - Should never get here!")}

`c(): void`¶

Returns: void

Calls:

Error

Code

function c(){throw Error("Internal Error - Should never get here!")}

`v(): void`¶

Returns: void

Code

function v(){}

`Ba(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

t.toString
Ct.hasOwnProperty
Wa.pattern

Code

function Ba(t){var e=t.toString();if(Ct.hasOwnProperty(e))return Ct[e];var r=Wa.pattern(e);return Ct[e]=r,r}

`qa(): void`¶

Returns: void

Code

function qa(){Ct={}}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`Va(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

cn.getRegExpAst
Mt
pe.PRINT_WARNING
t.toString
pe.PRINT_ERROR

Code

function Va(t,e){e===void 0&&(e=!1);try{var r=cn.getRegExpAst(t),n=Mt(r.value,{},r.flags.ignoreCase);return n}catch(a){if(a.message===ln)e&&pe.PRINT_WARNING(""+re.failedOptimizationPrefixMsg+("   Unable to optimize: < "+t.toString()+` >
`)+`    Complement Sets cannot be automatically optimized.
    This will disable the lexer's first char optimizations.
    See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#COMPLEMENT for details.`);else{var i="";e&&(i=`
    This will disable the lexer's first char optimizations.
    See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#REGEXP_PARSING for details.`),pe.PRINT_ERROR(re.failedOptimizationPrefixMsg+`
`+("    Failed parsing: < "+t.toString()+` >
`)+("   Using the regexp-to-ast library version: "+un.VERSION+`
`)+"    Please open an issue at: https://github.com/bd82/regexp-to-ast/issues"+i)}}return[]}

`Mt(t: any, e: any, r: any): any`¶

Parameters:

t any
e any
r any

Returns: any

Calls:

Mt
bt
Error
pe.forEach
Ce.charCodeToOptimizedIndex
yr
pe.values

Code

function Mt(t,e,r){switch(t.type){case"Disjunction":for(var n=0;n<t.value.length;n++)Mt(t.value[n],e,r);break;case"Alternative":for(var i=t.value,n=0;n<i.length;n++){var a=i[n];switch(a.type){case"EndAnchor":case"GroupBackReference":case"Lookahead":case"NegativeLookahead":case"StartAnchor":case"WordBoundary":case"NonWordBoundary":continue}var o=a;switch(o.type){case"Character":bt(o.value,e,r);break;case"Set":if(o.complement===!0)throw Error(ln);pe.forEach(o.value,function(f){if(typeof f=="number")bt(f,e,r);else{var p=f;if(r===!0)for(var l=p.from;l<=p.to;l++)bt(l,e,r);else{for(var l=p.from;l<=p.to&&l<Ce.minOptimizationVal;l++)bt(l,e,r);if(p.to>=Ce.minOptimizationVal)for(var m=p.from>=Ce.minOptimizationVal?p.from:Ce.minOptimizationVal,v=p.to,u=Ce.charCodeToOptimizedIndex(m),d=Ce.charCodeToOptimizedIndex(v),A=u;A<=d;A++)e[A]=A}}});break;case"Group":Mt(o.value,e,r);break;default:throw Error("Non Exhaustive Match")}var s=o.quantifier!==void 0&&o.quantifier.atLeast===0;if(o.type==="Group"&&yr(o)===!1||o.type!=="Group"&&s===!1)break}break;default:throw Error("non exhaustive match!")}return pe.values(e)}

`bt(t: any, e: any, r: any): void`¶

Parameters:

t any
e any
r any

Returns: void

Calls:

Ce.charCodeToOptimizedIndex
Ka

Code

function bt(t,e,r){var n=Ce.charCodeToOptimizedIndex(t);e[n]=n,r===!0&&Ka(t,e)}

`Ka(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

String.fromCharCode
r.toUpperCase
Ce.charCodeToOptimizedIndex
n.charCodeAt
r.toLowerCase
a.charCodeAt

Code

function Ka(t,e){var r=String.fromCharCode(t),n=r.toUpperCase();if(n!==r){var i=Ce.charCodeToOptimizedIndex(n.charCodeAt(0));e[i]=i}else{var a=r.toLowerCase();if(a!==r){var i=Ce.charCodeToOptimizedIndex(a.charCodeAt(0));e[i]=i}}}

`fn(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

pe.find
pe.contains

Code

function fn(t,e){return pe.find(t.value,function(r){if(typeof r=="number")return pe.contains(e,r);var n=r;return pe.find(e,function(i){return n.from<=i&&i<=n.to})!==void 0})}

`yr(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

pe.isArray
pe.every
yr

Code

function yr(t){return t.quantifier&&t.quantifier.atLeast===0?!0:t.value?pe.isArray(t.value)?pe.every(t.value,yr):yr(t.value):!1}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call

Code

function e(r){var n=t.call(this)||this;return n.targetCharCodes=r,n.found=!1,n}

`Ha(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Calls:

cn.getRegExpAst
n.visit
pe.find
pe.contains
i.charCodeAt

Code

function Ha(t,e){if(e instanceof RegExp){var r=cn.getRegExpAst(e),n=new za(t);return n.visit(r),n.found}else return pe.find(e,function(i){return pe.contains(t,i.charCodeAt(0))})!==void 0}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`Ya(): void`¶

Returns: void

Code

function Ya(){T.SUPPORT_STICKY=!1}

`Xa(): void`¶

Returns: void

Code

function Xa(){T.SUPPORT_STICKY=!0}

`Za(t: any, e: any): { emptyGroups: undefined; patternIdxToConfig: undefined; charCodeToPatternIdxToConfig: any[]; hasCustom: boolean; canBeOptimized: boolean; }`¶

Parameters:

t any
e any

Returns: { emptyGroups: undefined; patternIdxToConfig: undefined; charCodeToPatternIdxToConfig: any[]; hasCustom: boolean; canBeOptimized: boolean; }

Calls:

h.defaults
y
r
$a
h.reject
h.map
h.isRegExp
h.contains
gr
_r
h.isFunction
h.has
y.replace
Error
h.isString
h.isUndefined
h.indexOf
Tn
En
Ye.canMatchCharCode
h.reduce
y.PATTERN.charCodeAt
Or
Rr
h.isArray
h.forEach
ue.charCodeAt
h.PRINT_ERROR
y.PATTERN.toString
Ye.getOptimizedStartCodesIndices
h.isEmpty
h.packArray

Code

function Za(t,e){e=h.defaults(e,{useSticky:T.SUPPORT_STICKY,debug:!1,safeMode:!1,positionTracking:"full",lineTerminatorCharacters:["\r",`
`],tracer:function(g,y){return y()}});var r=e.tracer;r("initCharCodeToOptimizedIndexMap",function(){$a()});var n;r("Reject Lexer.NA",function(){n=h.reject(t,function(g){return g[Ae]===F.Lexer.NA})});var i=!1,a;r("Transform Patterns",function(){i=!1,a=h.map(n,function(g){var y=g[Ae];if(h.isRegExp(y)){var b=y.source;return b.length===1&&b!=="^"&&b!=="$"&&b!=="."&&!y.ignoreCase?b:b.length===2&&b[0]==="\\"&&!h.contains(["d","D","s","S","t","r","n","t","0","c","b","B","f","v","w","W"],b[1])?b[1]:e.useSticky?gr(y):_r(y)}else{if(h.isFunction(y))return i=!0,{exec:y};if(h.has(y,"exec"))return i=!0,y;if(typeof y=="string"){if(y.length===1)return y;var L=y.replace(/[\\^$.*+?()[\]{}|]/g,"\\$&"),se=new RegExp(L);return e.useSticky?gr(se):_r(se)}else throw Error("non exhaustive match")}})});var o,s,c,f,p;r("misc mapping",function(){o=h.map(n,function(g){return g.tokenTypeIdx}),s=h.map(n,function(g){var y=g.GROUP;if(y!==F.Lexer.SKIPPED){if(h.isString(y))return y;if(h.isUndefined(y))return!1;throw Error("non exhaustive match")}}),c=h.map(n,function(g){var y=g.LONGER_ALT;if(y){var b=h.indexOf(n,y);return b}}),f=h.map(n,function(g){return g.PUSH_MODE}),p=h.map(n,function(g){return h.has(g,"POP_MODE")})});var l;r("Line Terminator Handling",function(){var g=Tn(e.lineTerminatorCharacters);l=h.map(n,function(y){return!1}),e.positionTracking!=="onlyOffset"&&(l=h.map(n,function(y){if(h.has(y,"LINE_BREAKS"))return y.LINE_BREAKS;if(En(y,g)===!1)return Ye.canMatchCharCode(g,y.PATTERN)}))});var m,v,u,d;r("Misc Mapping #2",function(){m=h.map(n,Ar),v=h.map(a,mn),u=h.reduce(n,function(g,y){var b=y.GROUP;return h.isString(b)&&b!==F.Lexer.SKIPPED&&(g[b]=[]),g},{}),d=h.map(a,function(g,y){return{pattern:a[y],longerAlt:c[y],canLineTerminator:l[y],isCustom:m[y],short:v[y],group:s[y],push:f[y],pop:p[y],tokenTypeIdx:o[y],tokenType:n[y]}})});var A=!0,_=[];return e.safeMode||r("First Char Optimization",function(){_=h.reduce(n,function(g,y,b){if(typeof y.PATTERN=="string"){var L=y.PATTERN.charCodeAt(0),se=Or(L);Rr(g,se,d[b])}else if(h.isArray(y.START_CHARS_HINT)){var fe;h.forEach(y.START_CHARS_HINT,function(ue){var Q=typeof ue=="string"?ue.charCodeAt(0):ue,te=Or(Q);fe!==te&&(fe=te,Rr(g,te,d[b]))})}else if(h.isRegExp(y.PATTERN))if(y.PATTERN.unicode)A=!1,e.ensureOptimizations&&h.PRINT_ERROR(""+Ye.failedOptimizationPrefixMsg+("   Unable to analyze < "+y.PATTERN.toString()+` > pattern.
`)+`    The regexp unicode flag is not currently supported by the regexp-to-ast library.
    This will disable the lexer's first char optimizations.
    For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNICODE_OPTIMIZE`);else{var Z=Ye.getOptimizedStartCodesIndices(y.PATTERN,e.ensureOptimizations);h.isEmpty(Z)&&(A=!1),h.forEach(Z,function(ue){Rr(g,ue,d[b])})}else e.ensureOptimizations&&h.PRINT_ERROR(""+Ye.failedOptimizationPrefixMsg+("  TokenType: <"+y.name+`> is using a custom token pattern without providing <start_chars_hint> parameter.
`)+`    This will disable the lexer's first char optimizations.
    For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_OPTIMIZE`),A=!1;return g},[])}),r("ArrayPacking",function(){_=h.packArray(_)}),{emptyGroups:u,patternIdxToConfig:d,charCodeToPatternIdxToConfig:_,hasCustom:i,canBeOptimized:A}}

`tracer(g: any, y: any): any`¶

Parameters:

g any
y any

Returns: any

Calls:

y

Code

function(g,y){return y()}

`tracer(g: any, y: any): any`¶

Parameters:

g any
y any

Returns: any

Calls:

y

Code

function(g,y){return y()}

`Ja(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

yn
r.concat
_n
Qa
gn
An
Rn

Code

function Ja(t,e){var r=[],n=yn(t);r=r.concat(n.errors);var i=_n(n.valid),a=i.valid;return r=r.concat(i.errors),r=r.concat(Qa(a)),r=r.concat(gn(a)),r=r.concat(An(a,e)),r=r.concat(Rn(a)),r}

`Qa(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

h.filter
h.isRegExp
e.concat
On
In
kn
Pn
Nn

Code

function Qa(t){var e=[],r=h.filter(t,function(n){return h.isRegExp(n[Ae])});return e=e.concat(On(r)),e=e.concat(In(r)),e=e.concat(kn(r)),e=e.concat(Pn(r)),e=e.concat(Nn(r)),e}

`yn(t: any): { errors: any; valid: any; }`¶

Parameters:

t any

Returns: { errors: any; valid: any; }

Calls:

h.filter
h.has
h.map
h.difference

Code

function yn(t){var e=h.filter(t,function(i){return!h.has(i,Ae)}),r=h.map(e,function(i){return{message:"Token Type: ->"+i.name+"<- missing static 'PATTERN' property",type:F.LexerDefinitionErrorType.MISSING_PATTERN,tokenTypes:[i]}}),n=h.difference(t,e);return{errors:r,valid:n}}

`_n(t: any): { errors: any; valid: any; }`¶

Parameters:

t any

Returns: { errors: any; valid: any; }

Calls:

h.filter
h.isRegExp
h.isFunction
h.has
h.isString
h.map
h.difference

Code

function _n(t){var e=h.filter(t,function(i){var a=i[Ae];return!h.isRegExp(a)&&!h.isFunction(a)&&!h.has(a,"exec")&&!h.isString(a)}),r=h.map(e,function(i){return{message:"Token Type: ->"+i.name+"<- static 'PATTERN' can only be a RegExp, a Function matching the {CustomPatternMatcherFunc} type or an Object matching the {ICustomPattern} interface.",type:F.LexerDefinitionErrorType.INVALID_PATTERN,tokenTypes:[i]}}),n=h.difference(t,e);return{errors:r,valid:n}}

`On(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

complex_call_29734
hn
i.apply
h.filter
vn.getRegExpAst
s.visit
eo.test
h.map

Code

function On(t){var e=function(i){hn(a,i);function a(){var o=i!==null&&i.apply(this,arguments)||this;return o.found=!1,o}return a.prototype.visitEndAnchor=function(o){this.found=!0},a}(dn.BaseRegExpVisitor),r=h.filter(t,function(i){var a=i[Ae];try{var o=vn.getRegExpAst(a),s=new e;return s.visit(o),s.found}catch(c){return eo.test(a.source)}}),n=h.map(r,function(i){return{message:`Unexpected RegExp Anchor Error:
    Token Type: ->`+i.name+`<- static 'PATTERN' cannot contain end of input anchor '$'
    See chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS    for details.`,type:F.LexerDefinitionErrorType.EOI_ANCHOR_FOUND,tokenTypes:[i]}});return n}

`a(): any`¶

Returns: any

Calls:

i.apply

Code

function a(){var o=i!==null&&i.apply(this,arguments)||this;return o.found=!1,o}

`Nn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.filter
i.test
h.map

Code

function Nn(t){var e=h.filter(t,function(n){var i=n[Ae];return i.test("")}),r=h.map(e,function(n){return{message:"Token Type: ->"+n.name+"<- static 'PATTERN' must not match an empty string",type:F.LexerDefinitionErrorType.EMPTY_MATCH_PATTERN,tokenTypes:[n]}});return r}

`In(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

complex_call_30733
hn
i.apply
h.filter
vn.getRegExpAst
s.visit
to.test
h.map

Code

function In(t){var e=function(i){hn(a,i);function a(){var o=i!==null&&i.apply(this,arguments)||this;return o.found=!1,o}return a.prototype.visitStartAnchor=function(o){this.found=!0},a}(dn.BaseRegExpVisitor),r=h.filter(t,function(i){var a=i[Ae];try{var o=vn.getRegExpAst(a),s=new e;return s.visit(o),s.found}catch(c){return to.test(a.source)}}),n=h.map(r,function(i){return{message:`Unexpected RegExp Anchor Error:
    Token Type: ->`+i.name+`<- static 'PATTERN' cannot contain start of input anchor '^'
    See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#ANCHORS    for details.`,type:F.LexerDefinitionErrorType.SOI_ANCHOR_FOUND,tokenTypes:[i]}});return n}

`a(): any`¶

Returns: any

Calls:

i.apply

Code

function a(){var o=i!==null&&i.apply(this,arguments)||this;return o.found=!1,o}

`kn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.filter
h.map

Code

function kn(t){var e=h.filter(t,function(n){var i=n[Ae];return i instanceof RegExp&&(i.multiline||i.global)}),r=h.map(e,function(n){return{message:"Token Type: ->"+n.name+"<- static 'PATTERN' may NOT contain global('g') or multiline('m')",type:F.LexerDefinitionErrorType.UNSUPPORTED_FLAGS_FOUND,tokenTypes:[n]}});return r}

`Pn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.map
h.reduce
h.contains
e.push
o.push
h.compact
h.filter
h.first
o.join

Code

function Pn(t){var e=[],r=h.map(t,function(a){return h.reduce(t,function(o,s){return a.PATTERN.source===s.PATTERN.source&&!h.contains(e,s)&&s.PATTERN!==F.Lexer.NA&&(e.push(s),o.push(s)),o},[])});r=h.compact(r);var n=h.filter(r,function(a){return a.length>1}),i=h.map(n,function(a){var o=h.map(a,function(c){return c.name}),s=h.first(a).PATTERN;return{message:"The same RegExp pattern ->"+s+"<-"+("has been used in all of the following Token Types: "+o.join(", ")+" <-"),type:F.LexerDefinitionErrorType.DUPLICATE_PATTERNS_FOUND,tokenTypes:a}});return i}

`gn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.filter
h.has
h.isString
h.map

Code

function gn(t){var e=h.filter(t,function(n){if(!h.has(n,"GROUP"))return!1;var i=n.GROUP;return i!==F.Lexer.SKIPPED&&i!==F.Lexer.NA&&!h.isString(i)}),r=h.map(e,function(n){return{message:"Token Type: ->"+n.name+"<- static 'GROUP' can only be Lexer.SKIPPED/Lexer.NA/A String",type:F.LexerDefinitionErrorType.INVALID_GROUP_TYPE_FOUND,tokenTypes:[n]}});return r}

`An(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

h.filter
h.contains
h.map

Code

function An(t,e){var r=h.filter(t,function(i){return i.PUSH_MODE!==void 0&&!h.contains(e,i.PUSH_MODE)}),n=h.map(r,function(i){var a="Token Type: ->"+i.name+"<- static 'PUSH_MODE' value cannot refer to a Lexer Mode ->"+i.PUSH_MODE+"<-which does not exist";return{message:a,type:F.LexerDefinitionErrorType.PUSH_MODE_DOES_NOT_EXIST,tokenTypes:[i]}});return n}

`Rn(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Calls:

h.reduce
h.isString
n.push
h.isRegExp
no
h.forEach
ro
e.push

Code

function Rn(t){var e=[],r=h.reduce(t,function(n,i,a){var o=i.PATTERN;return o===F.Lexer.NA||(h.isString(o)?n.push({str:o,idx:a,tokenType:i}):h.isRegExp(o)&&no(o)&&n.push({str:o.source,idx:a,tokenType:i})),n},[]);return h.forEach(t,function(n,i){h.forEach(r,function(a){var o=a.str,s=a.idx,c=a.tokenType;if(i<s&&ro(o,n.PATTERN)){var f="Token: ->"+c.name+`<- can never be matched.
`+("Because it appears AFTER the Token Type ->"+n.name+"<-")+`in the lexer's definition.
See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#UNREACHABLE`;e.push({message:f,type:F.LexerDefinitionErrorType.UNREACHABLE_PATTERN,tokenTypes:[n,c]})}})}),e}

`ro(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

h.isRegExp
e.exec
h.isFunction
e
h.has
Error

Code

function ro(t,e){if(h.isRegExp(e)){var r=e.exec(t);return r!==null&&r.index===0}else{if(h.isFunction(e))return e(t,0,[],{});if(h.has(e,"exec"))return e.exec(t,0,[],{});if(typeof e=="string")return e===t;throw Error("non exhaustive match")}}

`no(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

h.find
t.source.indexOf

Code

function no(t){var e=[".","\\","[","]","|","^","$","(",")","?","*","+","{"];return h.find(e,function(r){return t.source.indexOf(r)!==-1})===void 0}

`_r(t: any): RegExp`¶

Parameters:

t any

Returns: RegExp

Code

function _r(t){var e=t.ignoreCase?"i":"";return new RegExp("^(?:"+t.source+")",e)}

`gr(t: any): RegExp`¶

Parameters:

t any

Returns: RegExp

Code

function gr(t){var e=t.ignoreCase?"iy":"y";return new RegExp(""+t.source,e)}

`io(t: any, e: any, r: any): { message: string; type: any; }[]`¶

Parameters:

t any
e any
r any

Returns: { message: string; type: any; }[]

Calls:

h.has
n.push
h.forEach
h.isUndefined

Code

function io(t,e,r){var n=[];return h.has(t,T.DEFAULT_MODE)||n.push({message:"A MultiMode Lexer cannot be initialized without a <"+T.DEFAULT_MODE+`> property in its definition
`,type:F.LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_DEFAULT_MODE}),h.has(t,T.MODES)||n.push({message:"A MultiMode Lexer cannot be initialized without a <"+T.MODES+`> property in its definition
`,type:F.LexerDefinitionErrorType.MULTI_MODE_LEXER_WITHOUT_MODES_PROPERTY}),h.has(t,T.MODES)&&h.has(t,T.DEFAULT_MODE)&&!h.has(t.modes,t.defaultMode)&&n.push({message:"A MultiMode Lexer cannot be initialized with a "+T.DEFAULT_MODE+": <"+t.defaultMode+`>which does not exist
`,type:F.LexerDefinitionErrorType.MULTI_MODE_LEXER_DEFAULT_MODE_VALUE_DOES_NOT_EXIST}),h.has(t,T.MODES)&&h.forEach(t.modes,function(i,a){h.forEach(i,function(o,s){h.isUndefined(o)&&n.push({message:"A Lexer cannot be initialized using an undefined Token Type. Mode:"+("<"+a+"> at index: <"+s+`>
`),type:F.LexerDefinitionErrorType.LEXER_DEFINITION_CANNOT_CONTAIN_UNDEFINED})})}),n}

`ao(t: any, e: any, r: any): { message: string; type: any; }[]`¶

Parameters:

t any
e any
r any

Returns: { message: string; type: any; }[]

Calls:

h.compact
h.flatten
h.mapValues
h.reject
Tn
h.forEach
En
Sn
n.push
h.has
Ye.canMatchCharCode

Code

function ao(t,e,r){var n=[],i=!1,a=h.compact(h.flatten(h.mapValues(t.modes,function(c){return c}))),o=h.reject(a,function(c){return c[Ae]===F.Lexer.NA}),s=Tn(r);return e&&h.forEach(o,function(c){var f=En(c,s);if(f!==!1){var p=Sn(c,f),l={message:p,type:f.issue,tokenType:c};n.push(l)}else h.has(c,"LINE_BREAKS")?c.LINE_BREAKS===!0&&(i=!0):Ye.canMatchCharCode(s,c.PATTERN)&&(i=!0)}),e&&!i&&n.push({message:`Warning: No LINE_BREAKS Found.
    This Lexer has been defined to track line and column information,
    But none of the Token Types can be identified as matching a line terminator.
    See https://chevrotain.io/docs/guide/resolving_lexer_errors.html#LINE_BREAKS
    for details.`,type:F.LexerDefinitionErrorType.NO_LINE_BREAKS_FLAGS}),n}

`oo(t: any): {}`¶

Parameters:

t any

Returns: {}

Calls:

h.keys
h.forEach
h.isArray
Error

Code

function oo(t){var e={},r=h.keys(t);return h.forEach(r,function(n){var i=t[n];if(h.isArray(i))e[n]=[];else throw Error("non exhaustive match")}),e}

`Ar(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

h.isRegExp
h.isFunction
h.has
h.isString
Error

Code

function Ar(t){var e=t.PATTERN;if(h.isRegExp(e))return!1;if(h.isFunction(e))return!0;if(h.has(e,"exec"))return!0;if(h.isString(e))return!1;throw Error("non exhaustive match")}

`mn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.isString
t.charCodeAt

Code

function mn(t){return h.isString(t)&&t.length===1?t.charCodeAt(0):!1}

`test(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

t.charCodeAt

Code

function(t){for(var e=t.length,r=this.lastIndex;r<e;r++){var n=t.charCodeAt(r);if(n===10)return this.lastIndex=r+1,!0;if(n===13)return t.charCodeAt(r+1)===10?this.lastIndex=r+2:this.lastIndex=r+1,!0}return!1}

`test(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

t.charCodeAt

Code

function(t){for(var e=t.length,r=this.lastIndex;r<e;r++){var n=t.charCodeAt(r);if(n===10)return this.lastIndex=r+1,!0;if(n===13)return t.charCodeAt(r+1)===10?this.lastIndex=r+2:this.lastIndex=r+1,!0}return!1}

`En(t: any, e: any): boolean | { issue: any; errMsg: any; } | { issue: any; errMsg?: undefined; }`¶

Parameters:

t any
e any

Returns: boolean | { issue: any; errMsg: any; } | { issue: any; errMsg?: undefined; }

Calls:

h.has
h.isRegExp
Ye.canMatchCharCode
h.isString
Ar
Error

Code

function En(t,e){if(h.has(t,"LINE_BREAKS"))return!1;if(h.isRegExp(t.PATTERN)){try{Ye.canMatchCharCode(e,t.PATTERN)}catch(r){return{issue:F.LexerDefinitionErrorType.IDENTIFY_TERMINATOR,errMsg:r.message}}return!1}else{if(h.isString(t.PATTERN))return!1;if(Ar(t))return{issue:F.LexerDefinitionErrorType.CUSTOM_LINE_BREAK};throw Error("non exhaustive match")}}

`Sn(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

Error

Code

function Sn(t,e){if(e.issue===F.LexerDefinitionErrorType.IDENTIFY_TERMINATOR)return`Warning: unable to identify line terminator usage in pattern.
`+("    The problem is in the <"+t.name+`> Token Type
`)+("    Root cause: "+e.errMsg+`.
`)+"    For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#IDENTIFY_TERMINATOR";if(e.issue===F.LexerDefinitionErrorType.CUSTOM_LINE_BREAK)return`Warning: A Custom Token Pattern should specify the <line_breaks> option.
`+("    The problem is in the <"+t.name+`> Token Type
`)+"    For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#CUSTOM_LINE_BREAK";throw Error("non exhaustive match")}

`Tn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

h.map
h.isString
r.charCodeAt

Code

function Tn(t){var e=h.map(t,function(r){return h.isString(r)&&r.length>0?r.charCodeAt(0):r});return e}

`Rr(t: any, e: any, r: any): void`¶

Parameters:

t any
e any
r any

Returns: void

Calls:

t[e].push

Code

function Rr(t,e,r){t[e]===void 0?t[e]=[r]:t[e].push(r)}

`Or(t: any): any`¶

Parameters:

t any

Returns: any

Code

function Or(t){return t<T.minOptimizationVal?t:Ft[t]}

`$a(): void`¶

Returns: void

Calls:

h.isEmpty

Code

function $a(){if(h.isEmpty(Ft)){Ft=new Array(65536);for(var t=0;t<65536;t++)Ft[t]=t>255?255+~~(t/255):t}}

`tracer(g: any, y: any): any`¶

Parameters:

g any
y any

Returns: any

Calls:

y

Code

function(g,y){return y()}

`tracer(g: any, y: any): any`¶

Parameters:

g any
y any

Returns: any

Calls:

y

Code

function(g,y){return y()}

`test(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

t.charCodeAt

Code

function(t){for(var e=t.length,r=this.lastIndex;r<e;r++){var n=t.charCodeAt(r);if(n===10)return this.lastIndex=r+1,!0;if(n===13)return t.charCodeAt(r+1)===10?this.lastIndex=r+2:this.lastIndex=r+1,!0}return!1}

`test(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

t.charCodeAt

Code

function(t){for(var e=t.length,r=this.lastIndex;r<e;r++){var n=t.charCodeAt(r);if(n===10)return this.lastIndex=r+1,!0;if(n===13)return t.charCodeAt(r+1)===10?this.lastIndex=r+2:this.lastIndex=r+1,!0}return!1}

`so(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Code

function so(t,e){var r=t.tokenTypeIdx;return r===e.tokenTypeIdx?!0:e.isParent===!0&&e.categoryMatchesMap[r]===!0}

`uo(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Code

function uo(t,e){return t.tokenTypeIdx===e.tokenTypeIdx}

`co(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

xn
Cn
Mn
Ln
V.forEach

Code

function co(t){var e=xn(t);Cn(e),Mn(e),Ln(e),V.forEach(e,function(r){r.isParent=r.categoryMatches.length>0})}

`xn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.cloneArr
V.compact
V.flatten
V.map
V.difference
e.concat
V.isEmpty

Code

function xn(t){for(var e=V.cloneArr(t),r=t,n=!0;n;){r=V.compact(V.flatten(V.map(r,function(a){return a.CATEGORIES})));var i=V.difference(r,e);e=e.concat(i),V.isEmpty(i)?n=!1:r=i}return e}

`Cn(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

V.forEach
bn
Nr
V.isArray
Fn
wn

Code

function Cn(t){V.forEach(t,function(e){bn(e)||(N.tokenIdxToClass[N.tokenShortNameIdx]=e,e.tokenTypeIdx=N.tokenShortNameIdx++),Nr(e)&&!V.isArray(e.CATEGORIES)&&(e.CATEGORIES=[e.CATEGORIES]),Nr(e)||(e.CATEGORIES=[]),Fn(e)||(e.categoryMatches=[]),wn(e)||(e.categoryMatchesMap={})})}

`Ln(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

V.forEach
e.categoryMatches.push

Code

function Ln(t){V.forEach(t,function(e){e.categoryMatches=[],V.forEach(e.categoryMatchesMap,function(r,n){e.categoryMatches.push(N.tokenIdxToClass[n].tokenTypeIdx)})})}

`Mn(t: any): void`¶

Parameters:

t any

Returns: void

Calls:

V.forEach
Ir

Code

function Mn(t){V.forEach(t,function(e){Ir([],e)})}

`Ir(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

V.forEach
t.concat
V.contains
Ir

Code

function Ir(t,e){V.forEach(t,function(r){e.categoryMatchesMap[r.tokenTypeIdx]=!0}),V.forEach(e.CATEGORIES,function(r){var n=t.concat(e);V.contains(n,r)||Ir(n,r)})}

`bn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.has

Code

function bn(t){return V.has(t,"tokenTypeIdx")}

`Nr(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.has

Code

function Nr(t){return V.has(t,"CATEGORIES")}

`Fn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.has

Code

function Fn(t){return V.has(t,"categoryMatches")}

`wn(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.has

Code

function wn(t){return V.has(t,"categoryMatchesMap")}

`lo(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

V.has

Code

function lo(t){return V.has(t,"tokenTypeIdx")}

`buildUnableToPopLexerModeMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"Unable to pop Lexer Mode after encountering Token ->"+t.image+"<- The Mode Stack is empty"}

`buildUnexpectedCharactersMessage(t: any, e: any, r: any, n: any, i: any): string`¶

Parameters:

t any
e any
r any
n any
i any

Returns: string

Calls:

t.charAt

Code

function(t,e,r,n,i){return"unexpected character: ->"+t.charAt(e)+"<- at offset: "+e+","+(" skipped "+r+" characters.")}

`buildUnableToPopLexerModeMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"Unable to pop Lexer Mode after encountering Token ->"+t.image+"<- The Mode Stack is empty"}

`buildUnexpectedCharactersMessage(t: any, e: any, r: any, n: any, i: any): string`¶

Parameters:

t any
e any
r any
n any
i any

Returns: string

Calls:

t.charAt

Code

function(t,e,r,n,i){return"unexpected character: ->"+t.charAt(e)+"<- at offset: "+e+","+(" skipped "+r+" characters.")}

`buildUnableToPopLexerModeMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"Unable to pop Lexer Mode after encountering Token ->"+t.image+"<- The Mode Stack is empty"}

`buildUnexpectedCharactersMessage(t: any, e: any, r: any, n: any, i: any): string`¶

Parameters:

t any
e any
r any
n any
i any

Returns: string

Calls:

t.charAt

Code

function(t,e,r,n,i){return"unexpected character: ->"+t.charAt(e)+"<- at offset: "+e+","+(" skipped "+r+" characters.")}

`buildUnableToPopLexerModeMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"Unable to pop Lexer Mode after encountering Token ->"+t.image+"<- The Mode Stack is empty"}

`buildUnexpectedCharactersMessage(t: any, e: any, r: any, n: any, i: any): string`¶

Parameters:

t any
e any
r any
n any
i any

Returns: string

Calls:

t.charAt

Code

function(t,e,r,n,i){return"unexpected character: ->"+t.charAt(e)+"<- at offset: "+e+","+(" skipped "+r+" characters.")}

`t(e: any, r: any): void`¶

Parameters:

e any
r any

Returns: void

Calls:

Error
w.merge
this.TRACE_INIT
n.TRACE_INIT
/full|onlyStart/i.test
/full/i.test
w.isArray
w.cloneArr
w.cloneObj
n.lexerDefinitionErrors.concat
Ee.performRuntimeChecks
n.lexerDefinitionWarning.concat
Ee.performWarningRuntimeChecks
w.forEach
w.reject
w.isUndefined
w.keys
n.modes.push
Ee.validatePatterns
w.isEmpty
fo.augmentTokenTypes
Ee.analyzeTokenTypes
n.TRACE_INIT.bind
w.map
c.join
w.PRINT_WARNING
/onlyStart/i.test
/onlyOffset/i.test
w.reduce
l.push
p.join
ho.clearRegExpParserCache
w.toFastProperties

Code

function t(e,r){var n=this;if(r===void 0&&(r=pt),this.lexerDefinition=e,this.lexerDefinitionErrors=[],this.lexerDefinitionWarning=[],this.patternIdxToConfig={},this.charCodeToPatternIdxToConfig={},this.modes=[],this.emptyGroups={},this.config=void 0,this.trackStartLines=!0,this.trackEndLines=!0,this.hasCustom=!1,this.canModeBeOptimized={},typeof r=="boolean")throw Error(`The second argument to the Lexer constructor is now an ILexerConfig Object.
a boolean 2nd argument is no longer supported`);this.config=w.merge(pt,r);var i=this.config.traceInitPerf;i===!0?(this.traceInitMaxIdent=Infinity,this.traceInitPerf=!0):typeof i=="number"&&(this.traceInitMaxIdent=i,this.traceInitPerf=!0),this.traceInitIndent=-1,this.TRACE_INIT("Lexer Constructor",function(){var a,o=!0;n.TRACE_INIT("Lexer Config handling",function(){if(n.config.lineTerminatorsPattern===pt.lineTerminatorsPattern)n.config.lineTerminatorsPattern=Ee.LineTerminatorOptimizedTester;else if(n.config.lineTerminatorCharacters===pt.lineTerminatorCharacters)throw Error(`Error: Missing <lineTerminatorCharacters> property on the Lexer config.
    For details See: https://chevrotain.io/docs/guide/resolving_lexer_errors.html#MISSING_LINE_TERM_CHARS`);if(r.safeMode&&r.ensureOptimizations)throw Error('"safeMode" and "ensureOptimizations" flags are mutually exclusive.');n.trackStartLines=/full|onlyStart/i.test(n.config.positionTracking),n.trackEndLines=/full/i.test(n.config.positionTracking),w.isArray(e)?(a={modes:{}},a.modes[Ee.DEFAULT_MODE]=w.cloneArr(e),a[Ee.DEFAULT_MODE]=Ee.DEFAULT_MODE):(o=!1,a=w.cloneObj(e))}),n.config.skipValidations===!1&&(n.TRACE_INIT("performRuntimeChecks",function(){n.lexerDefinitionErrors=n.lexerDefinitionErrors.concat(Ee.performRuntimeChecks(a,n.trackStartLines,n.config.lineTerminatorCharacters))}),n.TRACE_INIT("performWarningRuntimeChecks",function(){n.lexerDefinitionWarning=n.lexerDefinitionWarning.concat(Ee.performWarningRuntimeChecks(a,n.trackStartLines,n.config.lineTerminatorCharacters))})),a.modes=a.modes?a.modes:{},w.forEach(a.modes,function(p,l){a.modes[l]=w.reject(p,function(m){return w.isUndefined(m)})});var s=w.keys(a.modes);if(w.forEach(a.modes,function(p,l){n.TRACE_INIT("Mode: <"+l+"> processing",function(){if(n.modes.push(l),n.config.skipValidations===!1&&n.TRACE_INIT("validatePatterns",function(){n.lexerDefinitionErrors=n.lexerDefinitionErrors.concat(Ee.validatePatterns(p,s))}),w.isEmpty(n.lexerDefinitionErrors)){fo.augmentTokenTypes(p);var m;n.TRACE_INIT("analyzeTokenTypes",function(){m=Ee.analyzeTokenTypes(p,{lineTerminatorCharacters:n.config.lineTerminatorCharacters,positionTracking:r.positionTracking,ensureOptimizations:r.ensureOptimizations,safeMode:r.safeMode,tracer:n.TRACE_INIT.bind(n)})}),n.patternIdxToConfig[l]=m.patternIdxToConfig,n.charCodeToPatternIdxToConfig[l]=m.charCodeToPatternIdxToConfig,n.emptyGroups=w.merge(n.emptyGroups,m.emptyGroups),n.hasCustom=m.hasCustom||n.hasCustom,n.canModeBeOptimized[l]=m.canBeOptimized}})}),n.defaultMode=a.defaultMode,!w.isEmpty(n.lexerDefinitionErrors)&&!n.config.deferDefinitionErrorsHandling){var c=w.map(n.lexerDefinitionErrors,function(p){return p.message}),f=c.join(`-----------------------
`);throw new Error(`Errors detected in definition of Lexer:
`+f)}w.forEach(n.lexerDefinitionWarning,function(p){w.PRINT_WARNING(p.message)}),n.TRACE_INIT("Choosing sub-methods implementations",function(){if(Ee.SUPPORT_STICKY?(n.chopInput=w.IDENTITY,n.match=n.matchWithTest):(n.updateLastIndex=w.NOOP,n.match=n.matchWithExec),o&&(n.handleModes=w.NOOP),n.trackStartLines===!1&&(n.computeNewColumn=w.IDENTITY),n.trackEndLines===!1&&(n.updateTokenEndLineColumnLocation=w.NOOP),/full/i.test(n.config.positionTracking))n.createTokenInstance=n.createFullToken;else if(/onlyStart/i.test(n.config.positionTracking))n.createTokenInstance=n.createStartOnlyToken;else if(/onlyOffset/i.test(n.config.positionTracking))n.createTokenInstance=n.createOffsetOnlyToken;else throw Error('Invalid <positionTracking> config option: "'+n.config.positionTracking+'"');n.hasCustom?(n.addToken=n.addTokenUsingPush,n.handlePayload=n.handlePayloadWithCustom):(n.addToken=n.addTokenUsingMemberAccess,n.handlePayload=n.handlePayloadNoCustom)}),n.TRACE_INIT("Failed Optimization Warnings",function(){var p=w.reduce(n.canModeBeOptimized,function(l,m,v){return m===!1&&l.push(v),l},[]);if(r.ensureOptimizations&&!w.isEmpty(p))throw Error("Lexer Modes: < "+p.join(", ")+` > cannot be optimized.
     Disable the "ensureOptimizations" lexer config flag to silently ignore this and run the lexer in an un-optimized mode.
     Or inspect the console log for details on how to resolve these issues.`)}),n.TRACE_INIT("clearRegExpParserCache",function(){ho.clearRegExpParserCache()}),n.TRACE_INIT("toFastProperties",function(){w.toFastProperties(n)})})}

`Jr(): any[]`¶

Returns: any[]

Code

function Jr(){return we}

`en(J: any): any`¶

Parameters:

J any

Returns: any

Calls:

Ee.charCodeToOptimizedIndex

Code

function en(J){var lt=Ee.charCodeToOptimizedIndex(J),ze=ot[lt];return ze===void 0?Qr:ze}

`wa(J: any): void`¶

Parameters:

J any

Returns: void

Calls:

n.config.errorMessageProvider.buildUnableToPopLexerModeMessage
ue.push
It.pop
w.last

Code

function(J){if(It.length===1&&J.tokenType.PUSH_MODE===void 0){var lt=n.config.errorMessageProvider.buildUnableToPopLexerModeMessage(J);ue.push({offset:J.startOffset,line:J.startLine!==void 0?J.startLine:void 0,column:J.startColumn!==void 0?J.startColumn:void 0,length:J.image.length,message:lt})}else{It.pop();var ze=w.last(It);we=n.patternIdxToConfig[ze],ot=n.charCodeToPatternIdxToConfig[ze],Ke=we.length;var Ua=n.canModeBeOptimized[ze]&&n.config.safeMode===!1;ot&&Ua?st=en:st=Jr}}

`tn(J: any): void`¶

Parameters:

J any

Returns: void

Calls:

It.push

Code

function tn(J){It.push(J),ot=this.charCodeToPatternIdxToConfig[J],we=this.patternIdxToConfig[J],Ke=we.length,Ke=we.length;var lt=this.canModeBeOptimized[J]&&this.config.safeMode===!1;ot&&lt?st=en:st=Jr}

`To(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Dn

Code

function To(t){return Dn(t)?t.LABEL:t.name}

`yo(t: any): any`¶

Parameters:

t any

Returns: any

Code

function yo(t){return t.name}

`Dn(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Calls:

Te.isString

Code

function Dn(t){return Te.isString(t.LABEL)&&t.LABEL!==""}

`zn(t: any): { name: any; PATTERN: any; CATEGORIES: any; LABEL: any; GROUP: any; POP_MODE: any; PUSH_MODE: any; LONGER_ALT: any; LINE_BREAKS: any; START_CHARS_HINT: any; }`¶

Parameters:

t any

Returns: { name: any; PATTERN: any; CATEGORIES: any; LABEL: any; GROUP: any; POP_MODE: any; PUSH_MODE: any; LONGER_ALT: any; LINE_BREAKS: any; START_CHARS_HINT: any; }

Calls:

go

Code

function zn(t){return go(t)}

`go(t: any): { name: any; PATTERN: any; CATEGORIES: any; LABEL: any; GROUP: any; POP_MODE: any; PUSH_MODE: any; LONGER_ALT: any; LINE_BREAKS: any; START_CHARS_HINT: any; }`¶

Parameters:

t any

Returns: { name: any; PATTERN: any; CATEGORIES: any; LABEL: any; GROUP: any; POP_MODE: any; PUSH_MODE: any; LONGER_ALT: any; LINE_BREAKS: any; START_CHARS_HINT: any; }

Calls:

Te.isUndefined
Te.has
Pr.augmentTokenTypes

Code

function go(t){var e=t.pattern,r={};if(r.name=t.name,Te.isUndefined(e)||(r.PATTERN=e),Te.has(t,_o))throw`The parent property is no longer supported.
See: https://github.com/chevrotain/chevrotain/issues/564#issuecomment-349062346 for details.`;return Te.has(t,Un)&&(r.CATEGORIES=t[Un]),Pr.augmentTokenTypes([r]),Te.has(t,Gn)&&(r.LABEL=t[Gn]),Te.has(t,Wn)&&(r.GROUP=t[Wn]),Te.has(t,qn)&&(r.POP_MODE=t[qn]),Te.has(t,Bn)&&(r.PUSH_MODE=t[Bn]),Te.has(t,jn)&&(r.LONGER_ALT=t[jn]),Te.has(t,Vn)&&(r.LINE_BREAKS=t[Vn]),Te.has(t,Kn)&&(r.START_CHARS_HINT=t[Kn]),r}

`Ao(t: any, e: any, r: any, n: any, i: any, a: any, o: any, s: any): { image: any; startOffset: any; endOffset: any; startLine: any; endLine: any; startColumn: any; endColumn: any; tokenTypeIdx: any; tokenType: any; }`¶

Parameters:

t any
e any
r any
n any
i any
a any
o any
s any

Returns: { image: any; startOffset: any; endOffset: any; startLine: any; endLine: any; startColumn: any; endColumn: any; tokenTypeIdx: any; tokenType: any; }

Code

function Ao(t,e,r,n,i,a,o,s){return{image:e,startOffset:r,endOffset:n,startLine:i,endLine:a,startColumn:o,endColumn:s,tokenTypeIdx:t.tokenTypeIdx,tokenType:t}}

`Ro(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

Pr.tokenStructuredMatcher

Code

function Ro(t,e){return Pr.tokenStructuredMatcher(t,e)}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`t(e: any): void`¶

Parameters:

e any

Returns: void

Code

function t(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,[])||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.orgText="",G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.ignoreAmbiguities=!1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call
G.assign
G.pick

Code

function e(r){var n=t.call(this,r.definition)||this;return n.idx=1,n.ignoreAmbiguities=!1,n.hasPredicates=!1,G.assign(n,G.pick(r,function(i){return i!==void 0})),n}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`t(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

G.assign
G.pick

Code

function t(e){this.idx=1,G.assign(this,G.pick(e,function(r){return r!==void 0}))}

`No(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

G.map

Code

function No(t){return G.map(t,ht)}

`ht(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

G.map
e
ht
Oo.tokenLabel
G.isRegExp
Error

Code

function ht(t){function e(i){return G.map(i,ht)}if(t instanceof Hn)return{type:"NonTerminal",name:t.nonTerminalName,idx:t.idx};if(t instanceof Xn)return{type:"Alternative",definition:e(t.definition)};if(t instanceof $n)return{type:"Option",idx:t.idx,definition:e(t.definition)};if(t instanceof Zn)return{type:"RepetitionMandatory",idx:t.idx,definition:e(t.definition)};if(t instanceof Qn)return{type:"RepetitionMandatoryWithSeparator",idx:t.idx,separator:ht(new Dt({terminalType:t.separator})),definition:e(t.definition)};if(t instanceof ei)return{type:"RepetitionWithSeparator",idx:t.idx,separator:ht(new Dt({terminalType:t.separator})),definition:e(t.definition)};if(t instanceof Jn)return{type:"Repetition",idx:t.idx,definition:e(t.definition)};if(t instanceof ti)return{type:"Alternation",idx:t.idx,definition:e(t.definition)};if(t instanceof Dt){var r={type:"Terminal",name:t.terminalType.name,label:Oo.tokenLabel(t.terminalType),idx:t.idx},n=t.terminalType.PATTERN;return t.terminalType.PATTERN&&(r.pattern=G.isRegExp(n)?n.source:n),r}else{if(t instanceof Yn)return{type:"Rule",name:t.name,orgText:t.orgText,definition:e(t.definition)};throw Error("non exhaustive match")}}

`e(i: any): any`¶

Parameters:

i any

Returns: any

Calls:

G.map

Code

function e(i){return G.map(i,ht)}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._definition=e}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this.referencedRule!==void 0?this.referencedRule.definition:[]}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`get(): any`¶

Returns: any

Code

function(){return this._definition}

`set(r: any): void`¶

Parameters:

r any

Returns: void

Code

function(r){this._definition=r}

`t(): void`¶

Returns: void

Code

function t(){}

`ri(t: any, e: any, r: any): any[]`¶

Parameters:

t any
e any
r any

Returns: any[]

Calls:

[new ie.Terminal({terminalType:t.separator})].concat
n.concat

Code

function ri(t,e,r){var n=[new ie.Option({definition:[new ie.Terminal({terminalType:t.separator})].concat(t.definition)})],i=n.concat(e,r);return i}

`t(): void`¶

Returns: void

Code

function t(){}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`xo(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function xo(t){return t instanceof W.Alternative||t instanceof W.Option||t instanceof W.Repetition||t instanceof W.RepetitionMandatory||t instanceof W.RepetitionMandatoryWithSeparator||t instanceof W.RepetitionWithSeparator||t instanceof W.Terminal||t instanceof W.Rule}

`xr(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

dt.some
xr
dt.contains
e.push
dt.every

Code

function xr(t,e){e===void 0&&(e=[]);var r=t instanceof W.Option||t instanceof W.Repetition||t instanceof W.RepetitionWithSeparator;return r?!0:t instanceof W.Alternation?dt.some(t.definition,function(n){return xr(n,e)}):t instanceof W.NonTerminal&&dt.contains(e,t)?!1:t instanceof W.AbstractProduction?(t instanceof W.NonTerminal&&e.push(t),dt.every(t.definition,function(n){return xr(n,e)})):!1}

`Co(t: any): boolean`¶

Parameters:

t any

Returns: boolean

Code

function Co(t){return t instanceof W.Alternation}

`Lo(t: any): "SUBRULE" | "OPTION" | "OR" | "AT_LEAST_ONE" | "AT_LEAST_ONE_SEP" | "MANY_SEP" | "MANY" | "CONSUME"`¶

Parameters:

t any

Calls:

Error

Code

function Lo(t){if(t instanceof W.NonTerminal)return"SUBRULE";if(t instanceof W.Option)return"OPTION";if(t instanceof W.Alternation)return"OR";if(t instanceof W.RepetitionMandatory)return"AT_LEAST_ONE";if(t instanceof W.RepetitionMandatoryWithSeparator)return"AT_LEAST_ONE_SEP";if(t instanceof W.RepetitionWithSeparator)return"MANY_SEP";if(t instanceof W.Repetition)return"MANY";if(t instanceof W.Terminal)return"CONSUME";throw Error("non exhaustive match")}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){var r=t!==null&&t.apply(this,arguments)||this;return r.separator="-",r.dslMethods={option:[],alternation:[],repetition:[],repetitionWithSeparator:[],repetitionMandatory:[],repetitionMandatoryWithSeparator:[]},r}

`Mo(t: any): { option: any[]; alternation: any[]; repetition: any[]; repetitionWithSeparator: any[]; repetitionMandatory: any[]; repetitionMandatoryWithSeparator: any[]; }`¶

Parameters:

t any

Returns: { option: any[]; alternation: any[]; repetition: any[]; repetitionWithSeparator: any[]; repetitionMandatory: any[]; repetitionMandatoryWithSeparator: any[]; }

Calls:

Bt.reset
t.accept

Code

function Mo(t){Bt.reset(),t.accept(Bt);var e=Bt.dslMethods;return Bt.reset(),e}

`jt(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

jt
si
Cr.isSequenceProd
ai
Cr.isBranchingProd
oi
Error

Code

function jt(t){if(t instanceof ii.NonTerminal)return jt(t.referencedRule);if(t instanceof ii.Terminal)return si(t);if(Cr.isSequenceProd(t))return ai(t);if(Cr.isBranchingProd(t))return oi(t);throw Error("non exhaustive match")}

`ai(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Cr.isOptionalProd
e.concat
jt
qt.uniq

Code

function ai(t){for(var e=[],r=t.definition,n=0,i=r.length>n,a,o=!0;i&&o;)a=r[n],o=Cr.isOptionalProd(a),e=e.concat(jt(a)),n=n+1,i=r.length>n;return qt.uniq(e)}

`oi(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

qt.map
jt
qt.uniq
qt.flatten

Code

function oi(t){var e=qt.map(t.definition,function(r){return jt(r)});return qt.uniq(qt.flatten(e))}

`si(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Code

function si(t){return[t.terminalType]}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`e(r: any): any`¶

Parameters:

r any

Returns: any

Calls:

t.call

Code

function e(r){var n=t.call(this)||this;return n.topProd=r,n.follows={},n}

`Uo(t: any): {}`¶

Parameters:

t any

Returns: {}

Calls:

ui.forEach
new fi(r).startWalking
ui.assign

Code

function Uo(t){var e={};return ui.forEach(t,function(r){var n=new fi(r).startWalking();ui.assign(e,n)}),e}

`li(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Code

function li(t,e){return t.name+e+ci.IN}

`Go(t: any): any`¶

Parameters:

t any

Returns: any

Code

function Go(t){var e=t.terminalType.name;return e+t.idx+ci.IN}

`buildMismatchTokenMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Ze.hasTokenLabel
Ze.tokenLabel

Code

function(t){var e=t.expected,r=t.actual,n=t.previous,i=t.ruleName,a=Ze.hasTokenLabel(e),o=a?"--> "+Ze.tokenLabel(e)+" <--":"token of type --> "+e.name+" <--",s="Expecting "+o+" but found --> '"+r.image+"' <--";return s}

`buildNotAllInputParsedMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=t.firstRedundant,r=t.ruleName;return"Redundant input, expecting EOF but found: "+e.image}

`buildNoViableAltMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.reduce
v.concat
ye.map
ye.map(v,function(u){return Ze.tokenLabel(u)}).join
l.join

Code

function(t){var e=t.expectedPathsPerAlt,r=t.actual,n=t.previous,i=t.customUserDescription,a=t.ruleName,o="Expecting: ",s=ye.first(r).image,c=`
but found: '`+s+"'";if(i)return o+i+c;var f=ye.reduce(e,function(v,u){return v.concat(u)},[]),p=ye.map(f,function(v){return"["+ye.map(v,function(u){return Ze.tokenLabel(u)}).join(", ")+"]"}),l=ye.map(p,function(v,u){return"  "+(u+1)+". "+v}),m=`one of these possible Token sequences:
`+l.join(`
`);return o+m+c}

`buildEarlyExitMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.map
ye.map(p,function(l){return Ze.tokenLabel(l)}).join
c.join

Code

function(t){var e=t.expectedIterationPaths,r=t.actual,n=t.customUserDescription,i=t.ruleName,a="Expecting: ",o=ye.first(r).image,s=`
but found: '`+o+"'";if(n)return a+n+s;var c=ye.map(e,function(p){return"["+ye.map(p,function(l){return Ze.tokenLabel(l)}).join(",")+"]"}),f=`expecting at least one iteration which starts with one of these possible Token sequences::
  `+("<"+c.join(" ,")+">");return a+f+s}

`buildMismatchTokenMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Ze.hasTokenLabel
Ze.tokenLabel

Code

function(t){var e=t.expected,r=t.actual,n=t.previous,i=t.ruleName,a=Ze.hasTokenLabel(e),o=a?"--> "+Ze.tokenLabel(e)+" <--":"token of type --> "+e.name+" <--",s="Expecting "+o+" but found --> '"+r.image+"' <--";return s}

`buildNotAllInputParsedMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=t.firstRedundant,r=t.ruleName;return"Redundant input, expecting EOF but found: "+e.image}

`buildNoViableAltMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.reduce
v.concat
ye.map
ye.map(v,function(u){return Ze.tokenLabel(u)}).join
l.join

Code

function(t){var e=t.expectedPathsPerAlt,r=t.actual,n=t.previous,i=t.customUserDescription,a=t.ruleName,o="Expecting: ",s=ye.first(r).image,c=`
but found: '`+s+"'";if(i)return o+i+c;var f=ye.reduce(e,function(v,u){return v.concat(u)},[]),p=ye.map(f,function(v){return"["+ye.map(v,function(u){return Ze.tokenLabel(u)}).join(", ")+"]"}),l=ye.map(p,function(v,u){return"  "+(u+1)+". "+v}),m=`one of these possible Token sequences:
`+l.join(`
`);return o+m+c}

`buildEarlyExitMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.map
ye.map(p,function(l){return Ze.tokenLabel(l)}).join
c.join

Code

function(t){var e=t.expectedIterationPaths,r=t.actual,n=t.customUserDescription,i=t.ruleName,a="Expecting: ",o=ye.first(r).image,s=`
but found: '`+o+"'";if(n)return a+n+s;var c=ye.map(e,function(p){return"["+ye.map(p,function(l){return Ze.tokenLabel(l)}).join(",")+"]"}),f=`expecting at least one iteration which starts with one of these possible Token sequences::
  `+("<"+c.join(" ,")+">");return a+f+s}

`buildRuleNotFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Code

function(t,e){var r="Invalid grammar, reference to a rule which is not defined: ->"+e.nonTerminalName+`<-
inside top level rule: ->`+t.name+"<-";return r}

`buildRuleNotFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Code

function(t,e){var r="Invalid grammar, reference to a rule which is not defined: ->"+e.nonTerminalName+`<-
inside top level rule: ->`+t.name+"<-";return r}

`buildDuplicateFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

ye.first
hi.getProductionDslName
r
f.replace

Code

function(t,e){function r(p){return p instanceof br.Terminal?p.terminalType.name:p instanceof br.NonTerminal?p.nonTerminalName:""}var n=t.name,i=ye.first(e),a=i.idx,o=hi.getProductionDslName(i),s=r(i),c=a>0,f="->"+o+(c?a:"")+"<- "+(s?"with argument: ->"+s+"<-":"")+`
                  appears more than once (`+e.length+" times) in the top level rule: ->"+n+`<-.
                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES
                  `;return f=f.replace(/[ \t]+/g," "),f=f.replace(/\s\s+/g,`
`),f}

`r(p: any): any`¶

Parameters:

p any

Returns: any

Code

function r(p){return p instanceof br.Terminal?p.terminalType.name:p instanceof br.NonTerminal?p.nonTerminalName:""}

`buildNamespaceConflictError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`Namespace conflict found in grammar.
`+("The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <"+t.name+`>.
`)+`To resolve this make sure each Terminal and Non-Terminal names are unique
This is easy to accomplish by using the convention that Terminal names start with an uppercase letter
and Non-Terminal names start with a lower case letter.`;return e}

`buildAlternationPrefixAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous alternatives: <"+t.ambiguityIndices.join(" ,")+`> due to common lookahead prefix
`+("in <OR"+r+"> inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`)+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX
For Further details.`;return n}

`buildAlternationAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous Alternatives Detected: <"+t.ambiguityIndices.join(" ,")+"> in <OR"+r+">"+(" inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`);return n=n+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES
For Further details.`,n}

`buildEmptyRepetitionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

hi.getProductionDslName

Code

function(t){var e=hi.getProductionDslName(t.repetition);t.repetition.idx!==0&&(e+=t.repetition.idx);var r="The repetition <"+e+"> within Rule <"+t.topLevelRule.name+`> can never consume any tokens.
This could lead to an infinite loop.`;return r}

`buildTokenNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildEmptyAlternationError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e="Ambiguous empty alternative: <"+(t.emptyChoiceIdx+1)+">"+(" in <OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
`)+"Only the last alternative may be an empty alternative.";return e}

`buildTooManyAlternativesError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`An Alternation cannot have more than 256 alternatives:
`+("<OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
 has `+(t.alternation.definition.length+1)+" alternatives.");return e}

`buildLeftRecursionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Wo.map
r.concat([e]).join

Code

function(t){var e=t.topLevelRule.name,r=Wo.map(t.leftRecursionPath,function(a){return a.name}),n=e+" --> "+r.concat([e]).join(" --> "),i=`Left Recursion found in grammar.
`+("rule: <"+e+`> can be invoked from itself (directly or indirectly)
`)+(`without consuming any Tokens. The grammar path that causes this is:
 `+n+`
`)+` To fix this refactor your grammar to remove the left recursion.
see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;return i}

`buildInvalidRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildDuplicateRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e;t.topLevelRule instanceof br.Rule?e=t.topLevelRule.name:e=t.topLevelRule;var r="Duplicate definition, rule: ->"+e+"<- is already defined in the grammar: ->"+t.grammarName+"<-";return r}

`buildDuplicateFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

ye.first
hi.getProductionDslName
r
f.replace

Code

function(t,e){function r(p){return p instanceof br.Terminal?p.terminalType.name:p instanceof br.NonTerminal?p.nonTerminalName:""}var n=t.name,i=ye.first(e),a=i.idx,o=hi.getProductionDslName(i),s=r(i),c=a>0,f="->"+o+(c?a:"")+"<- "+(s?"with argument: ->"+s+"<-":"")+`
                  appears more than once (`+e.length+" times) in the top level rule: ->"+n+`<-.
                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES
                  `;return f=f.replace(/[ \t]+/g," "),f=f.replace(/\s\s+/g,`
`),f}

`buildNamespaceConflictError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`Namespace conflict found in grammar.
`+("The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <"+t.name+`>.
`)+`To resolve this make sure each Terminal and Non-Terminal names are unique
This is easy to accomplish by using the convention that Terminal names start with an uppercase letter
and Non-Terminal names start with a lower case letter.`;return e}

`buildAlternationPrefixAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous alternatives: <"+t.ambiguityIndices.join(" ,")+`> due to common lookahead prefix
`+("in <OR"+r+"> inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`)+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX
For Further details.`;return n}

`buildAlternationAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous Alternatives Detected: <"+t.ambiguityIndices.join(" ,")+"> in <OR"+r+">"+(" inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`);return n=n+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES
For Further details.`,n}

`buildEmptyRepetitionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

hi.getProductionDslName

Code

function(t){var e=hi.getProductionDslName(t.repetition);t.repetition.idx!==0&&(e+=t.repetition.idx);var r="The repetition <"+e+"> within Rule <"+t.topLevelRule.name+`> can never consume any tokens.
This could lead to an infinite loop.`;return r}

`buildTokenNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildEmptyAlternationError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e="Ambiguous empty alternative: <"+(t.emptyChoiceIdx+1)+">"+(" in <OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
`)+"Only the last alternative may be an empty alternative.";return e}

`buildTooManyAlternativesError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`An Alternation cannot have more than 256 alternatives:
`+("<OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
 has `+(t.alternation.definition.length+1)+" alternatives.");return e}

`buildLeftRecursionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Wo.map
r.concat([e]).join

Code

function(t){var e=t.topLevelRule.name,r=Wo.map(t.leftRecursionPath,function(a){return a.name}),n=e+" --> "+r.concat([e]).join(" --> "),i=`Left Recursion found in grammar.
`+("rule: <"+e+`> can be invoked from itself (directly or indirectly)
`)+(`without consuming any Tokens. The grammar path that causes this is:
 `+n+`
`)+` To fix this refactor your grammar to remove the left recursion.
see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;return i}

`buildInvalidRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildDuplicateRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e;t.topLevelRule instanceof br.Rule?e=t.topLevelRule.name:e=t.topLevelRule;var r="Duplicate definition, rule: ->"+e+"<- is already defined in the grammar: ->"+t.grammarName+"<-";return r}

`buildMismatchTokenMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Ze.hasTokenLabel
Ze.tokenLabel

Code

function(t){var e=t.expected,r=t.actual,n=t.previous,i=t.ruleName,a=Ze.hasTokenLabel(e),o=a?"--> "+Ze.tokenLabel(e)+" <--":"token of type --> "+e.name+" <--",s="Expecting "+o+" but found --> '"+r.image+"' <--";return s}

`buildNotAllInputParsedMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=t.firstRedundant,r=t.ruleName;return"Redundant input, expecting EOF but found: "+e.image}

`buildNoViableAltMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.reduce
v.concat
ye.map
ye.map(v,function(u){return Ze.tokenLabel(u)}).join
l.join

Code

function(t){var e=t.expectedPathsPerAlt,r=t.actual,n=t.previous,i=t.customUserDescription,a=t.ruleName,o="Expecting: ",s=ye.first(r).image,c=`
but found: '`+s+"'";if(i)return o+i+c;var f=ye.reduce(e,function(v,u){return v.concat(u)},[]),p=ye.map(f,function(v){return"["+ye.map(v,function(u){return Ze.tokenLabel(u)}).join(", ")+"]"}),l=ye.map(p,function(v,u){return"  "+(u+1)+". "+v}),m=`one of these possible Token sequences:
`+l.join(`
`);return o+m+c}

`buildEarlyExitMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.map
ye.map(p,function(l){return Ze.tokenLabel(l)}).join
c.join

Code

function(t){var e=t.expectedIterationPaths,r=t.actual,n=t.customUserDescription,i=t.ruleName,a="Expecting: ",o=ye.first(r).image,s=`
but found: '`+o+"'";if(n)return a+n+s;var c=ye.map(e,function(p){return"["+ye.map(p,function(l){return Ze.tokenLabel(l)}).join(",")+"]"}),f=`expecting at least one iteration which starts with one of these possible Token sequences::
  `+("<"+c.join(" ,")+">");return a+f+s}

`buildMismatchTokenMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Ze.hasTokenLabel
Ze.tokenLabel

Code

function(t){var e=t.expected,r=t.actual,n=t.previous,i=t.ruleName,a=Ze.hasTokenLabel(e),o=a?"--> "+Ze.tokenLabel(e)+" <--":"token of type --> "+e.name+" <--",s="Expecting "+o+" but found --> '"+r.image+"' <--";return s}

`buildNotAllInputParsedMessage(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=t.firstRedundant,r=t.ruleName;return"Redundant input, expecting EOF but found: "+e.image}

`buildNoViableAltMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.reduce
v.concat
ye.map
ye.map(v,function(u){return Ze.tokenLabel(u)}).join
l.join

Code

function(t){var e=t.expectedPathsPerAlt,r=t.actual,n=t.previous,i=t.customUserDescription,a=t.ruleName,o="Expecting: ",s=ye.first(r).image,c=`
but found: '`+s+"'";if(i)return o+i+c;var f=ye.reduce(e,function(v,u){return v.concat(u)},[]),p=ye.map(f,function(v){return"["+ye.map(v,function(u){return Ze.tokenLabel(u)}).join(", ")+"]"}),l=ye.map(p,function(v,u){return"  "+(u+1)+". "+v}),m=`one of these possible Token sequences:
`+l.join(`
`);return o+m+c}

`buildEarlyExitMessage(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.first
ye.map
ye.map(p,function(l){return Ze.tokenLabel(l)}).join
c.join

Code

function(t){var e=t.expectedIterationPaths,r=t.actual,n=t.customUserDescription,i=t.ruleName,a="Expecting: ",o=ye.first(r).image,s=`
but found: '`+o+"'";if(n)return a+n+s;var c=ye.map(e,function(p){return"["+ye.map(p,function(l){return Ze.tokenLabel(l)}).join(",")+"]"}),f=`expecting at least one iteration which starts with one of these possible Token sequences::
  `+("<"+c.join(" ,")+">");return a+f+s}

`buildRuleNotFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Code

function(t,e){var r="Invalid grammar, reference to a rule which is not defined: ->"+e.nonTerminalName+`<-
inside top level rule: ->`+t.name+"<-";return r}

`buildRuleNotFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Code

function(t,e){var r="Invalid grammar, reference to a rule which is not defined: ->"+e.nonTerminalName+`<-
inside top level rule: ->`+t.name+"<-";return r}

`buildDuplicateFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

ye.first
hi.getProductionDslName
r
f.replace

Code

function(t,e){function r(p){return p instanceof br.Terminal?p.terminalType.name:p instanceof br.NonTerminal?p.nonTerminalName:""}var n=t.name,i=ye.first(e),a=i.idx,o=hi.getProductionDslName(i),s=r(i),c=a>0,f="->"+o+(c?a:"")+"<- "+(s?"with argument: ->"+s+"<-":"")+`
                  appears more than once (`+e.length+" times) in the top level rule: ->"+n+`<-.
                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES
                  `;return f=f.replace(/[ \t]+/g," "),f=f.replace(/\s\s+/g,`
`),f}

`buildNamespaceConflictError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`Namespace conflict found in grammar.
`+("The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <"+t.name+`>.
`)+`To resolve this make sure each Terminal and Non-Terminal names are unique
This is easy to accomplish by using the convention that Terminal names start with an uppercase letter
and Non-Terminal names start with a lower case letter.`;return e}

`buildAlternationPrefixAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous alternatives: <"+t.ambiguityIndices.join(" ,")+`> due to common lookahead prefix
`+("in <OR"+r+"> inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`)+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX
For Further details.`;return n}

`buildAlternationAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous Alternatives Detected: <"+t.ambiguityIndices.join(" ,")+"> in <OR"+r+">"+(" inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`);return n=n+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES
For Further details.`,n}

`buildEmptyRepetitionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

hi.getProductionDslName

Code

function(t){var e=hi.getProductionDslName(t.repetition);t.repetition.idx!==0&&(e+=t.repetition.idx);var r="The repetition <"+e+"> within Rule <"+t.topLevelRule.name+`> can never consume any tokens.
This could lead to an infinite loop.`;return r}

`buildTokenNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildEmptyAlternationError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e="Ambiguous empty alternative: <"+(t.emptyChoiceIdx+1)+">"+(" in <OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
`)+"Only the last alternative may be an empty alternative.";return e}

`buildTooManyAlternativesError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`An Alternation cannot have more than 256 alternatives:
`+("<OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
 has `+(t.alternation.definition.length+1)+" alternatives.");return e}

`buildLeftRecursionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Wo.map
r.concat([e]).join

Code

function(t){var e=t.topLevelRule.name,r=Wo.map(t.leftRecursionPath,function(a){return a.name}),n=e+" --> "+r.concat([e]).join(" --> "),i=`Left Recursion found in grammar.
`+("rule: <"+e+`> can be invoked from itself (directly or indirectly)
`)+(`without consuming any Tokens. The grammar path that causes this is:
 `+n+`
`)+` To fix this refactor your grammar to remove the left recursion.
see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;return i}

`buildInvalidRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildDuplicateRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e;t.topLevelRule instanceof br.Rule?e=t.topLevelRule.name:e=t.topLevelRule;var r="Duplicate definition, rule: ->"+e+"<- is already defined in the grammar: ->"+t.grammarName+"<-";return r}

`buildDuplicateFoundError(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

ye.first
hi.getProductionDslName
r
f.replace

Code

function(t,e){function r(p){return p instanceof br.Terminal?p.terminalType.name:p instanceof br.NonTerminal?p.nonTerminalName:""}var n=t.name,i=ye.first(e),a=i.idx,o=hi.getProductionDslName(i),s=r(i),c=a>0,f="->"+o+(c?a:"")+"<- "+(s?"with argument: ->"+s+"<-":"")+`
                  appears more than once (`+e.length+" times) in the top level rule: ->"+n+`<-.
                  For further details see: https://chevrotain.io/docs/FAQ.html#NUMERICAL_SUFFIXES
                  `;return f=f.replace(/[ \t]+/g," "),f=f.replace(/\s\s+/g,`
`),f}

`buildNamespaceConflictError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`Namespace conflict found in grammar.
`+("The grammar has both a Terminal(Token) and a Non-Terminal(Rule) named: <"+t.name+`>.
`)+`To resolve this make sure each Terminal and Non-Terminal names are unique
This is easy to accomplish by using the convention that Terminal names start with an uppercase letter
and Non-Terminal names start with a lower case letter.`;return e}

`buildAlternationPrefixAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous alternatives: <"+t.ambiguityIndices.join(" ,")+`> due to common lookahead prefix
`+("in <OR"+r+"> inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`)+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#COMMON_PREFIX
For Further details.`;return n}

`buildAlternationAmbiguityError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join
t.ambiguityIndices.join

Code

function(t){var e=ye.map(t.prefixPath,function(i){return Ze.tokenLabel(i)}).join(", "),r=t.alternation.idx===0?"":t.alternation.idx,n="Ambiguous Alternatives Detected: <"+t.ambiguityIndices.join(" ,")+"> in <OR"+r+">"+(" inside <"+t.topLevelRule.name+`> Rule,
`)+("<"+e+`> may appears as a prefix path in all these alternatives.
`);return n=n+`See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#AMBIGUOUS_ALTERNATIVES
For Further details.`,n}

`buildEmptyRepetitionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

hi.getProductionDslName

Code

function(t){var e=hi.getProductionDslName(t.repetition);t.repetition.idx!==0&&(e+=t.repetition.idx);var r="The repetition <"+e+"> within Rule <"+t.topLevelRule.name+`> can never consume any tokens.
This could lead to an infinite loop.`;return r}

`buildTokenNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildEmptyAlternationError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e="Ambiguous empty alternative: <"+(t.emptyChoiceIdx+1)+">"+(" in <OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
`)+"Only the last alternative may be an empty alternative.";return e}

`buildTooManyAlternativesError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e=`An Alternation cannot have more than 256 alternatives:
`+("<OR"+t.alternation.idx+"> inside <"+t.topLevelRule.name+`> Rule.
 has `+(t.alternation.definition.length+1)+" alternatives.");return e}

`buildLeftRecursionError(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Wo.map
r.concat([e]).join

Code

function(t){var e=t.topLevelRule.name,r=Wo.map(t.leftRecursionPath,function(a){return a.name}),n=e+" --> "+r.concat([e]).join(" --> "),i=`Left Recursion found in grammar.
`+("rule: <"+e+`> can be invoked from itself (directly or indirectly)
`)+(`without consuming any Tokens. The grammar path that causes this is:
 `+n+`
`)+` To fix this refactor your grammar to remove the left recursion.
see: https://en.wikipedia.org/wiki/LL_parser#Left_Factoring.`;return i}

`buildInvalidRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){return"deprecated"}

`buildDuplicateRuleNameError(t: any): string`¶

Parameters:

t any

Returns: string

Code

function(t){var e;t.topLevelRule instanceof br.Rule?e=t.topLevelRule.name:e=t.topLevelRule;var r="Duplicate definition, rule: ->"+e+"<- is already defined in the grammar: ->"+t.grammarName+"<-";return r}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`Vo(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

r.resolveRefs

Code

function Vo(t,e){var r=new vi(t,e);return r.resolveRefs(),r.errors}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call

Code

function e(r,n){var i=t.call(this)||this;return i.nameToTopRule=r,i.errMsgProvider=n,i.errors=[],i}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call

Code

function e(r,n){var i=t.call(this)||this;return i.topProd=r,i.path=n,i.possibleTokTypes=[],i.nextProductionName="",i.nextProductionOccurrence=0,i.found=!1,i.isAtEndOfPath=!1,i}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call

Code

function e(r,n){var i=t.call(this,r,n)||this;return i.path=n,i.nextTerminalName="",i.nextTerminalOccurrence=0,i.nextTerminalName=i.path.lastTok.name,i.nextTerminalOccurrence=i.path.lastTokOccurrence,i}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call

Code

function e(r,n){var i=t.call(this)||this;return i.topRule=r,i.occurrence=n,i.result={token:void 0,occurrence:void 0,isEndOfRule:void 0},i}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){return t!==null&&t.apply(this,arguments)||this}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){return t!==null&&t.apply(this,arguments)||this}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){return t!==null&&t.apply(this,arguments)||this}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){return t!==null&&t.apply(this,arguments)||this}

`yi(t: any, e: any, r: any): any`¶

Parameters:

t any
e any
r any

Returns: any

Calls:

I.cloneArr
f.concat
I.drop
yi
a
n.concat
o
s.definition.concat
[new O.Terminal({terminalType:s.separator})].concat
I.forEach
I.isEmpty
r.push
Error
n.push

Code

function yi(t,e,r){r===void 0&&(r=[]),r=I.cloneArr(r);var n=[],i=0;function a(f){return f.concat(I.drop(t,i+1))}function o(f){var p=yi(a(f),e,r);return n.concat(p)}for(;r.length<e&&i<t.length;){var s=t[i];if(s instanceof O.Alternative)return o(s.definition);if(s instanceof O.NonTerminal)return o(s.definition);if(s instanceof O.Option)n=o(s.definition);else if(s instanceof O.RepetitionMandatory){var c=s.definition.concat([new O.Repetition({definition:s.definition})]);return o(c)}else if(s instanceof O.RepetitionMandatoryWithSeparator){var c=[new O.Alternative({definition:s.definition}),new O.Repetition({definition:[new O.Terminal({terminalType:s.separator})].concat(s.definition)})];return o(c)}else if(s instanceof O.RepetitionWithSeparator){var c=s.definition.concat([new O.Repetition({definition:[new O.Terminal({terminalType:s.separator})].concat(s.definition)})]);n=o(c)}else if(s instanceof O.Repetition){var c=s.definition.concat([new O.Repetition({definition:s.definition})]);n=o(c)}else{if(s instanceof O.Alternation)return I.forEach(s.definition,function(f){I.isEmpty(f.definition)===!1&&(n=o(f.definition))}),n;if(s instanceof O.Terminal)r.push(s.terminalType);else throw Error("non exhaustive match")}i++}return n.push({partialPath:r,suffixDef:I.drop(t,i)}),n}

`a(f: any): any`¶

Parameters:

f any

Returns: any

Calls:

f.concat
I.drop

Code

function a(f){return f.concat(I.drop(t,i+1))}

`o(f: any): any`¶

Parameters:

f any

Returns: any

Calls:

yi
a
n.concat

Code

function o(f){var p=yi(a(f),e,r);return n.concat(p)}

`Qo(t: any, e: any, r: any, n: any): { nextTokenType: any; nextTokenOccurrence: any; ruleStack: any; occurrenceStack: any; }[]`¶

Parameters:

t any
e any
r any
n any

Returns: { nextTokenType: any; nextTokenOccurrence: any; ruleStack: any; occurrenceStack: any; }[]

Calls:

l.push
I.isEmpty
l.pop
I.last
I.drop
I.dropRight
r
p.push
Error
I.cloneArr
L.push
se.push
_.definition.concat
[te].concat
at.definition.concat
Zo

Code

function Qo(t,e,r,n){var i="EXIT_NONE_TERMINAL",a=[i],o="EXIT_ALTERNATIVE",s=!1,c=e.length,f=c-n-1,p=[],l=[];for(l.push({idx:-1,def:t,ruleStack:[],occurrenceStack:[]});!I.isEmpty(l);){var m=l.pop();if(m===o){s&&I.last(l).idx<=f&&l.pop();continue}var v=m.def,u=m.idx,d=m.ruleStack,A=m.occurrenceStack;if(!I.isEmpty(v)){var _=v[0];if(_===i){var g={idx:u,def:I.drop(v),ruleStack:I.dropRight(d),occurrenceStack:I.dropRight(A)};l.push(g)}else if(_ instanceof O.Terminal)if(u<c-1){var y=u+1,b=e[y];if(r(b,_.terminalType)){var g={idx:y,def:I.drop(v),ruleStack:d,occurrenceStack:A};l.push(g)}}else if(u===c-1)p.push({nextTokenType:_.terminalType,nextTokenOccurrence:_.idx,ruleStack:d,occurrenceStack:A}),s=!0;else throw Error("non exhaustive match");else if(_ instanceof O.NonTerminal){var L=I.cloneArr(d);L.push(_.nonTerminalName);var se=I.cloneArr(A);se.push(_.idx);var g={idx:u,def:_.definition.concat(a,I.drop(v)),ruleStack:L,occurrenceStack:se};l.push(g)}else if(_ instanceof O.Option){var fe={idx:u,def:I.drop(v),ruleStack:d,occurrenceStack:A};l.push(fe),l.push(o);var Z={idx:u,def:_.definition.concat(I.drop(v)),ruleStack:d,occurrenceStack:A};l.push(Z)}else if(_ instanceof O.RepetitionMandatory){var ue=new O.Repetition({definition:_.definition,idx:_.idx}),Q=_.definition.concat([ue],I.drop(v)),g={idx:u,def:Q,ruleStack:d,occurrenceStack:A};l.push(g)}else if(_ instanceof O.RepetitionMandatoryWithSeparator){var te=new O.Terminal({terminalType:_.separator}),ue=new O.Repetition({definition:[te].concat(_.definition),idx:_.idx}),Q=_.definition.concat([ue],I.drop(v)),g={idx:u,def:Q,ruleStack:d,occurrenceStack:A};l.push(g)}else if(_ instanceof O.RepetitionWithSeparator){var fe={idx:u,def:I.drop(v),ruleStack:d,occurrenceStack:A};l.push(fe),l.push(o);var te=new O.Terminal({terminalType:_.separator}),xe=new O.Repetition({definition:[te].concat(_.definition),idx:_.idx}),Q=_.definition.concat([xe],I.drop(v)),Z={idx:u,def:Q,ruleStack:d,occurrenceStack:A};l.push(Z)}else if(_ instanceof O.Repetition){var fe={idx:u,def:I.drop(v),ruleStack:d,occurrenceStack:A};l.push(fe),l.push(o);var xe=new O.Repetition({definition:_.definition,idx:_.idx}),Q=_.definition.concat([xe],I.drop(v)),Z={idx:u,def:Q,ruleStack:d,occurrenceStack:A};l.push(Z)}else if(_ instanceof O.Alternation)for(var it=_.definition.length-1;it>=0;it--){var at=_.definition[it],Ke={idx:u,def:at.definition.concat(I.drop(v)),ruleStack:d,occurrenceStack:A};l.push(Ke),l.push(o)}else if(_ instanceof O.Alternative)l.push({idx:u,def:_.definition.concat(I.drop(v)),ruleStack:d,occurrenceStack:A});else if(_ instanceof O.Rule)l.push(Zo(_,u,d,A));else throw Error("non exhaustive match")}}return p}

`Zo(t: any, e: any, r: any, n: any): { idx: any; def: any; ruleStack: any; occurrenceStack: any; }`¶

Parameters:

t any
e any
r any
n any

Returns: { idx: any; def: any; ruleStack: any; occurrenceStack: any; }

Calls:

I.cloneArr
i.push
a.push

Code

function Zo(t,e,r,n){var i=I.cloneArr(r);i.push(t.name);var a=I.cloneArr(n);return a.push(1),{idx:e,def:t.definition,ruleStack:i,occurrenceStack:a}}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`ts(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Error

Code

function ts(t){if(t instanceof We.Option)return z.OPTION;if(t instanceof We.Repetition)return z.REPETITION;if(t instanceof We.RepetitionMandatory)return z.REPETITION_MANDATORY;if(t instanceof We.RepetitionMandatoryWithSeparator)return z.REPETITION_MANDATORY_WITH_SEPARATOR;if(t instanceof We.RepetitionWithSeparator)return z.REPETITION_WITH_SEPARATOR;if(t instanceof We.Alternation)return z.ALTERNATION;throw Error("non exhaustive match")}

`rs(t: any, e: any, r: any, n: any, i: any, a: any): any`¶

Parameters:

t any
e any
r any
n any
i any
a any

Returns: any

Calls:

Ai
Fr
a

Code

function rs(t,e,r,n,i,a){var o=Ai(t,e,r),s=Fr(o)?Kt.tokenStructuredMatcherNoCategories:Kt.tokenStructuredMatcher;return a(o,n,s,i)}

`ns(t: any, e: any, r: any, n: any, i: any, a: any): any`¶

Parameters:

t any
e any
r any
n any
i any
a any

Returns: any

Calls:

Ri
Fr
a

Code

function ns(t,e,r,n,i,a){var o=Ri(t,e,i,r),s=Fr(o)?Kt.tokenStructuredMatcherNoCategories:Kt.tokenStructuredMatcher;return a(o[0],s,n)}

`is(t: any, e: any, r: any, n: any): ((c: any) => number) | (() => any)`¶

Parameters:

t any
e any
r any
n any

Returns: ((c: any) => number) | (() => any)

Calls:

D.every
D.map
v.call
this.LA
r
D.flatten
D.reduce
D.forEach
D.has

Code

function is(t,e,r,n){var i=t.length,a=D.every(t,function(c){return D.every(c,function(f){return f.length===1})});if(e)return function(c){for(var f=D.map(c,function(y){return y.GATE}),p=0;p<i;p++){var l=t[p],m=l.length,v=f[p];if(v!==void 0&&v.call(this)===!1)continue;e:for(var u=0;u<m;u++){for(var d=l[u],A=d.length,_=0;_<A;_++){var g=this.LA(_+1);if(r(g,d[_])===!1)continue e}return p}}};if(a&&!n){var o=D.map(t,function(c){return D.flatten(c)}),s=D.reduce(o,function(c,f,p){return D.forEach(f,function(l){D.has(c,l.tokenTypeIdx)||(c[l.tokenTypeIdx]=p),D.forEach(l.categoryMatches,function(m){D.has(c,m)||(c[m]=p)})}),c},[]);return function(){var c=this.LA(1);return s[c.tokenTypeIdx]}}else return function(){for(var c=0;c<i;c++){var f=t[c],p=f.length;e:for(var l=0;l<p;l++){for(var m=f[l],v=m.length,u=0;u<v;u++){var d=this.LA(u+1);if(r(d,m[u])===!1)continue e}return c}}}}

`as(t: any, e: any, r: any): () => boolean`¶

Parameters:

t any
e any
r any

Returns: () => boolean

Calls:

D.every
D.flatten
D.isEmpty
this.LA
D.reduce
D.forEach
e

Code

function as(t,e,r){var n=D.every(t,function(f){return f.length===1}),i=t.length;if(n&&!r){var a=D.flatten(t);if(a.length===1&&D.isEmpty(a[0].categoryMatches)){var o=a[0],s=o.tokenTypeIdx;return function(){return this.LA(1).tokenTypeIdx===s}}else{var c=D.reduce(a,function(f,p,l){return f[p.tokenTypeIdx]=!0,D.forEach(p.categoryMatches,function(m){f[m]=!0}),f},[]);return function(){var f=this.LA(1);return c[f.tokenTypeIdx]===!0}}}else return function(){e:for(var f=0;f<i;f++){for(var p=t[f],l=p.length,m=0;m<l;m++){var v=this.LA(m+1);if(e(v,p[m])===!1)continue e}return!0}return!1}}

`e(r: any, n: any, i: any): any`¶

Parameters:

r any
n any
i any

Returns: any

Calls:

t.call

Code

function e(r,n,i){var a=t.call(this)||this;return a.topProd=r,a.targetOccurrence=n,a.targetProdType=i,a}

`e(r: any, n: any, i: any): any`¶

Parameters:

r any
n any
i any

Returns: any

Calls:

t.call

Code

function e(r,n,i){var a=t.call(this)||this;return a.targetOccurrence=r,a.targetProdType=n,a.targetRef=i,a.result=[],a}

`Ni(t: any): any[]`¶

Parameters:

t any

Returns: any[]

Code

function Ni(t){for(var e=new Array(t),r=0;r<t;r++)e[r]=[];return e}

`wr(t: any): string[]`¶

Parameters:

t any

Returns: string[]

Calls:

i.push

Code

function wr(t){for(var e=[""],r=0;r<t.length;r++){for(var n=t[r],i=[],a=0;a<e.length;a++){var o=e[a];i.push(o+"_"+n.tokenTypeIdx);for(var s=0;s<n.categoryMatches.length;s++){var c="_"+n.categoryMatches[s];i.push(o+c)}}e=i}return e}

`ss(t: any, e: any, r: any): boolean`¶

Parameters:

t any
e any
r any

Returns: boolean

Code

function ss(t,e,r){for(var n=0;n<t.length;n++)if(n!==r)for(var i=t[n],a=0;a<e.length;a++){var o=e[a];if(i[o]===!0)return!1}return!0}

`Dr(t: any, e: any): any[]`¶

Parameters:

t any
e any

Returns: any[]

Calls:

D.map
gi.possiblePathsFrom
Ni
D.forEach
wr
ss
D.isEmpty
Ii
_.push
a[p].concat
c

Code

function Dr(t,e){for(var r=D.map(t,function(p){return gi.possiblePathsFrom([p],1)}),n=Ni(r.length),i=D.map(r,function(p){var l={};return D.forEach(p,function(m){var v=wr(m.partialPath);D.forEach(v,function(u){l[u]=!0})}),l}),a=r,o=1;o<=e;o++){var s=a;a=Ni(s.length);for(var c=function(p){for(var l=s[p],m=0;m<l.length;m++){var v=l[m].partialPath,u=l[m].suffixDef,d=wr(v),A=ss(i,d,p);if(A||D.isEmpty(u)||v.length===e){var _=n[p];if(Ii(_,v)===!1){_.push(v);for(var g=0;g<d.length;g++){var y=d[g];i[p][y]=!0}}}else{var b=gi.possiblePathsFrom(u,o+1,v);a[p]=a[p].concat(b),D.forEach(b,function(L){var se=wr(L.partialPath);D.forEach(se,function(fe){i[p][fe]=!0})})}}},f=0;f<s.length;f++)c(f)}return n}

`c(p: any): void`¶

Parameters:

p any

Returns: void

Calls:

wr
ss
D.isEmpty
Ii
_.push
gi.possiblePathsFrom
a[p].concat
D.forEach

Code

function(p){for(var l=s[p],m=0;m<l.length;m++){var v=l[m].partialPath,u=l[m].suffixDef,d=wr(v),A=ss(i,d,p);if(A||D.isEmpty(u)||v.length===e){var _=n[p];if(Ii(_,v)===!1){_.push(v);for(var g=0;g<d.length;g++){var y=d[g];i[p][y]=!0}}}else{var b=gi.possiblePathsFrom(u,o+1,v);a[p]=a[p].concat(b),D.forEach(b,function(L){var se=wr(L.partialPath);D.forEach(se,function(fe){i[p][fe]=!0})})}}}

`Ai(t: any, e: any, r: any, n: any): any[]`¶

Parameters:

t any
e any
r any
n any

Returns: any[]

Calls:

e.accept
Dr

Code

function Ai(t,e,r,n){var i=new Oi(t,z.ALTERNATION,n);return e.accept(i),Dr(i.result,r)}

`Ri(t: any, e: any, r: any, n: any): any[]`¶

Parameters:

t any
e any
r any
n any

Returns: any[]

Calls:

e.accept
o.startWalking
Dr

Code

function Ri(t,e,r,n){var i=new Oi(t,r);e.accept(i);var a=i.result,o=new os(e,t,r),s=o.startWalking(),c=new We.Alternative({definition:a}),f=new We.Alternative({definition:s});return Dr([c,f],n)}

`Ii(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Code

function Ii(t,e){e:for(var r=0;r<t.length;r++){var n=t[r];if(n.length===e.length){for(var i=0;i<n.length;i++){var a=e[i],o=n[i],s=a===o||o.categoryMatchesMap[a.tokenTypeIdx]!==void 0;if(s===!1)continue e}return!0}}return!1}

`us(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

D.every

Code

function us(t,e){return t.length<e.length&&D.every(t,function(r,n){var i=e[n];return r===i||i.categoryMatchesMap[r.tokenTypeIdx]})}

`Fr(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

D.every
D.isEmpty

Code

function Fr(t){return D.every(t,function(e){return D.every(e,function(r){return D.every(r,function(n){return D.isEmpty(n.categoryMatches)})})})}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`ps(t: any, e: any, r: any, n: any, i: any): any`¶

Parameters:

t any
e any
r any
n any
i any

Returns: any

Calls:

M.map
ls
Br
B.every
B.map
Pi
Si
Ci
fs
xi
ki
M.flatten
a.concat

Code

function ps(t,e,r,n,i){var a=M.map(t,function(v){return ls(v,n)}),o=M.map(t,function(v){return Br(v,v,n)}),s=[],c=[],f=[];B.every(o,B.isEmpty)&&(s=B.map(t,function(v){return Pi(v,n)}),c=B.map(t,function(v){return Si(v,e,n)}),f=Ci(t,e,n));var p=fs(t,r,n),l=B.map(t,function(v){return xi(v,n)}),m=B.map(t,function(v){return ki(v,t,i,n)});return M.flatten(a.concat(f,o,s,c,p,l,m))}

`ls(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

t.accept
M.groupBy
M.pick
M.map
M.values
M.first
e.buildDuplicateFoundError
Gr.getProductionDslName
Mi

Code

function ls(t,e){var r=new bi;t.accept(r);var n=r.allProductions,i=M.groupBy(n,Li),a=M.pick(i,function(s){return s.length>1}),o=M.map(M.values(a),function(s){var c=M.first(s),f=e.buildDuplicateFoundError(t,s),p=Gr.getProductionDslName(c),l={message:f,type:Ie.ParserDefinitionErrorType.DUPLICATE_PRODUCTIONS,ruleName:t.name,dslName:p,occurrence:c.idx},m=Mi(c);return m&&(l.parameter=m),l});return o}

`Li(t: any): string`¶

Parameters:

t any

Returns: string

Calls:

Gr.getProductionDslName
Mi

Code

function Li(t){return Gr.getProductionDslName(t)+"_#_"+t.idx+"_#_"+Mi(t)}

`Mi(t: any): any`¶

Parameters:

t any

Returns: any

Code

function Mi(t){return t instanceof _e.Terminal?t.terminalType.name:t instanceof _e.NonTerminal?t.nonTerminalName:""}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){var r=t!==null&&t.apply(this,arguments)||this;return r.allProductions=[],r}

`ki(t: any, e: any, r: any, n: any): { message: any; type: any; ruleName: any; }[]`¶

Parameters:

t any
e any
r any
n any

Returns: { message: any; type: any; ruleName: any; }[]

Calls:

B.reduce
n.buildDuplicateRuleNameError
i.push

Code

function ki(t,e,r,n){var i=[],a=B.reduce(e,function(s,c){return c.name===t.name?s+1:s},0);if(a>1){var o=n.buildDuplicateRuleNameError({topLevelRule:t,grammarName:r});i.push({message:o,type:Ie.ParserDefinitionErrorType.DUPLICATE_RULE_NAME,ruleName:t.name})}return i}

`hs(t: any, e: any, r: any): { message: string; type: any; ruleName: any; }[]`¶

Parameters:

t any
e any
r any

Returns: { message: string; type: any; ruleName: any; }[]

Calls:

M.contains
n.push

Code

function hs(t,e,r){var n=[],i;return M.contains(e,t)||(i="Invalid rule override, rule: ->"+t+"<- cannot be overridden in the grammar: ->"+r+"<-as it is not defined in any of the super grammars ",n.push({message:i,type:Ie.ParserDefinitionErrorType.INVALID_RULE_OVERRIDE,ruleName:t})),n}

`Br(t: any, e: any, r: any, n: any): { message: any; type: any; ruleName: any; }[]`¶

Parameters:

t any
e any
r any
n any

Returns: { message: any; type: any; ruleName: any; }[]

Calls:

_t
M.isEmpty
M.contains
i.push
r.buildLeftRecursionError
M.difference
n.concat
M.map
M.cloneArr
l.push
Br
i.concat
M.flatten

Code

function Br(t,e,r,n){n===void 0&&(n=[]);var i=[],a=_t(e.definition);if(M.isEmpty(a))return[];var o=t.name,s=M.contains(a,t);s&&i.push({message:r.buildLeftRecursionError({topLevelRule:t,leftRecursionPath:n}),type:Ie.ParserDefinitionErrorType.LEFT_RECURSION,ruleName:o});var c=M.difference(a,n.concat([t])),f=M.map(c,function(p){var l=M.cloneArr(n);return l.push(p),Br(t,p,r,l)});return i.concat(M.flatten(f))}

`_t(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

M.isEmpty
M.first
e.push
e.concat
_t
M.flatten
M.map
Error
Gr.isOptionalProd
M.drop

Code

function _t(t){var e=[];if(M.isEmpty(t))return e;var r=M.first(t);if(r instanceof _e.NonTerminal)e.push(r.referencedRule);else if(r instanceof _e.Alternative||r instanceof _e.Option||r instanceof _e.RepetitionMandatory||r instanceof _e.RepetitionMandatoryWithSeparator||r instanceof _e.RepetitionWithSeparator||r instanceof _e.Repetition)e=e.concat(_t(r.definition));else if(r instanceof _e.Alternation)e=M.flatten(M.map(r.definition,function(o){return _t(o.definition)}));else if(!(r instanceof _e.Terminal))throw Error("non exhaustive match");var n=Gr.isOptionalProd(r),i=t.length>1;if(n&&i){var a=M.drop(t);return e.concat(_t(a))}else return e}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){var r=t!==null&&t.apply(this,arguments)||this;return r.alternations=[],r}

`Pi(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

t.accept
M.reduce
M.dropRight
M.map
cs.nextPossibleTokensAfter
M.isEmpty
e.buildEmptyAlternationError
a.concat
M.compact

Code

function Pi(t,e){var r=new qr;t.accept(r);var n=r.alternations,i=M.reduce(n,function(a,o){var s=M.dropRight(o.definition),c=M.map(s,function(f,p){var l=cs.nextPossibleTokensAfter([f],[],null,1);return M.isEmpty(l)?{message:e.buildEmptyAlternationError({topLevelRule:t,alternation:o,emptyChoiceIdx:p}),type:Ie.ParserDefinitionErrorType.NONE_LAST_EMPTY_ALT,ruleName:t.name,occurrence:o.idx,alternative:p+1}:null});return a.concat(M.compact(c))},[]);return i}

`Si(t: any, e: any, r: any): any`¶

Parameters:

t any
e any
r any

Returns: any

Calls:

t.accept
B.reject
M.reduce
Qe.getLookaheadPathsForOr
ds
Fi
o.concat

Code

function Si(t,e,r){var n=new qr;t.accept(n);var i=n.alternations;i=B.reject(i,function(o){return o.ignoreAmbiguities===!0});var a=M.reduce(i,function(o,s){var c=s.idx,f=s.maxLookahead||e,p=Qe.getLookaheadPathsForOr(c,t,f,s),l=ds(p,s,t,r),m=Fi(p,s,t,r);return o.concat(l,m)},[]);return a}

`e(): any`¶

Returns: any

Calls:

t.apply

Code

function e(){var r=t!==null&&t.apply(this,arguments)||this;return r.allProductions=[],r}

`xi(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

t.accept
M.reduce
a.push
e.buildTooManyAlternativesError

Code

function xi(t,e){var r=new qr;t.accept(r);var n=r.alternations,i=M.reduce(n,function(a,o){return o.definition.length>255&&a.push({message:e.buildTooManyAlternativesError({topLevelRule:t,alternation:o}),type:Ie.ParserDefinitionErrorType.TOO_MANY_ALTS,ruleName:t.name,occurrence:o.idx}),a},[]);return i}

`Ci(t: any, e: any, r: any): any[]`¶

Parameters:

t any
e any
r any

Returns: any[]

Calls:

B.forEach
i.accept
Qe.getProdType
Qe.getLookaheadPathsForOptionalProd
B.isEmpty
B.flatten
r.buildEmptyRepetitionError
n.push

Code

function Ci(t,e,r){var n=[];return B.forEach(t,function(i){var a=new wi;i.accept(a);var o=a.allProductions;B.forEach(o,function(s){var c=Qe.getProdType(s),f=s.maxLookahead||e,p=s.idx,l=Qe.getLookaheadPathsForOptionalProd(p,i,c,f),m=l[0];if(B.isEmpty(B.flatten(m))){var v=r.buildEmptyRepetitionError({topLevelRule:i,repetition:s});n.push({message:v,type:Ie.ParserDefinitionErrorType.NO_NON_EMPTY_LOOKAHEAD,ruleName:i.name})}})}),n}

`ds(t: any, e: any, r: any, n: any): any`¶

Parameters:

t any
e any
r any
n any

Returns: any

Calls:

B.reduce
B.forEach
Qe.containsPath
l.push
i.push
s.push
M.map
B.map
n.buildAlternationAmbiguityError

Code

function ds(t,e,r,n){var i=[],a=B.reduce(t,function(s,c,f){return e.definition[f].ignoreAmbiguities===!0||B.forEach(c,function(p){var l=[f];B.forEach(t,function(m,v){f!==v&&Qe.containsPath(m,p)&&e.definition[v].ignoreAmbiguities!==!0&&l.push(v)}),l.length>1&&!Qe.containsPath(i,p)&&(i.push(p),s.push({alts:l,path:p}))}),s},[]),o=M.map(a,function(s){var c=B.map(s.alts,function(p){return p+1}),f=n.buildAlternationAmbiguityError({topLevelRule:r,alternation:e,ambiguityIndices:c,prefixPath:s.path});return{message:f,type:Ie.ParserDefinitionErrorType.AMBIGUOUS_ALTS,ruleName:r.name,occurrence:e.idx,alternatives:[s.alts]}});return o}

`Fi(t: any, e: any, r: any, n: any): any[]`¶

Parameters:

t any
e any
r any
n any

Returns: any[]

Calls:

B.reduce
B.map
o.concat
B.forEach
B.findAll
Qe.isStrictPrefixOfPath
n.buildAlternationPrefixAmbiguityError
i.concat

Code

function Fi(t,e,r,n){var i=[],a=B.reduce(t,function(o,s,c){var f=B.map(s,function(p){return{idx:c,path:p}});return o.concat(f)},[]);return B.forEach(a,function(o){var s=e.definition[o.idx];if(s.ignoreAmbiguities!==!0){var c=o.idx,f=o.path,p=B.findAll(a,function(m){return e.definition[m.idx].ignoreAmbiguities!==!0&&m.idx<c&&Qe.isStrictPrefixOfPath(m.path,f)}),l=B.map(p,function(m){var v=[m.idx+1,c+1],u=e.idx===0?"":e.idx,d=n.buildAlternationPrefixAmbiguityError({topLevelRule:r,alternation:e,ambiguityIndices:v,prefixPath:m.path});return{message:d,type:Ie.ParserDefinitionErrorType.AMBIGUOUS_PREFIX_ALTS,ruleName:r.name,occurrence:u,alternatives:v}});i=i.concat(l)}}),i}

`fs(t: any, e: any, r: any): any[]`¶

Parameters:

t any
e any
r any

Returns: any[]

Calls:

B.map
B.forEach
B.contains
r.buildNamespaceConflictError
n.push

Code

function fs(t,e,r){var n=[],i=B.map(e,function(a){return a.name});return B.forEach(t,function(a){var o=a.name;if(B.contains(i,o)){var s=r.buildNamespaceConflictError(a);n.push({message:s,type:Ie.ParserDefinitionErrorType.CONFLICT_TOKENS_RULES_NAMESPACE,ruleName:o})}}),n}

`Es(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Vr.defaults
Vr.forEach
vs.resolveGrammar

Code

function Es(t){t=Vr.defaults(t,{errMsgProvider:Di.defaultGrammarResolverErrorProvider});var e={};return Vr.forEach(t.rules,function(r){e[r.name]=r}),vs.resolveGrammar(e,t.errMsgProvider)}

`Ts(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Vr.defaults
ms.validateGrammar

Code

function Ts(t){return t=Vr.defaults(t,{errMsgProvider:Di.defaultGrammarValidatorErrorProvider}),ms.validateGrammar(t.rules,t.maxLookahead,t.tokenTypes,t.errMsgProvider,t.grammarName)}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`_s(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

ys.contains

Code

function _s(t){return ys.contains(ji,t.name)}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call
Object.setPrototypeOf
Error.captureStackTrace

Code

function e(r,n){var i=this.constructor,a=t.call(this,r)||this;return a.token=n,a.resyncedTokens=[],Object.setPrototypeOf(a,i.prototype),Error.captureStackTrace&&Error.captureStackTrace(a,a.constructor),a}

`e(r: any, n: any, i: any): any`¶

Parameters:

r any
n any
i any

Returns: any

Calls:

t.call

Code

function e(r,n,i){var a=t.call(this,r,n)||this;return a.previousToken=i,a.name=Gi,a}

`e(r: any, n: any, i: any): any`¶

Parameters:

r any
n any
i any

Returns: any

Calls:

t.call

Code

function e(r,n,i){var a=t.call(this,r,n)||this;return a.previousToken=i,a.name=Wi,a}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

t.call

Code

function e(r,n){var i=t.call(this,r,n)||this;return i.name=qi,i}

`e(r: any, n: any, i: any): any`¶

Parameters:

r any
n any
i any

Returns: any

Calls:

t.call

Code

function e(r,n,i){var a=t.call(this,r,n)||this;return a.previousToken=i,a.name=Bi,a}

`Kr(t: any): void`¶

Parameters:

t any

Returns: void

Code

function Kr(t){this.name=$.IN_RULE_RECOVERY_EXCEPTION,this.message=t}

`t(): void`¶

Returns: void

Code

function t(){}

`m(): void`¶

Returns: void

Calls:

a.LA
a.errorMessageProvider.buildMismatchTokenMessage
a.getCurrRuleFullName
de.dropRight
a.SAVE_ERROR

Code

function(){var v=a.LA(0),u=a.errorMessageProvider.buildMismatchTokenMessage({expected:i,actual:p,previous:v,ruleName:a.getCurrRuleFullName()}),d=new Ns.MismatchedTokenException(u,p,a.LA(0));d.resyncedTokens=de.dropRight(c),a.SAVE_ERROR(d)}

`Vi(t: any, e: any, r: any, n: any, i: any, a: any, o: any): void`¶

Parameters:

t any
e any
r any
n any
i any
a any
o any

Returns: void

Calls:

this.getKeyForAutomaticLookahead
this.getCurrRuleFullName
this.getGAstProductions
l.startWalking
this.shouldInRepetitionRecoveryBeTried
this.tryInRepetitionRecovery

Code

function Vi(t,e,r,n,i,a,o){var s=this.getKeyForAutomaticLookahead(n,i),c=this.firstAfterRepMap[s];if(c===void 0){var f=this.getCurrRuleFullName(),p=this.getGAstProductions()[f],l=new a(p,i);c=l.startWalking(),this.firstAfterRepMap[s]=c}var m=c.token,v=c.occurrence,u=c.isEndOfRule;this.RULE_STACK.length===1&&u&&m===void 0&&(m=Ht.EOF,v=1),this.shouldInRepetitionRecoveryBeTried(m,v,o)&&this.tryInRepetitionRecovery(t,e,r,m)}

`Ss(t: any, e: any, r: any): number`¶

Parameters:

t any
e any
r any

Returns: number

Code

function Ss(t,e,r){return r|e|t}

`t(): void`¶

Returns: void

Code

function t(){}

`Cs(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

isNaN

Code

function Cs(t,e){isNaN(t.startOffset)===!0?(t.startOffset=e.startOffset,t.endOffset=e.endOffset):t.endOffset<e.endOffset&&(t.endOffset=e.endOffset)}

`Ls(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

isNaN

Code

function Ls(t,e){isNaN(t.startOffset)===!0?(t.startOffset=e.startOffset,t.startColumn=e.startColumn,t.startLine=e.startLine,t.endOffset=e.endOffset,t.endColumn=e.endColumn,t.endLine=e.endLine):t.endOffset<e.endOffset&&(t.endOffset=e.endOffset,t.endColumn=e.endColumn,t.endLine=e.endLine)}

`Ms(t: any, e: any, r: any): void`¶

Parameters:

t any
e any
r any

Returns: void

Calls:

t.children[r].push

Code

function Ms(t,e,r){t.children[r]===void 0?t.children[r]=[e]:t.children[r].push(e)}

`bs(t: any, e: any, r: any): void`¶

Parameters:

t any
e any
r any

Returns: void

Calls:

t.children[e].push

Code

function bs(t,e,r){t.children[e]===void 0?t.children[e]=[r]:t.children[e].push(r)}

`ws(t: any): any`¶

Parameters:

t any

Returns: any

Calls:

Yi

Code

function ws(t){return Yi(t.constructor)}

`Yi(t: any): any`¶

Parameters:

t any

Returns: any

Code

function Yi(t){var e=t.name;return e||"anonymous"}

`Ds(t: any, e: any): boolean`¶

Parameters:

t any
e any

Returns: boolean

Calls:

Object.getOwnPropertyDescriptor
Fs.isUndefined
Object.defineProperty

Code

function Ds(t,e){var r=Object.getOwnPropertyDescriptor(t,Xi);return Fs.isUndefined(r)||r.configurable?(Object.defineProperty(t,Xi,{enumerable:!1,configurable:!0,writable:!1,value:e}),!0):!1}

`$i(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

ve.keys
complex_call_112790

Code

function $i(t,e){for(var r=ve.keys(t),n=r.length,i=0;i<n;i++)for(var a=r[i],o=t[a],s=o.length,c=0;c<s;c++){var f=o[c];f.tokenTypeIdx===void 0&&this[f.name](f.children,e)}}

`Us(t: any, e: any): typeof r`¶

Parameters:

t any
e any

Returns: typeof r

Calls:

At.defineNameProp
ve.isArray
ve.isUndefined
complex_call_112991
Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function Us(t,e){var r=function(){};At.defineNameProp(r,t+"BaseSemantics");var n={visit:function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)},validateVisitor:function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}};return r.prototype=n,r.prototype.constructor=r,r._RULE_NAMES=e,r}

`r(): void`¶

Returns: void

Code

function(){}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`Gs(t: any, e: any, r: any): typeof n`¶

Parameters:

t any
e any
r any

Returns: typeof n

Calls:

At.defineNameProp
Object.create
ve.forEach

Code

function Gs(t,e,r){var n=function(){};At.defineNameProp(n,t+"BaseSemanticsWithDefaults");var i=Object.create(r.prototype);return ve.forEach(e,function(a){i[a]=$i}),n.prototype=i,n.prototype.constructor=n,n}

`n(): void`¶

Returns: void

Code

function(){}

`Zi(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

Qi
Ji
r.concat

Code

function Zi(t,e){var r=Qi(t,e),n=Ji(t,e);return r.concat(n)}

`Qi(t: any, e: any): any`¶

Parameters:

t any
e any

Returns: any

Calls:

ve.map
ve.isFunction
At.functionName
ve.compact

Code

function Qi(t,e){var r=ve.map(e,function(n){if(!ve.isFunction(t[n]))return{msg:"Missing visitor method: <"+n+"> on "+At.functionName(t.constructor)+" CST Visitor.",type:Yr.MISSING_METHOD,methodName:n}});return ve.compact(r)}

`Ji(t: any, e: any): { msg: string; type: any; methodName: string; }[]`¶

Parameters:

t any
e any

Returns: { msg: string; type: any; methodName: string; }[]

Calls:

ve.isFunction
ve.contains
r.push
At.functionName

Code

function Ji(t,e){var r=[];for(var n in t)ve.isFunction(t[n])&&!ve.contains(Ws,n)&&!ve.contains(e,n)&&r.push({msg:"Redundant visitor method: <"+n+"> on "+At.functionName(t.constructor)+` CST Visitor
There is no Grammar Rule corresponding to this method's name.
`,type:Yr.REDUNDANT_METHOD,methodName:n});return r}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`visit(i: any, a: any): any`¶

Parameters:

i any
a any

Returns: any

Calls:

ve.isArray
ve.isUndefined
complex_call_112991

Code

function(i,a){if(ve.isArray(i)&&(i=i[0]),!ve.isUndefined(i))return this[i.name](i.children,a)}

`validateVisitor(): void`¶

Returns: void

Calls:

Zi
ve.isEmpty
ve.map
Error
At.functionName
a.join(

).replace

Code

function(){var i=Zi(this,e);if(!ve.isEmpty(i)){var a=ve.map(i,function(o){return o.msg});throw Error("Errors Detected in CST Visitor <"+At.functionName(this.constructor)+`>:
    `+(""+a.join(`

`).replace(/\n/g,`
    `)))}}

`t(): void`¶

Returns: void

Code

function t(){}

`t(): void`¶

Returns: void

Code

function t(){}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`get(): any[]`¶

Returns: any[]

Code

function(){return this.tokVector}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Calls:

Error
this.reset

Code

function(e){if(this.selfAnalysisDone!==!0)throw Error("Missing <performSelfAnalysis> invocation at the end of the Parser's constructor.");this.reset(),this.tokVector=e,this.tokVectorLength=e.length}

`t(): void`¶

Returns: void

Code

function t(){}

`t(): void`¶

Returns: void

Code

function t(){}

`s(p: any): any`¶

Parameters:

p any

Returns: any

Calls:

r.apply
this.cstPostRule
this.invokeRuleCatch
this.ruleFinallyStateUpdate

Code

function s(p){try{if(this.outputCst===!0){r.apply(this,p);var l=this.CST_STACK[this.CST_STACK.length-1];return this.cstPostRule(l),l}else return r.apply(this,p)}catch(m){return this.invokeRuleCatch(m,i,a)}finally{this.ruleFinallyStateUpdate()}}

`c(p: any, l: any): any`¶

Parameters:

p any
l any

Returns: any

Calls:

this.ruleInvocationStateUpdate
s.call

Code

function(p,l){return p===void 0&&(p=0),this.ruleInvocationStateUpdate(o,e,p),s.call(this,l)}

`c(): any`¶

Returns: any

Calls:

i.tokenMatcher
i.LA

Code

function(){return i.tokenMatcher(i.LA(1),o)}

`c(): any`¶

Returns: any

Calls:

i.tokenMatcher
i.LA

Code

function(){return i.tokenMatcher(i.LA(1),o)}

`t(): void`¶

Returns: void

Code

function t(){}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`get(): any`¶

Returns: any

Calls:

Zr.cloneArr

Code

function(){return Zr.cloneArr(this._errors)}

`set(e: any): void`¶

Parameters:

e any

Returns: void

Code

function(e){this._errors=e}

`t(): void`¶

Returns: void

Code

function t(){}

`t(): void`¶

Returns: void

Code

function t(){}

`r(i: any): void`¶

Parameters:

i any

Returns: void

Calls:

this.consumeInternalRecord
this.subruleInternalRecord
this.optionInternalRecord
this.orInternalRecord
this.manyInternalRecord
this.manySepFirstInternalRecord
this.atLeastOneInternalRecord
this.atLeastOneSepFirstInternalRecord

Code

function(i){var a=i>0?i:"";e["CONSUME"+a]=function(o,s){return this.consumeInternalRecord(o,i,s)},e["SUBRULE"+a]=function(o,s){return this.subruleInternalRecord(o,i,s)},e["OPTION"+a]=function(o){return this.optionInternalRecord(o,i)},e["OR"+a]=function(o){return this.orInternalRecord(o,i)},e["MANY"+a]=function(o){this.manyInternalRecord(i,o)},e["MANY_SEP"+a]=function(o){this.manySepFirstInternalRecord(i,o)},e["AT_LEAST_ONE"+a]=function(o){this.atLeastOneInternalRecord(i,o)},e["AT_LEAST_ONE_SEP"+a]=function(o){this.atLeastOneSepFirstInternalRecord(i,o)}}

`Ot(t: any, e: any, r: any, n: any): { description: string; }`¶

Parameters:

t any
e any
r any
n any

Returns: { description: string; }

Calls:

ar
oe.peek
oe.isFunction
oe.has
this.recordingProdStack.push
a.call
i.definition.push
this.recordingProdStack.pop

Code

function Ot(t,e,r,n){n===void 0&&(n=!1),ar(r);var i=oe.peek(this.recordingProdStack),a=oe.isFunction(e)?e:e.DEF,o=new t({definition:[],idx:r});return n&&(o.separator=e.SEP),oe.has(e,"MAX_LOOKAHEAD")&&(o.maxLookahead=e.MAX_LOOKAHEAD),this.recordingProdStack.push(o),a.call(this),i.definition.push(o),this.recordingProdStack.pop(),ir}

`au(t: any, e: any): { description: string; }`¶

Parameters:

t any
e any

Returns: { description: string; }

Calls:

ar
oe.peek
oe.isArray
oe.has
oe.some
oe.isFunction
n.definition.push
oe.forEach
o.definition.push
r.recordingProdStack.push
c.ALT.call
r.recordingProdStack.pop

Code

function au(t,e){var r=this;ar(e);var n=oe.peek(this.recordingProdStack),i=oe.isArray(t)===!1,a=i===!1?t:t.DEF,o=new Pe.Alternation({definition:[],idx:e,ignoreAmbiguities:i&&t.IGNORE_AMBIGUITIES===!0});oe.has(t,"MAX_LOOKAHEAD")&&(o.maxLookahead=t.MAX_LOOKAHEAD);var s=oe.some(a,function(c){return oe.isFunction(c.GATE)});return o.hasPredicates=s,n.definition.push(o),oe.forEach(a,function(c){var f=new Pe.Alternative({definition:[]});o.definition.push(f),oe.has(c,"IGNORE_AMBIGUITIES")?f.ignoreAmbiguities=c.IGNORE_AMBIGUITIES:oe.has(c,"GATE")&&(f.ignoreAmbiguities=!0),r.recordingProdStack.push(f),c.ALT.call(r),r.recordingProdStack.pop()}),ir}

`Aa(t: any): string`¶

Parameters:

t any

Returns: string

Code

function Aa(t){return t===0?"":""+t}

`ar(t: any): void`¶

Parameters:

t any

Returns: void

Code

function ar(t){if(t<0||t>ya){var e=new Error("Invalid DSL Method idx value: <"+t+`>
    `+("Idx value must be a none negative value smaller than "+(ya+1)));throw e.KNOWN_RECORDER_ERROR=!0,e}}

`t(): void`¶

Returns: void

Code

function t(){}

`cu(t: any, e: any): void`¶

Parameters:

t any
e any

Returns: void

Calls:

e.forEach
Object.getOwnPropertyNames(n).forEach
Object.getOwnPropertyDescriptor
Object.defineProperty

Code

function cu(t,e){e.forEach(function(r){var n=r.prototype;Object.getOwnPropertyNames(n).forEach(function(i){if(i!=="constructor"){var a=Object.getOwnPropertyDescriptor(n,i);a&&(a.get||a.set)?Object.defineProperty(t.prototype,i,a):t.prototype[i]=r.prototype[i]}})})}

`t(e: any, r: any): any`¶

Parameters:

e any
r any

Returns: any

Calls:

Object.prototype.hasOwnProperty.call
t

Code

function(e,r){return t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,i){n.__proto__=i}||function(n,i){for(var a in i)Object.prototype.hasOwnProperty.call(i,a)&&(n[a]=i[a])},t(e,r)}

`n(): void`¶

Returns: void

Code

function n(){this.constructor=e}

`recoveryValueFunc(): void`¶

Returns: void

Code

function(){}

`recoveryValueFunc(): void`¶

Returns: void

Code

function(){}

`Ru(t: any): () => any`¶

Parameters:

t any

Returns: () => any

Code

function Ru(t){return t===void 0&&(t=void 0),function(){return t}}

`t(e: any, r: any): void`¶

Parameters:

e any
r any

Returns: void

Calls:

n.initErrorHandler
n.initLexerAdapter
n.initLooksAhead
n.initRecognizerEngine
n.initRecoverable
n.initTreeBuilder
n.initContentAssist
n.initGastRecorder
n.initPerformanceTracer
ee.has

Code

function t(e,r){this.definitionErrors=[],this.selfAnalysisDone=!1;var n=this;if(n.initErrorHandler(r),n.initLexerAdapter(),n.initLooksAhead(r),n.initRecognizerEngine(e,r),n.initRecoverable(r),n.initTreeBuilder(r),n.initContentAssist(),n.initGastRecorder(r),n.initPerformanceTracer(r),ee.has(r,"ignoredIssues"))throw new Error(`The <ignoredIssues> IParserConfig property has been deprecated.
    Please use the <IGNORE_AMBIGUITIES> flag on the relevant DSL method instead.
    See: https://chevrotain.io/docs/guide/resolving_grammar_errors.html#IGNORING_AMBIGUITIES
    For further details.`);this.skipValidations=ee.has(r,"skipValidations")?r.skipValidations:U.DEFAULT_PARSER_CONFIG.skipValidations}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

ee.cloneObj
t.call

Code

function e(r,n){n===void 0&&(n=U.DEFAULT_PARSER_CONFIG);var i=this,a=ee.cloneObj(n);return a.outputCst=!0,i=t.call(this,r,a)||this,i}

`e(r: any, n: any): any`¶

Parameters:

r any
n any

Returns: any

Calls:

ee.cloneObj
t.call

Code

function e(r,n){n===void 0&&(n=U.DEFAULT_PARSER_CONFIG);var i=this,a=ee.cloneObj(n);return a.outputCst=!1,i=t.call(this,r,a)||this,i}

`recoveryValueFunc(): void`¶

Returns: void

Code

function(){}

`recoveryValueFunc(): void`¶

Returns: void

Code

function(){}

`Iu(t: any, e: any): string`¶

Parameters:

t any
e any

Returns: string

Calls:

JSON.stringify

Code

function Iu(t,e){var r=e===void 0?{}:e,n=r.resourceBase,i=n===void 0?"https://unpkg.com/chevrotain@"+Ca.VERSION+"/diagrams/":n,a=r.css,o=a===void 0?"https://unpkg.com/chevrotain@"+Ca.VERSION+"/diagrams/diagrams.css":a,s=`
<!-- This is a generated file -->
<!DOCTYPE html>
<meta charset="utf-8">
<style>
  body {
    background-color: hsl(30, 20%, 95%)
  }
</style>

`,c=`
<link rel='stylesheet' href='`+o+`'>
`,f=`
<script src='`+i+`vendor/railroad-diagrams.js'></script>
<script src='`+i+`src/diagrams_builder.js'></script>
<script src='`+i+`src/diagrams_behavior.js'></script>
<script src='`+i+`src/main.js'></script>
`,p=`
<div id="diagrams" align="center"></div>
`,l=`
<script>
    window.serializedGrammar = `+JSON.stringify(t,null,"  ")+`;
</script>
`,m=`
<script>
    var diagramsDiv = document.getElementById("diagrams");
    main.drawDiagramsFromSerializedGrammar(serializedGrammar, diagramsDiv);
</script>
`;return s+c+f+p+l+m}

`get(): any`¶

Returns: any

Code

function(){return ku.VERSION}

`get(): any`¶

Returns: any

Code

function(){return ku.VERSION}

`get(): any`¶

Returns: any

Code

function(){return lr.CstParser}

`get(): any`¶

Returns: any

Code

function(){return lr.CstParser}

`get(): any`¶

Returns: any

Code

function(){return lr.EmbeddedActionsParser}

`get(): any`¶

Returns: any

Code

function(){return lr.EmbeddedActionsParser}

`get(): any`¶

Returns: any

Code

function(){return lr.ParserDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return lr.ParserDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return lr.EMPTY_ALT}

`get(): any`¶

Returns: any

Code

function(){return lr.EMPTY_ALT}

`get(): any`¶

Returns: any

Code

function(){return Ma.Lexer}

`get(): any`¶

Returns: any

Code

function(){return Ma.Lexer}

`get(): any`¶

Returns: any

Code

function(){return Ma.LexerDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return Ma.LexerDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return nt.createToken}

`get(): any`¶

Returns: any

Code

function(){return nt.createToken}

`get(): any`¶

Returns: any

Code

function(){return nt.createTokenInstance}

`get(): any`¶

Returns: any

Code

function(){return nt.createTokenInstance}

`get(): any`¶

Returns: any

Code

function(){return nt.EOF}

`get(): any`¶

Returns: any

Code

function(){return nt.EOF}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenLabel}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenLabel}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenMatcher}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenMatcher}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenName}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenName}

`get(): any`¶

Returns: any

Code

function(){return Pu.defaultParserErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Pu.defaultParserErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Nt.EarlyExitException}

`get(): any`¶

Returns: any

Code

function(){return Nt.EarlyExitException}

`get(): any`¶

Returns: any

Code

function(){return Nt.isRecognitionException}

`get(): any`¶

Returns: any

Code

function(){return Nt.isRecognitionException}

`get(): any`¶

Returns: any

Code

function(){return Nt.MismatchedTokenException}

`get(): any`¶

Returns: any

Code

function(){return Nt.MismatchedTokenException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NotAllInputParsedException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NotAllInputParsedException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NoViableAltException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NoViableAltException}

`get(): any`¶

Returns: any

Code

function(){return Su.defaultLexerErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Su.defaultLexerErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternation}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternation}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternative}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternative}

`get(): any`¶

Returns: any

Code

function(){return Se.NonTerminal}

`get(): any`¶

Returns: any

Code

function(){return Se.NonTerminal}

`get(): any`¶

Returns: any

Code

function(){return Se.Option}

`get(): any`¶

Returns: any

Code

function(){return Se.Option}

`get(): any`¶

Returns: any

Code

function(){return Se.Repetition}

`get(): any`¶

Returns: any

Code

function(){return Se.Repetition}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatory}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatory}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatoryWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatoryWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.Rule}

`get(): any`¶

Returns: any

Code

function(){return Se.Rule}

`get(): any`¶

Returns: any

Code

function(){return Se.Terminal}

`get(): any`¶

Returns: any

Code

function(){return Se.Terminal}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeGrammar}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeGrammar}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeProduction}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeProduction}

`get(): any`¶

Returns: any

Code

function(){return xu.GAstVisitor}

`get(): any`¶

Returns: any

Code

function(){return xu.GAstVisitor}

`Cu(): void`¶

Returns: void

Calls:

console.warn

Code

function Cu(){console.warn(`The clearCache function was 'soft' removed from the Chevrotain API.
     It performs no action other than printing this message.
     Please avoid using it as it will be completely removed in the future`)}

`get(): any`¶

Returns: any

Code

function(){return Lu.createSyntaxDiagramsCode}

`get(): any`¶

Returns: any

Code

function(){return Lu.createSyntaxDiagramsCode}

`t(): void`¶

Returns: void

Code

function t(){throw new Error(`The Parser class has been deprecated, use CstParser or EmbeddedActionsParser instead.
See: https://chevrotain.io/docs/changes/BREAKING_CHANGES.html#_7-0-0`)}

`get(): any`¶

Returns: any

Code

function(){return ku.VERSION}

`get(): any`¶

Returns: any

Code

function(){return ku.VERSION}

`get(): any`¶

Returns: any

Code

function(){return lr.CstParser}

`get(): any`¶

Returns: any

Code

function(){return lr.CstParser}

`get(): any`¶

Returns: any

Code

function(){return lr.EmbeddedActionsParser}

`get(): any`¶

Returns: any

Code

function(){return lr.EmbeddedActionsParser}

`get(): any`¶

Returns: any

Code

function(){return lr.ParserDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return lr.ParserDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return lr.EMPTY_ALT}

`get(): any`¶

Returns: any

Code

function(){return lr.EMPTY_ALT}

`get(): any`¶

Returns: any

Code

function(){return Ma.Lexer}

`get(): any`¶

Returns: any

Code

function(){return Ma.Lexer}

`get(): any`¶

Returns: any

Code

function(){return Ma.LexerDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return Ma.LexerDefinitionErrorType}

`get(): any`¶

Returns: any

Code

function(){return nt.createToken}

`get(): any`¶

Returns: any

Code

function(){return nt.createToken}

`get(): any`¶

Returns: any

Code

function(){return nt.createTokenInstance}

`get(): any`¶

Returns: any

Code

function(){return nt.createTokenInstance}

`get(): any`¶

Returns: any

Code

function(){return nt.EOF}

`get(): any`¶

Returns: any

Code

function(){return nt.EOF}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenLabel}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenLabel}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenMatcher}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenMatcher}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenName}

`get(): any`¶

Returns: any

Code

function(){return nt.tokenName}

`get(): any`¶

Returns: any

Code

function(){return Pu.defaultParserErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Pu.defaultParserErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Nt.EarlyExitException}

`get(): any`¶

Returns: any

Code

function(){return Nt.EarlyExitException}

`get(): any`¶

Returns: any

Code

function(){return Nt.isRecognitionException}

`get(): any`¶

Returns: any

Code

function(){return Nt.isRecognitionException}

`get(): any`¶

Returns: any

Code

function(){return Nt.MismatchedTokenException}

`get(): any`¶

Returns: any

Code

function(){return Nt.MismatchedTokenException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NotAllInputParsedException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NotAllInputParsedException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NoViableAltException}

`get(): any`¶

Returns: any

Code

function(){return Nt.NoViableAltException}

`get(): any`¶

Returns: any

Code

function(){return Su.defaultLexerErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Su.defaultLexerErrorProvider}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternation}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternation}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternative}

`get(): any`¶

Returns: any

Code

function(){return Se.Alternative}

`get(): any`¶

Returns: any

Code

function(){return Se.NonTerminal}

`get(): any`¶

Returns: any

Code

function(){return Se.NonTerminal}

`get(): any`¶

Returns: any

Code

function(){return Se.Option}

`get(): any`¶

Returns: any

Code

function(){return Se.Option}

`get(): any`¶

Returns: any

Code

function(){return Se.Repetition}

`get(): any`¶

Returns: any

Code

function(){return Se.Repetition}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatory}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatory}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatoryWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionMandatoryWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.RepetitionWithSeparator}

`get(): any`¶

Returns: any

Code

function(){return Se.Rule}

`get(): any`¶

Returns: any

Code

function(){return Se.Rule}

`get(): any`¶

Returns: any

Code

function(){return Se.Terminal}

`get(): any`¶

Returns: any

Code

function(){return Se.Terminal}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeGrammar}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeGrammar}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeProduction}

`get(): any`¶

Returns: any

Code

function(){return ba.serializeProduction}

`get(): any`¶

Returns: any

Code

function(){return xu.GAstVisitor}

`get(): any`¶

Returns: any

Code

function(){return xu.GAstVisitor}

`get(): any`¶

Returns: any

Code

function(){return Lu.createSyntaxDiagramsCode}

`get(): any`¶

Returns: any

Code

function(){return Lu.createSyntaxDiagramsCode}

📄 chevrotain.module.min.js¶

📊 Analysis Summary¶

📚 Table of Contents¶

🛠️ File Location:¶

Variables & Constants¶

Functions¶

R(t: any, e: any): () => any¶

isEmpty(t: any): boolean¶

keys(t: any): string[]¶

values(t: any): any[]¶

mapValues(t: any, e: any): any[]¶

map(t: any, e: any): any[]¶

flatten(t: any): any¶

first(t: any): any¶

last(t: any): any¶

forEach(t: any, e: any): void¶

isString(t: any): boolean¶

isUndefined(t: any): boolean¶

isFunction(t: any): boolean¶

drop(t: any, e: any): any¶

dropRight(t: any, e: any): any¶

filter(t: any, e: any): any[]¶

reject(t: any, e: any): any[]¶

pick(t: any, e: any): {}¶

has(t: any, e: any): any¶

contains(t: any, e: any): boolean¶

cloneArr(t: any): any[]¶

cloneObj(t: any): {}¶

find(t: any, e: any): any¶

findAll(t: any, e: any): any[]¶

reduce(t: any, e: any, r: any): any¶

compact(t: any): any[]¶

uniq(t: any, e: any): any¶

partial(t: any): any¶

isArray(t: any): boolean¶

isRegExp(t: any): boolean¶

isObject(t: any): boolean¶

every(t: any, e: any): boolean¶

difference(t: any, e: any): any[]¶

some(t: any, e: any): boolean¶

indexOf(t: any, e: any): number¶

sortBy(t: any, e: any): any[]¶

zipObject(t: any, e: any): {}¶

assign(t: any): any¶

assignNoOverwrite(t: any): any¶

defaults(): any¶

groupBy(t: any, e: any): {}¶

merge(t: any, e: any): {}¶

NOOP(): void¶

IDENTITY(t: any): any¶

packArray(t: any): any[]¶

PRINT_ERROR(t: any): void¶

PRINT_WARNING(t: any): void¶

isES2015MapSupported(): boolean¶

peek(t: any): any¶

timer(t: any): { time: number; value: any; }¶

toFastProperties(toBecomeFast: any): any¶

FakeConstructor(): void¶

fakeAccess(): "string" | "number" | "bigint" | "boolean" | "symbol" | "undefined" | "object" | "function"¶

t(): void¶

i(u: any): any¶

a(u: any, d: any): void¶

o(u: any, d: any): void¶

s(u: any): void¶

c(): void¶

v(): void¶

Ba(t: any): any¶

qa(): void¶

t(e: any, r: any): any¶

n(): void¶

Va(t: any, e: any): any¶

Mt(t: any, e: any, r: any): any¶

bt(t: any, e: any, r: any): void¶

Ka(t: any, e: any): void¶

fn(t: any, e: any): any¶

yr(t: any): any¶

e(r: any): any¶

Ha(t: any, e: any): boolean¶

t(e: any, r: any): any¶

n(): void¶

📄 `chevrotain.module.min.js`¶

`R(t: any, e: any): () => any`¶

`isEmpty(t: any): boolean`¶

`keys(t: any): string[]`¶

`values(t: any): any[]`¶

`mapValues(t: any, e: any): any[]`¶

`map(t: any, e: any): any[]`¶

`flatten(t: any): any`¶

`first(t: any): any`¶

`last(t: any): any`¶

`forEach(t: any, e: any): void`¶

`isString(t: any): boolean`¶

`isUndefined(t: any): boolean`¶

`isFunction(t: any): boolean`¶

`drop(t: any, e: any): any`¶

`dropRight(t: any, e: any): any`¶

`filter(t: any, e: any): any[]`¶

`reject(t: any, e: any): any[]`¶

`pick(t: any, e: any): {}`¶

`has(t: any, e: any): any`¶

`contains(t: any, e: any): boolean`¶

`cloneArr(t: any): any[]`¶

`cloneObj(t: any): {}`¶

`find(t: any, e: any): any`¶

`findAll(t: any, e: any): any[]`¶

`reduce(t: any, e: any, r: any): any`¶

`compact(t: any): any[]`¶

`uniq(t: any, e: any): any`¶

`partial(t: any): any`¶

`isArray(t: any): boolean`¶

`isRegExp(t: any): boolean`¶

`isObject(t: any): boolean`¶

`every(t: any, e: any): boolean`¶

`difference(t: any, e: any): any[]`¶

`some(t: any, e: any): boolean`¶

`indexOf(t: any, e: any): number`¶

`sortBy(t: any, e: any): any[]`¶

`zipObject(t: any, e: any): {}`¶

`assign(t: any): any`¶

`assignNoOverwrite(t: any): any`¶

`defaults(): any`¶

`groupBy(t: any, e: any): {}`¶

`merge(t: any, e: any): {}`¶

`NOOP(): void`¶

`IDENTITY(t: any): any`¶

`packArray(t: any): any[]`¶

`PRINT_ERROR(t: any): void`¶

`PRINT_WARNING(t: any): void`¶

`isES2015MapSupported(): boolean`¶

`peek(t: any): any`¶

`timer(t: any): { time: number; value: any; }`¶

`toFastProperties(toBecomeFast: any): any`¶

`FakeConstructor(): void`¶

`fakeAccess(): "string" | "number" | "bigint" | "boolean" | "symbol" | "undefined" | "object" | "function"`¶

`t(): void`¶

`i(u: any): any`¶

`a(u: any, d: any): void`¶

`o(u: any, d: any): void`¶

`s(u: any): void`¶

`c(): void`¶

`v(): void`¶

`Ba(t: any): any`¶

`qa(): void`¶

`t(e: any, r: any): any`¶

`n(): void`¶

`Va(t: any, e: any): any`¶

`Mt(t: any, e: any, r: any): any`¶

`bt(t: any, e: any, r: any): void`¶

`Ka(t: any, e: any): void`¶

`fn(t: any, e: any): any`¶

`yr(t: any): any`¶

`e(r: any): any`¶

`Ha(t: any, e: any): boolean`¶

`t(e: any, r: any): any`¶

`n(): void`¶

`Ya(): void`¶

`Xa(): void`¶

`Za(t: any, e: any): { emptyGroups: undefined; patternIdxToConfig: undefined; charCodeToPatternIdxToConfig: any[]; hasCustom: boolean; canBeOptimized: boolean; }`¶

`tracer(g: any, y: any): any`¶

`tracer(g: any, y: any): any`¶