@cparra/apex-reflection 0.1.0-alpha.0 → 0.1.1-alpha.10

package/antlr4-4.9.2/lib/src/atn/src/transition.dart

@@ -1,305 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-import '../../interval_set.dart';
-import '../../token.dart';
-import 'atn_state.dart';
-import 'semantic_context.dart';
-
-enum TransitionType {
-  INVALID, // 0 is not used
-  EPSILON,
-  RANGE,
-  RULE,
-  PREDICATE, // e.g., {isType(input.LT(1))}?
-  ATOM,
-  ACTION,
-  SET, // ~(A|B) or ~atom, wildcard, which convert to next 2
-  NOT_SET,
-  WILDCARD,
-  PRECEDENCE,
-}
-
-/// An ATN transition between any two ATN states.  Subclasses define
-///  atom, set, epsilon, action, predicate, rule transitions.
-///
-///  <p>This is a one way link.  It emanates from a state (usually via a list of
-///  transitions) and has a target state.</p>
-///
-///  <p>Since we never have to change the ATN transitions once we construct it,
-///  we can fix these transitions as specific classes. The DFA transitions
-///  on the other hand need to update the labels as it adds transitions to
-///  the states. We'll use the term Edge for the DFA to distinguish them from
-///  ATN transitions.</p>
-abstract class Transition {
-  /// The target of this transition. */
-  ATNState target;
-
-  Transition(this.target) {
-    if (target == null) {
-      throw ArgumentError.notNull('target cannot be null.');
-    }
-  }
-
-  TransitionType get type;
-
-  /// Determines if the transition is an "epsilon" transition.
-  ///
-  /// <p>The default implementation returns [false].</p>
-  ///
-  /// @return [true] if traversing this transition in the ATN does not
-  /// consume an input symbol; otherwise, [false] if traversing this
-  /// transition consumes (matches) an input symbol.
-  bool get isEpsilon => false;
-
-  IntervalSet get label => null;
-
-  bool matches(int symbol, int minVocabSymbol, int maxVocabSymbol);
-}
-
-class EpsilonTransition extends Transition {
-  /// @return the rule index of a precedence rule for which this transition is
-  /// returning from, where the precedence value is 0; otherwise, -1.
-  ///
-  /// @see ATNConfig#isPrecedenceFilterSuppressed()
-  /// @see ParserATNSimulator#applyPrecedenceFilter(ATNConfigSet)
-  /// @since 4.4.1
-  final int outermostPrecedenceReturn;
-
-  EpsilonTransition(ATNState target, [this.outermostPrecedenceReturn = -1])
-      : super(target);
-
-  @override
-  bool get isEpsilon => true;
-
-  @override
-  bool matches(int symbol, int minVocabSymbol, int maxVocabSymbol) {
-    return false;
-  }
-
-  @override
-  String toString() {
-    return 'epsilon';
-  }
-
-  @override
-  TransitionType get type => TransitionType.EPSILON;
-}
-
-class RangeTransition extends Transition {
-  final int from;
-  final int to;
-
-  RangeTransition(ATNState target, this.from, this.to) : super(target);
-
-  @override
-  IntervalSet get label {
-    return IntervalSet.ofRange(from, to);
-  }
-
-  @override
-  bool matches(int symbol, int minVocabSymbol, int maxVocabSymbol) {
-    return symbol >= from && symbol <= to;
-  }
-
-  @override
-  String toString() {
-    return "'$from..$to'";
-  }
-
-  @override
-  TransitionType get type => TransitionType.RANGE;
-}
-
-class RuleTransition extends Transition {
-  /// Ptr to the rule definition object for this rule ref */
-  final int ruleIndex; // no Rule object at runtime
-
-  final int precedence;
-
-  /// What node to begin computations following ref to rule */
-  ATNState followState;
-
-  RuleTransition(RuleStartState ruleStart, this.ruleIndex, this.precedence,
-      this.followState)
-      : super(ruleStart);
-
-  @override
-  bool get isEpsilon => true;
-
-  @override
-  bool matches(int symbol, int minVocabSymbol, int maxVocabSymbol) {
-    return false;
-  }
-
-  @override
-  TransitionType get type => TransitionType.RULE;
-}
-
-abstract class AbstractPredicateTransition extends Transition {
-  AbstractPredicateTransition(ATNState target) : super(target);
-}
-
-class PredicateTransition extends AbstractPredicateTransition {
-  final int ruleIndex;
-  final int predIndex;
-  final bool isCtxDependent; // e.g., $i ref in pred
-
-  PredicateTransition(
-      target, this.ruleIndex, this.predIndex, this.isCtxDependent)
-      : super(target);
-
-  @override
-  bool get isEpsilon => true;
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) {
-    return false;
-  }
-
-  Predicate get predicate => Predicate(ruleIndex, predIndex, isCtxDependent);
-
-
-  @override
-  String toString() {
-    return 'pred_$ruleIndex:$predIndex';
-  }
-
-  @override
-  TransitionType get type => TransitionType.PREDICATE;
-}
-
-/// TODO: make all transitions sets? no, should remove set edges */
-class AtomTransition extends Transition {
-  /// The token type or character value; or, signifies special label. */
-  final int atomLabel;
-
-  AtomTransition(ATNState target, this.atomLabel) : super(target);
-
-  @override
-  IntervalSet get label {
-    return IntervalSet.ofOne(atomLabel);
-  }
-
-  @override
-  bool matches(int symbol, int minVocabSymbol, int maxVocabSymbol) {
-    return atomLabel == symbol;
-  }
-
-  @override
-  String toString() {
-    return label.toString();
-  }
-
-  @override
-  TransitionType get type => TransitionType.ATOM;
-}
-
-class ActionTransition extends Transition {
-  final int ruleIndex;
-  final int actionIndex;
-  final bool isCtxDependent; // e.g., $i ref in pred
-
-  ActionTransition(target, this.ruleIndex,
-      [this.actionIndex = -1, this.isCtxDependent = false])
-      : super(target);
-
-  @override
-  bool get isEpsilon =>
-      true; // we are to be ignored by analysis 'cept for predicates
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) => false;
-
-  @override
-  String toString() {
-    return 'action_$ruleIndex:$actionIndex';
-  }
-
-  @override
-  TransitionType get type => TransitionType.ACTION;
-}
-
-// A transition containing a set of values.
-class SetTransition extends Transition {
-  @override
-  IntervalSet label;
-
-  SetTransition(ATNState target, [IntervalSet st]) : super(target) {
-    label = st ?? IntervalSet.ofOne(Token.INVALID_TYPE);
-  }
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) {
-    return label.contains(symbol);
-  }
-
-  @override
-  String toString() {
-    return label.toString();
-  }
-
-  @override
-  TransitionType get type => TransitionType.SET;
-}
-
-class NotSetTransition extends SetTransition {
-  NotSetTransition(target, st) : super(target, st);
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) {
-    return symbol >= minVocabSymbol &&
-        symbol <= maxVocabSymbol &&
-        !super.matches(symbol, minVocabSymbol, maxVocabSymbol);
-  }
-
-  @override
-  String toString() {
-    return '~' + super.toString();
-  }
-
-  @override
-  TransitionType get type => TransitionType.NOT_SET;
-}
-
-class WildcardTransition extends Transition {
-  WildcardTransition(target) : super(target);
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) {
-    return symbol >= minVocabSymbol && symbol <= maxVocabSymbol;
-  }
-
-  @override
-  String toString() {
-    return '.';
-  }
-
-  @override
-  TransitionType get type => TransitionType.WILDCARD;
-}
-
-class PrecedencePredicateTransition extends AbstractPredicateTransition {
-  final int precedence;
-
-  PrecedencePredicateTransition(target, this.precedence) : super(target);
-
-  @override
-  bool get isEpsilon => true;
-
-  @override
-  bool matches(symbol, minVocabSymbol, maxVocabSymbol) => false;
-
-  PrecedencePredicate get predicate {
-    return PrecedencePredicate(precedence);
-  }
-
-  @override
-  String toString() => '$precedence >= _p';
-
-  @override
-  TransitionType get type => TransitionType.PRECEDENCE;
-}

package/antlr4-4.9.2/lib/src/dfa/dfa.dart

@@ -1,8 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-export 'src/dfa.dart';
-export 'src/dfa_state.dart';

package/antlr4-4.9.2/lib/src/dfa/src/dfa.dart

@@ -1,138 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-import '../../vocabulary.dart';
-import '../../atn/atn.dart';
-import 'dfa_serializer.dart';
-import 'dfa_state.dart';
-
-class DFA {
-  /// A set of all DFA states. Use [Map] so we can get old state back
-  ///  ([Set] only allows you to see if it's there).
-
-  Map<DFAState, DFAState> states = {};
-
-  DFAState s0;
-
-  final int decision;
-
-  /// From which ATN state did we create this DFA? */
-
-  DecisionState atnStartState;
-
-  /// [true] if this DFA is for a precedence decision; otherwise,
-  /// [false]. This is the backing field for {@link #isPrecedenceDfa}.
-  bool precedenceDfa;
-
-  DFA(this.atnStartState, [this.decision]) {
-    var precedenceDfa = false;
-    if (atnStartState is StarLoopEntryState) {
-      if ((atnStartState as StarLoopEntryState).isPrecedenceDecision) {
-        precedenceDfa = true;
-        final precedenceState = DFAState(configs: ATNConfigSet());
-        precedenceState.edges = [];
-        precedenceState.isAcceptState = false;
-        precedenceState.requiresFullContext = false;
-        s0 = precedenceState;
-      }
-    }
-
-    this.precedenceDfa = precedenceDfa;
-  }
-
-  /// Gets whether this DFA is a precedence DFA. Precedence DFAs use a special
-  /// start state {@link #s0} which is not stored in {@link #states}. The
-  /// {@link DFAState#edges} array for this start state contains outgoing edges
-  /// supplying individual start states corresponding to specific precedence
-  /// values.
-  ///
-  /// @return [true] if this is a precedence DFA; otherwise,
-  /// [false].
-  /// @see Parser#getPrecedence()
-  bool isPrecedenceDfa() {
-    return precedenceDfa;
-  }
-
-  /// Get the start state for a specific precedence value.
-  ///
-  /// @param precedence The current precedence.
-  /// @return The start state corresponding to the specified precedence, or
-  /// null if no start state exists for the specified precedence.
-  ///
-  /// @throws IllegalStateException if this is not a precedence DFA.
-  /// @see #isPrecedenceDfa()
-  DFAState getPrecedenceStartState(int precedence) {
-    if (!isPrecedenceDfa()) {
-      throw StateError(
-          'Only precedence DFAs may contain a precedence start state.');
-    }
-
-    // s0.edges is never null for a precedence DFA
-    if (precedence < 0 || precedence >= s0.edges.length) {
-      return null;
-    }
-
-    return s0.edges[precedence];
-  }
-
-  /// Set the start state for a specific precedence value.
-  ///
-  /// @param precedence The current precedence.
-  /// @param startState The start state corresponding to the specified
-  /// precedence.
-  ///
-  /// @throws IllegalStateException if this is not a precedence DFA.
-  /// @see #isPrecedenceDfa()
-  void setPrecedenceStartState(int precedence, DFAState startState) {
-    if (!isPrecedenceDfa()) {
-      throw StateError(
-          'Only precedence DFAs may contain a precedence start state.');
-    }
-
-    if (precedence < 0) {
-      return;
-    }
-
-    // synchronization on s0 here is ok. when the DFA is turned into a
-    // precedence DFA, s0 will be initialized once and not updated again
-    // s0.edges is never null for a precedence DFA
-    if (precedence >= s0.edges.length) {
-      final original = s0.edges;
-      s0.edges = List(precedence + 1);
-      List.copyRange(s0.edges, 0, original);
-    }
-
-    s0.edges[precedence] = startState;
-  }
-
-  /// Return a list of all states in this DFA, ordered by state number.
-
-  List<DFAState> getStates() {
-    final result = states.keys.toList();
-    result.sort((DFAState o1, DFAState o2) {
-      return o1.stateNumber - o2.stateNumber;
-    });
-
-    return result;
-  }
-
-  @override
-  String toString([Vocabulary vocabulary]) {
-    vocabulary = vocabulary ?? VocabularyImpl.EMPTY_VOCABULARY;
-    if (s0 == null) {
-      return '';
-    }
-
-    final serializer = DFASerializer(this, vocabulary);
-    return serializer.toString();
-  }
-
-  String toLexerString() {
-    if (s0 == null) return '';
-    DFASerializer serializer = LexerDFASerializer(this);
-    return serializer.toString();
-  }
-}

package/antlr4-4.9.2/lib/src/dfa/src/dfa_serializer.dart

@@ -1,76 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-import '../../util/utils.dart';
-import '../../vocabulary.dart';
-import 'dfa.dart';
-import 'dfa_state.dart';
-
-/// A DFA walker that knows how to dump them to serialized strings. */
-class DFASerializer {
-  final DFA dfa;
-
-  final Vocabulary vocabulary;
-
-  DFASerializer(this.dfa, this.vocabulary);
-
-  @override
-  String toString() {
-    if (dfa.s0 == null) return null;
-    final buf = StringBuffer();
-    final states = dfa.getStates();
-    for (var s in states) {
-      var n = 0;
-      if (s.edges != null) n = s.edges.length;
-      for (var i = 0; i < n; i++) {
-        final t = s.edges[i];
-        if (t != null && t.stateNumber != 0x7FFFFFFF) {
-          buf.write(getStateString(s));
-          final label = getEdgeLabel(i);
-          buf.write('-');
-          buf.write(label);
-          buf.write('->');
-          buf.write(getStateString(t));
-          buf.write('\n');
-        }
-      }
-    }
-
-    final output = buf.toString();
-    if (output.isEmpty) return null;
-    //return Utils.sortLinesInString(output);
-    return output;
-  }
-
-  String getEdgeLabel(int i) {
-    return vocabulary.getDisplayName(i - 1);
-  }
-
-  String getStateString(DFAState s) {
-    final n = s.stateNumber;
-    final baseStateStr = (s.isAcceptState ? ':' : '') +
-        's$n' +
-        (s.requiresFullContext ? '^' : '');
-    if (s.isAcceptState) {
-      if (s.predicates != null) {
-        return baseStateStr + '=>${arrayToString(s.predicates)}';
-      } else {
-        return baseStateStr + '=>${s.prediction}';
-      }
-    } else {
-      return baseStateStr;
-    }
-  }
-}
-
-class LexerDFASerializer extends DFASerializer {
-  LexerDFASerializer(dfa) : super(dfa, VocabularyImpl.EMPTY_VOCABULARY);
-
-  @override
-  String getEdgeLabel(i) {
-    return "'" + String.fromCharCode(i) + "'";
-  }
-}

package/antlr4-4.9.2/lib/src/dfa/src/dfa_state.dart

@@ -1,151 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-import '../../atn/atn.dart';
-import '../../util/murmur_hash.dart';
-import '../../util/utils.dart';
-
-/// Map a predicate to a predicted alternative. */
-class PredPrediction {
-  final alt;
-  final pred;
-
-  PredPrediction(this.pred, this.alt);
-
-  @override
-  String toString() {
-    return '($pred, $alt)';
-  }
-}
-
-/// A DFA state represents a set of possible ATN configurations.
-///  As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
-///  to keep track of all possible states the ATN can be in after
-///  reading each input symbol.  That is to say, after reading
-///  input a1a2..an, the DFA is in a state that represents the
-///  subset T of the states of the ATN that are reachable from the
-///  ATN's start state along some path labeled a1a2..an."
-///  In conventional NFA→DFA conversion, therefore, the subset T
-///  would be a bitset representing the set of states the
-///  ATN could be in.  We need to track the alt predicted by each
-///  state as well, however.  More importantly, we need to maintain
-///  a stack of states, tracking the closure operations as they
-///  jump from rule to rule, emulating rule invocations (method calls).
-///  I have to add a stack to simulate the proper lookahead sequences for
-///  the underlying LL grammar from which the ATN was derived.
-///
-///  <p>I use a set of ATNConfig objects not simple states.  An ATNConfig
-///  is both a state (ala normal conversion) and a RuleContext describing
-///  the chain of rules (if any) followed to arrive at that state.</p>
-///
-///  <p>A DFA state may have multiple references to a particular state,
-///  but with different ATN contexts (with same or different alts)
-///  meaning that state was reached via a different set of rule invocations.</p>
-class DFAState {
-  int stateNumber = -1;
-
-  ATNConfigSet configs = ATNConfigSet();
-
-  /// {@code edges[symbol]} points to target of symbol. Shift up by 1 so (-1)
-  ///  {@link Token#EOF} maps to {@code edges[0]}.
-
-  List<DFAState> edges;
-
-  bool isAcceptState = false;
-
-  /// if accept state, what ttype do we match or alt do we predict?
-  ///  This is set to {@link ATN#INVALID_ALT_NUMBER} when {@link #predicates}{@code !=null} or
-  ///  {@link #requiresFullContext}.
-  int prediction = 0;
-
-  LexerActionExecutor lexerActionExecutor;
-
-  /// Indicates that this state was created during SLL prediction that
-  /// discovered a conflict between the configurations in the state. Future
-  /// {@link ParserATNSimulator#execATN} invocations immediately jumped doing
-  /// full context prediction if this field is true.
-  bool requiresFullContext = false;
-
-  /// During SLL parsing, this is a list of predicates associated with the
-  ///  ATN configurations of the DFA state. When we have predicates,
-  ///  {@link #requiresFullContext} is [false] since full context prediction evaluates predicates
-  ///  on-the-fly. If this is not null, then {@link #prediction} is
-  ///  {@link ATN#INVALID_ALT_NUMBER}.
-  ///
-  ///  <p>We only use these for non-{@link #requiresFullContext} but conflicting states. That
-  ///  means we know from the context (it's $ or we don't dip into outer
-  ///  context) that it's an ambiguity not a conflict.</p>
-  ///
-  ///  <p>This list is computed by {@link ParserATNSimulator#predicateDFAState}.</p>
-
-  List<PredPrediction> predicates;
-
-  DFAState({this.stateNumber, this.configs});
-
-  /// Get the set of all alts mentioned by all ATN configurations in this
-  ///  DFA state.
-  Set<int> get altSet {
-    final alts = <int>{};
-    if (configs != null) {
-      for (var c in configs) {
-        alts.add(c.alt);
-      }
-    }
-    if (alts.isEmpty) return null;
-    return alts;
-  }
-
-  @override
-  int get hashCode {
-    var hash = MurmurHash.initialize(7);
-    hash = MurmurHash.update(hash, configs.hashCode);
-    hash = MurmurHash.finish(hash, 1);
-    return hash;
-  }
-
-  /// Two [DFAState] instances are equal if their ATN configuration sets
-  /// are the same. This method is used to see if a state already exists.
-  ///
-  /// <p>Because the number of alternatives and number of ATN configurations are
-  /// finite, there is a finite number of DFA states that can be processed.
-  /// This is necessary to show that the algorithm terminates.</p>
-  ///
-  /// <p>Cannot test the DFA state numbers here because in
-  /// {@link ParserATNSimulator#addDFAState} we need to know if any other state
-  /// exists that has this exact set of ATN configurations. The
-  /// {@link #stateNumber} is irrelevant.</p>
-
-  @override
-  bool operator ==(Object o) {
-    // compare set of ATN configurations in this set with other
-    if (identical(this, o)) return true;
-
-    if (!(o is DFAState)) {
-      return false;
-    }
-
-    DFAState other = o;
-    // TODO (sam): what to do when configs==null?
-    final sameSet = configs == other.configs;
-//		System.out.println("DFAState.equals: "+configs+(sameSet?"==":"!=")+other.configs);
-    return sameSet;
-  }
-
-  @override
-  String toString() {
-    final buf = StringBuffer();
-    buf.write('$stateNumber:$configs');
-    if (isAcceptState) {
-      buf.write('=>');
-      if (predicates != null) {
-        buf.write(arrayToString(predicates));
-      } else {
-        buf.write(prediction);
-      }
-    }
-    return buf.toString();
-  }
-}

package/antlr4-4.9.2/lib/src/error/error.dart

@@ -1,10 +0,0 @@
-/*
- * Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
- * Use of this file is governed by the BSD 3-clause license that
- * can be found in the LICENSE.txt file in the project root.
- */
-
-export 'src/diagnostic_error_listener.dart';
-export 'src/error_listener.dart';
-export 'src/error_strategy.dart';
-export 'src/errors.dart';