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

package/.idea/libraries/Dart_SDK.xml

@@ -1,28 +0,0 @@
-<component name="libraryTable">
-  <library name="Dart SDK">
-    <CLASSES>
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/async" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/cli" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/collection" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/convert" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/core" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/developer" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/ffi" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/html" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/indexed_db" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/io" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/isolate" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/js" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/js_util" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/math" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/mirrors" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/svg" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/typed_data" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/web_audio" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/web_gl" />
-      <root url="file://$PROJECT_DIR$/../../../../flutter/flutter/bin/cache/dart-sdk/lib/web_sql" />
-    </CLASSES>
-    <JAVADOC />
-    <SOURCES />
-  </library>
-</component>

package/.idea/misc.xml

@@ -1,6 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectRootManager">
-    <output url="file://$PROJECT_DIR$/out" />
-  </component>
-</project>

package/.idea/modules.xml

@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ProjectModuleManager">
-    <modules>
-      <module fileurl="file://$PROJECT_DIR$/.idea/apexdocs-dart.iml" filepath="$PROJECT_DIR$/.idea/apexdocs-dart.iml" />
-    </modules>
-  </component>
-</project>

package/.idea/runConfigurations/_template__of_Dart_Test.xml

@@ -1,6 +0,0 @@
-<component name="ProjectRunConfigurationManager">
-  <configuration default="true" type="DartTestRunConfigurationType" factoryName="Dart Test">
-    <option name="VMOptions" value="--no-sound-null-safety" />
-    <method v="2" />
-  </configuration>
-</component>

package/.idea/vcs.xml

@@ -1,6 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="VcsDirectoryMappings">
-    <mapping directory="" vcs="Git" />
-  </component>
-</project>

package/CHANGELOG.md

@@ -1,3 +0,0 @@
-## 1.0.0
-
-- Initial version.

package/README.md

@@ -1,26 +0,0 @@
-# Creating JS from Dart code:
-
-To generate the JS file from the Dart code:
-
-1. Run
-
-```
-dart2js lib/apexdocs_dart.dart -o js/out.js
-```
-
-2. Copy the `js/preamble.js` contents to the top of the `js/out.js` file
-3. Edit the `index.d.ts` files according to the changes to provide TS typings
-
-# Running Antlr4
-
-To generate the Antlr4 Apex output run:
-
-```
-antlr4 -Dlanguage=Dart lib/src/antlr/grammars/apex/ApexLexer.g4 lib/src/antlr/grammars/apex/ApexParser.g4 -o lib/src/antlr/lib/apex/
-```
-
-To generate the Antlr4 Apexdoc output run:
-
-```
-antlr4 -Dlanguage=Dart lib/src/antlr/grammars/apexdoc/ApexdocLexer.g4 lib/src/antlr/grammars/apexdoc/ApexdocParser.g4 -o lib/src/antlr/lib/apexdoc/
-```

package/TODO.md

@@ -1,5 +0,0 @@
-* generate JSON manifest
-* Create MDX style documentation, or using Vue if using docsify
-* Javadoc style inline references: https://stackoverflow.com/questions/5915992/how-to-reference-a-method-in-javadoc
-* Everything should be case insensitive, including references to classes, methods and such. That way something can be
-  declared uppercased somethere but lowercased somewhere else and the references still work.

package/analysis_options.yaml

@@ -1,30 +0,0 @@
-# This file configures the static analysis results for your project (errors,
-# warnings, and lints).
-#
-# This enables the 'recommended' set of lints from `package:lints`.
-# This set helps identify many issues that may lead to problems when running
-# or consuming Dart code, and enforces writing Dart using a single, idiomatic
-# style and format.
-#
-# If you want a smaller set of lints you can change this to specify
-# 'package:lints/core.yaml'. These are just the most critical lints
-# (the recommended set includes the core lints).
-# The core lints are also what is used by pub.dev for scoring packages.
-
-include: package:lints/recommended.yaml
-
-# Uncomment the following section to specify additional rules.
-
-# linter:
-#   rules:
-#     - camel_case_types
-
-# analyzer:
-#   exclude:
-#     - path/to/excluded/files/**
-
-# For more information about the core and recommended set of lints, see
-# https://dart.dev/go/core-lints
-
-# For additional information about configuring this file, see
-# https://dart.dev/guides/language/analysis-options

package/antlr4-4.9.2/CHANGELOG.md

@@ -1,4 +0,0 @@
-
-## 4.9.0
-
-* Initial release

package/antlr4-4.9.2/LICENSE

@@ -1,52 +0,0 @@
-[The "BSD 3-clause license"]
-Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. Neither the name of the copyright holder nor the names of its contributors
-    may be used to endorse or promote products derived from this software
-    without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
-IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
-IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
-NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-=====
-
-MIT License for codepointat.js from https://git.io/codepointat
-MIT License for fromcodepoint.js from https://git.io/vDW1m
-
-Copyright Mathias Bynens <https://mathiasbynens.be/>
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/antlr4-4.9.2/README.md

@@ -1,11 +0,0 @@
-# Dart target for ANTLR 4
-
-Dart runtime libraries for ANTLR 4
-
-This runtime is available through [pub](https://pub.dev). The package name is 'antlr4'.
-
-See www.antlr.org for more information on ANTLR.
-
-See https://github.com/antlr/antlr4/blob/master/doc/dart-target.md for more information on using ANTLR in Dart.
-
-

package/antlr4-4.9.2/analysis_options.yaml

@@ -1 +0,0 @@
-include: package:pedantic/analysis_options.yaml

package/antlr4-4.9.2/lib/antlr4.dart

@@ -1,21 +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.
- */
-
-library antlr4;
-
-export 'src/atn/atn.dart';
-export 'src/dfa/dfa.dart';
-export 'src/tree/tree.dart';
-export 'src/error/error.dart';
-export 'src/rule_context.dart';
-export 'src/input_stream.dart';
-export 'src/token_stream.dart';
-export 'src/lexer.dart';
-export 'src/parser.dart';
-export 'src/parser_rule_context.dart';
-export 'src/vocabulary.dart';
-export 'src/runtime_meta_data.dart';
-export 'src/token.dart';

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

@@ -1,18 +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/atn.dart';
-export 'src/atn_config.dart';
-export 'src/atn_config_set.dart';
-export 'src/atn_deserializer.dart';
-export 'src/atn_simulator.dart';
-export 'src/atn_state.dart';
-export 'src/info.dart';
-export 'src/lexer_action_executor.dart';
-export 'src/lexer_atn_simulator.dart';
-export 'src/parser_atn_simulator.dart';
-export 'src/profiling_atn_simulator.dart';
-export 'src/transition.dart';

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

@@ -1,170 +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 '../../ll1_analyzer.dart';
-import '../../rule_context.dart';
-import '../../token.dart';
-import 'atn_state.dart';
-import 'atn_type.dart';
-import 'lexer_action.dart';
-import 'transition.dart';
-
-class ATN {
-  static final INVALID_ALT_NUMBER = 0;
-
-  List<ATNState> 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...
-  List<DecisionState> decisionToState = [];
-
-  /// Maps from rule index to starting state number.
-  List<RuleStartState> ruleToStartState;
-
-  /// Maps from rule index to stop state number.
-  List<RuleStopState> ruleToStopState;
-
-  Map<String, TokensStartState> modeNameToStartState = {};
-
-  /// The type of the ATN.
-  final ATNType grammarType;
-
-  /// The maximum value for any symbol recognized by a transition in the ATN.
-  final int maxTokenType;
-
-  /// 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 null.
-  List<int> ruleToTokenType;
-
-  /// For lexer ATNs, this is an array of [LexerAction] objects which may
-  /// be referenced by action transitions in the ATN.
-  List<LexerAction> lexerActions;
-
-  List<TokensStartState> modeToStartState = [];
-
-  /// Used for runtime deserialization of ATNs from strings */
-  ATN(this.grammarType, this.maxTokenType);
-
-  /// TODO merge doc comment
-  /// Compute the set of valid tokens that can occur starting in state [s].
-  ///  If [ctx] is null, the set of tokens will not include what can follow
-  ///  the rule surrounding [s]. In other words, the set will be
-  ///  restricted to tokens reachable staying within [s]'s rule.
-  ///
-  ///  Compute the set of valid tokens that can occur starting in [s] and
-  ///  staying in same rule. {@link Token#EPSILON} is in set if we reach end of
-  ///  rule.
-  IntervalSet nextTokens(ATNState s, [RuleContext ctx]) {
-    if (ctx != null) {
-      return LL1Analyzer(this).LOOK(s, ctx);
-    }
-    if (s.nextTokenWithinRule != null) return s.nextTokenWithinRule;
-    s.nextTokenWithinRule = LL1Analyzer(this).LOOK(s, null);
-    s.nextTokenWithinRule.setReadonly(true);
-    return s.nextTokenWithinRule;
-  }
-
-  void addState(ATNState state) {
-    if (state != null) {
-      state.atn = this;
-      state.stateNumber = states.length;
-    }
-
-    states.add(state);
-  }
-
-  void removeState(ATNState state) {
-    states[state.stateNumber] =
-        null; // just free mem, don't shift states in list
-  }
-
-  int defineDecisionState(DecisionState s) {
-    decisionToState.add(s);
-    s.decision = decisionToState.length - 1;
-    return s.decision;
-  }
-
-  DecisionState getDecisionState(int decision) {
-    if (decisionToState.isNotEmpty) {
-      return decisionToState[decision];
-    }
-    return null;
-  }
-
-  int get numberOfDecisions {
-    return decisionToState.length;
-  }
-
-  /// Computes the set of input symbols which could follow ATN state number
-  /// [stateNumber] in the specified full [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
-  /// [RuleStopState] of the outermost context without matching any
-  /// symbols, {@link Token#EOF} is added to the returned set.
-  ///
-  /// <p>If [context] is null, it is treated as {@link ParserRuleContext#EMPTY}.</p>
-  ///
-  /// Note that this does NOT give you the set of all tokens that could
-  /// appear at a given token position in the input phrase.  In other words,
-  /// it does not answer:
-  ///
-  ///   "Given a specific partial input phrase, return the set of all tokens
-  ///    that can follow the last token in the input phrase."
-  ///
-  /// The big difference is that with just the input, the parser could
-  /// land right in the middle of a lookahead decision. Getting
-  /// all *possible* tokens given a partial input stream is a separate
-  /// computation. See https://github.com/antlr/antlr4/issues/1428
-  ///
-  /// For this function, we are specifying an ATN state and call stack to compute
-  /// what token(s) can come next and specifically: outside of a lookahead decision.
-  /// That is what you want for error reporting and recovery upon parse error.
-  ///
-  /// @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 [stateNumber]
-  IntervalSet getExpectedTokens(int stateNumber, RuleContext context) {
-    if (stateNumber < 0 || stateNumber >= states.length) {
-      throw RangeError.index(stateNumber, states, 'stateNumber');
-    }
-
-    var ctx = context;
-    final s = states[stateNumber];
-    var following = nextTokens(s);
-    if (!following.contains(Token.EPSILON)) {
-      return following;
-    }
-
-    final expected = IntervalSet();
-    expected.addAll(following);
-    expected.remove(Token.EPSILON);
-    while (ctx != null &&
-        ctx.invokingState >= 0 &&
-        following.contains(Token.EPSILON)) {
-      final invokingState = states[ctx.invokingState];
-      RuleTransition rt = invokingState.transition(0);
-      following = nextTokens(rt.followState);
-      expected.addAll(following);
-      expected.remove(Token.EPSILON);
-      ctx = ctx.parent;
-    }
-
-    if (following.contains(Token.EPSILON)) {
-      expected.addOne(Token.EOF);
-    }
-
-    return expected;
-  }
-}

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

@@ -1,242 +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 '../../prediction_context.dart';
-import '../../recognizer.dart';
-import '../../util/murmur_hash.dart';
-import 'atn_state.dart';
-import 'lexer_action_executor.dart';
-import 'semantic_context.dart';
-
-Map<String, dynamic> checkParams(params, isCfg) {
-  if (params == null) {
-    final result = <String, dynamic>{
-      'state': null,
-      'alt': null,
-      'context': null,
-      'semanticContext': null
-    };
-    if (isCfg) {
-      result['reachesIntoOuterContext'] = 0;
-    }
-    return result;
-  } else {
-    final props = <String, dynamic>{};
-    props['state'] = params.state;
-    props['alt'] = (params.alt == null) ? null : params.alt;
-    props['context'] = params.context;
-    props['semanticContext'] = params.semanticContext;
-    if (isCfg) {
-      props['reachesIntoOuterContext'] = params.reachesIntoOuterContext ?? 0;
-      props['precedenceFilterSuppressed'] =
-          params.precedenceFilterSuppressed ?? false;
-    }
-    return props;
-  }
-}
-
-/// A tuple: (ATN state, predicted alt, syntactic, semantic context).
-///  The syntactic context is a graph-structured stack node whose
-///  path(s) to the root is the rule invocation(s)
-///  chain used to arrive at the state.  The semantic context is
-///  the tree of semantic predicates encountered before reaching
-///  an ATN state.
-class ATNConfig {
-  /// This field stores the bit mask for implementing the
-  /// {@link #isPrecedenceFilterSuppressed} property as a bit within the
-  /// existing {@link #reachesIntoOuterContext} field.
-  static final int SUPPRESS_PRECEDENCE_FILTER = 0x40000000;
-
-  /// The ATN state associated with this configuration */
-  ATNState state;
-
-  /// What alt (or lexer rule) is predicted by this configuration */
-  int alt;
-
-  /// The stack of invoking states leading to the rule/states associated
-  ///  with this config.  We track only those contexts pushed during
-  ///  execution of the ATN simulator.
-  PredictionContext context;
-
-  /// We cannot execute predicates dependent upon local context unless
-  /// we know for sure we are in the correct context. Because there is
-  /// no way to do this efficiently, we simply cannot evaluate
-  /// dependent predicates unless we are in the rule that initially
-  /// invokes the ATN simulator.
-  ///
-  /// <p>
-  /// closure() tracks the depth of how far we dip into the outer context:
-  /// depth &gt; 0.  Note that it may not be totally accurate depth since I
-  /// don't ever decrement. TODO: make it a bool then</p>
-  ///
-  /// <p>
-  /// For memory efficiency, the {@link #isPrecedenceFilterSuppressed} method
-  /// is also backed by this field. Since the field is ly accessible, the
-  /// highest bit which would not cause the value to become negative is used to
-  /// store this field. This choice minimizes the risk that code which only
-  /// compares this value to 0 would be affected by the new purpose of the
-  /// flag. It also ensures the performance of the existing [ATNConfig]
-  /// constructors as well as certain operations like
-  /// {@link ATNConfigSet#add(ATNConfig, DoubleKeyMap)} method are
-  /// <em>completely</em> unaffected by the change.</p>
-  int reachesIntoOuterContext = 0;
-
-  SemanticContext semanticContext;
-
-  ATNConfig(this.state, this.alt, this.context,
-      [this.semanticContext = SemanticContext.NONE]);
-
-  ATNConfig.dup(ATNConfig c,
-      {this.state, this.alt, this.context, this.semanticContext}) {
-    state = state ?? c.state;
-    alt = alt ?? c.alt;
-    context = context ?? c.context;
-    semanticContext = semanticContext ?? c.semanticContext;
-    reachesIntoOuterContext =
-        c.reachesIntoOuterContext ?? reachesIntoOuterContext;
-  }
-
-  /// This method gets the value of the {@link #reachesIntoOuterContext} field
-  /// as it existed prior to the introduction of the
-  /// {@link #isPrecedenceFilterSuppressed} method.
-  int get outerContextDepth {
-    return reachesIntoOuterContext & ~SUPPRESS_PRECEDENCE_FILTER;
-  }
-
-  bool isPrecedenceFilterSuppressed() {
-    return (reachesIntoOuterContext & SUPPRESS_PRECEDENCE_FILTER) != 0;
-  }
-
-  void setPrecedenceFilterSuppressed(bool value) {
-    if (value) {
-      reachesIntoOuterContext |= 0x40000000;
-    } else {
-      reachesIntoOuterContext &= ~SUPPRESS_PRECEDENCE_FILTER;
-    }
-  }
-
-  /// An ATN configuration is equal to another if both have
-  ///  the same state, they predict the same alternative, and
-  ///  syntactic/semantic contexts are the same.
-  @override
-  bool operator ==(Object other) {
-    if (other is ATNConfig && other != null) {
-      return state.stateNumber == other.state.stateNumber &&
-          alt == other.alt &&
-          (context == other.context ||
-              (context != null && context == other.context)) &&
-          semanticContext == other.semanticContext &&
-          isPrecedenceFilterSuppressed() ==
-              other.isPrecedenceFilterSuppressed();
-    }
-    return false;
-  }
-
-  @override
-  int get hashCode {
-    var hashCode = MurmurHash.initialize(7);
-    hashCode = MurmurHash.update(hashCode, state.stateNumber);
-    hashCode = MurmurHash.update(hashCode, alt);
-    hashCode = MurmurHash.update(hashCode, context);
-    hashCode = MurmurHash.update(hashCode, semanticContext);
-    hashCode = MurmurHash.finish(hashCode, 4);
-    return hashCode;
-  }
-
-  @override
-  String toString([Recognizer recog, bool showAlt = true]) {
-    final buf = StringBuffer();
-    // if ( state.ruleIndex>=0 ) {
-    //  if ( recog!=null ) buf.write(recog.ruleNames[state.ruleIndex]+":");
-    //  else buf.write(state.ruleIndex+":");
-    // }
-    buf.write('(');
-    buf.write(state);
-    if (showAlt) {
-      buf.write(',');
-      buf.write(alt);
-    }
-    if (context != null) {
-      buf.write(',[');
-      buf.write(context.toString());
-      buf.write(']');
-    }
-    if (semanticContext != null && semanticContext != SemanticContext.NONE) {
-      buf.write(',');
-      buf.write(semanticContext);
-    }
-    if (outerContextDepth > 0) {
-      buf.write(',up=');
-      buf.write(outerContextDepth);
-    }
-    buf.write(')');
-    return buf.toString();
-  }
-}
-
-class LexerATNConfig extends ATNConfig {
-  /// Gets the [LexerActionExecutor] capable of executing the embedded
-  /// action(s) for the current configuration.
-  LexerActionExecutor lexerActionExecutor;
-
-  bool passedThroughNonGreedyDecision = false;
-
-  LexerATNConfig(ATNState state, int alt, PredictionContext context,
-      [this.lexerActionExecutor])
-      : super(state, alt, context, SemanticContext.NONE) {
-    passedThroughNonGreedyDecision = false;
-  }
-
-  LexerATNConfig.dup(LexerATNConfig c, ATNState state,
-      {this.lexerActionExecutor, PredictionContext context})
-      : super.dup(c, state: state, context: context) {
-    lexerActionExecutor = lexerActionExecutor ?? c.lexerActionExecutor;
-    passedThroughNonGreedyDecision = checkNonGreedyDecision(c, state);
-  }
-
-  bool hasPassedThroughNonGreedyDecision() {
-    return passedThroughNonGreedyDecision;
-  }
-
-  @override
-  int get hashCode {
-    var hashCode = MurmurHash.initialize(7);
-    hashCode = MurmurHash.update(hashCode, state.stateNumber);
-    hashCode = MurmurHash.update(hashCode, alt);
-    hashCode = MurmurHash.update(hashCode, context);
-    hashCode = MurmurHash.update(hashCode, semanticContext);
-    hashCode =
-        MurmurHash.update(hashCode, passedThroughNonGreedyDecision ? 1 : 0);
-    hashCode = MurmurHash.update(hashCode, lexerActionExecutor);
-    hashCode = MurmurHash.finish(hashCode, 6);
-    return hashCode;
-  }
-
-  @override
-  bool operator ==(Object other) {
-    if (identical(this, other)) {
-      return true;
-    } else if (other is LexerATNConfig) {
-      final lexerOther = other;
-      if (passedThroughNonGreedyDecision !=
-          lexerOther.passedThroughNonGreedyDecision) {
-        return false;
-      }
-
-      if (lexerActionExecutor != lexerOther.lexerActionExecutor) {
-        return false;
-      }
-
-      return super == other;
-    }
-    return false;
-  }
-
-  static bool checkNonGreedyDecision(LexerATNConfig source, ATNState target) {
-    return source.passedThroughNonGreedyDecision ||
-        target is DecisionState && target.nonGreedy;
-  }
-}