use jsdoc and const/let
This commit is contained in:
parent
e7b935e7e2
commit
15720d1e33
|
@ -3,51 +3,62 @@
|
|||
* can be found in the LICENSE.txt file in the project root.
|
||||
*/
|
||||
|
||||
var LL1Analyzer = require('./../LL1Analyzer').LL1Analyzer;
|
||||
var IntervalSet = require('./../IntervalSet').IntervalSet;
|
||||
const LL1Analyzer = require('./../LL1Analyzer').LL1Analyzer;
|
||||
const IntervalSet = require('./../IntervalSet').IntervalSet;
|
||||
|
||||
class ATN {
|
||||
constructor(grammarType , maxTokenType) {
|
||||
|
||||
// Used for runtime deserialization of ATNs from strings///
|
||||
// The type of the ATN.
|
||||
/**
|
||||
* Used for runtime deserialization of ATNs from strings
|
||||
* The type of the ATN.
|
||||
*/
|
||||
this.grammarType = grammarType;
|
||||
// The maximum value for any symbol recognized by a transition in the ATN.
|
||||
this.maxTokenType = maxTokenType;
|
||||
this.states = [];
|
||||
// Each subrule/rule is a decision point and we must track them so we
|
||||
// can go back later and build DFA predictors for them. This includes
|
||||
// all the rules, subrules, optional blocks, ()+, ()* etc...
|
||||
/**
|
||||
* Each subrule/rule is a decision point and we must track them so we
|
||||
* can go back later and build DFA predictors for them. This includes
|
||||
* all the rules, subrules, optional blocks, ()+, ()* etc...
|
||||
*/
|
||||
this.decisionToState = [];
|
||||
// Maps from rule index to starting state number.
|
||||
this.ruleToStartState = [];
|
||||
// Maps from rule index to stop state number.
|
||||
this.ruleToStopState = null;
|
||||
this.modeNameToStartState = {};
|
||||
// For lexer ATNs, this maps the rule index to the resulting token type.
|
||||
// For parser ATNs, this maps the rule index to the generated bypass token
|
||||
// type if the
|
||||
// {@link ATNDeserializationOptions//isGenerateRuleBypassTransitions}
|
||||
// deserialization option was specified; otherwise, this is {@code null}.
|
||||
/**
|
||||
* For lexer ATNs, this maps the rule index to the resulting token type.
|
||||
* For parser ATNs, this maps the rule index to the generated bypass token
|
||||
* type if the {@link ATNDeserializationOptions//isGenerateRuleBypassTransitions}
|
||||
* deserialization option was specified; otherwise, this is {@code null}
|
||||
*/
|
||||
this.ruleToTokenType = null;
|
||||
// For lexer ATNs, this is an array of {@link LexerAction} objects which may
|
||||
// be referenced by action transitions in the ATN.
|
||||
/**
|
||||
* For lexer ATNs, this is an array of {@link LexerAction} objects which may
|
||||
* be referenced by action transitions in the ATN
|
||||
*/
|
||||
this.lexerActions = null;
|
||||
this.modeToStartState = [];
|
||||
}
|
||||
|
||||
// Compute the set of valid tokens that can occur starting in state {@code s}.
|
||||
// If {@code ctx} is null, the set of tokens will not include what can follow
|
||||
// the rule surrounding {@code s}. In other words, the set will be
|
||||
// restricted to tokens reachable staying within {@code s}'s rule.
|
||||
/**
|
||||
* Compute the set of valid tokens that can occur starting in state {@code s}.
|
||||
* If {@code ctx} is null, the set of tokens will not include what can follow
|
||||
* the rule surrounding {@code s}. In other words, the set will be
|
||||
* restricted to tokens reachable staying within {@code s}'s rule
|
||||
*/
|
||||
nextTokensInContext(s, ctx) {
|
||||
var anal = new LL1Analyzer(this);
|
||||
const anal = new LL1Analyzer(this);
|
||||
return anal.LOOK(s, null, ctx);
|
||||
}
|
||||
|
||||
// Compute the set of valid tokens that can occur starting in {@code s} and
|
||||
// staying in same rule. {@link Token//EPSILON} is in set if we reach end of
|
||||
// rule.
|
||||
/**
|
||||
* Compute the set of valid tokens that can occur starting in {@code s} and
|
||||
* staying in same rule. {@link Token//EPSILON} is in set if we reach end of
|
||||
* rule
|
||||
*/
|
||||
nextTokensNoContext(s) {
|
||||
if (s.nextTokenWithinRule !== null ) {
|
||||
return s.nextTokenWithinRule;
|
||||
|
@ -95,17 +106,17 @@ class ATN {
|
|||
if ( stateNumber < 0 || stateNumber >= this.states.length ) {
|
||||
throw("Invalid state number.");
|
||||
}
|
||||
var s = this.states[stateNumber];
|
||||
var following = this.nextTokens(s);
|
||||
const s = this.states[stateNumber];
|
||||
let following = this.nextTokens(s);
|
||||
if (!following.contains(Token.EPSILON)) {
|
||||
return following;
|
||||
}
|
||||
var expected = new IntervalSet();
|
||||
const expected = new IntervalSet();
|
||||
expected.addSet(following);
|
||||
expected.removeOne(Token.EPSILON);
|
||||
while (ctx !== null && ctx.invokingState >= 0 && following.contains(Token.EPSILON)) {
|
||||
var invokingState = this.states[ctx.invokingState];
|
||||
var rt = invokingState.transitions[0];
|
||||
const invokingState = this.states[ctx.invokingState];
|
||||
const rt = invokingState.transitions[0];
|
||||
following = this.nextTokens(rt.followState);
|
||||
expected.addSet(following);
|
||||
expected.removeOne(Token.EPSILON);
|
||||
|
@ -118,24 +129,26 @@ class ATN {
|
|||
}
|
||||
}
|
||||
|
||||
// Computes the set of input symbols which could follow ATN state number
|
||||
// {@code stateNumber} in the specified full {@code context}. This method
|
||||
// considers the complete parser context, but does not evaluate semantic
|
||||
// predicates (i.e. all predicates encountered during the calculation are
|
||||
// assumed true). If a path in the ATN exists from the starting state to the
|
||||
// {@link RuleStopState} of the outermost context without matching any
|
||||
// symbols, {@link Token//EOF} is added to the returned set.
|
||||
//
|
||||
// <p>If {@code context} is {@code null}, it is treated as
|
||||
// {@link ParserRuleContext//EMPTY}.</p>
|
||||
//
|
||||
// @param stateNumber the ATN state number
|
||||
// @param context the full parse context
|
||||
// @return The set of potentially valid input symbols which could follow the
|
||||
// specified state in the specified context.
|
||||
// @throws IllegalArgumentException if the ATN does not contain a state with
|
||||
// number {@code stateNumber}
|
||||
var Token = require('./../Token').Token;
|
||||
/**
|
||||
* Computes the set of input symbols which could follow ATN state number
|
||||
* {@code stateNumber} in the specified full {@code context}. This method
|
||||
* considers the complete parser context, but does not evaluate semantic
|
||||
* predicates (i.e. all predicates encountered during the calculation are
|
||||
* assumed true). If a path in the ATN exists from the starting state to the
|
||||
* {@link RuleStopState} of the outermost context without matching any
|
||||
* symbols, {@link Token//EOF} is added to the returned set.
|
||||
*
|
||||
* <p>If {@code context} is {@code null}, it is treated as
|
||||
* {@link ParserRuleContext//EMPTY}.</p>
|
||||
*
|
||||
* @param stateNumber the ATN state number
|
||||
* @param context the full parse context
|
||||
* @return The set of potentially valid input symbols which could follow the
|
||||
* specified state in the specified context.
|
||||
* @throws IllegalArgumentException if the ATN does not contain a state with
|
||||
* number {@code stateNumber}
|
||||
*/
|
||||
const Token = require('./../Token').Token;
|
||||
|
||||
ATN.INVALID_ALT_NUMBER = 0;
|
||||
|
||||
|
|
Loading…
Reference in New Issue