@uml Used for runtime deserialization of ATNs from strings
@uml 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.
@uml 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.
@uml 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.
@uml 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...
@uml The type of the ATN.
@uml For lexer ATNs, this is an array of {@link LexerAction} objects which may be referenced by action transitions in the ATN.
@uml The maximum value for any symbol recognized by a transition in the ATN.
@uml Maps from rule index to starting state number.
@uml Maps from rule index to stop state number.
@uml 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}.
Class implementation adapted from Java code