Add files using upload-large-folder tool

.gitattributes

@@ -324,3 +324,7 @@ evalkit_tf437/lib/python3.10/site-packages/pandas/_libs/tslibs/timestamps.cpytho
 evalkit_tf437/lib/python3.10/site-packages/sklearn/tree/_tree.cpython-310-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
 evalkit_tf437/lib/python3.10/site-packages/pandas/_libs/ops.cpython-310-x86_64-linux-gnu.so filter=lfs diff=lfs merge=lfs -text
 evalkit_tf437/lib/python3.10/site-packages/nvidia/cublas/lib/libnvblas.so.12 filter=lfs diff=lfs merge=lfs -text
+evalkit_tf437/lib/python3.10/site-packages/opencv_python.libs/libquadmath-96973f99.so.0.0.0 filter=lfs diff=lfs merge=lfs -text
+evalkit_tf437/lib/python3.10/site-packages/opencv_python.libs/libgfortran-91cc3cb1.so.3.0.0 filter=lfs diff=lfs merge=lfs -text
+evalkit_tf437/lib/python3.10/site-packages/opencv_python.libs/libxcb-xkb-9ba31ab3.so.1.0.0 filter=lfs diff=lfs merge=lfs -text
+evalkit_tf437/lib/python3.10/site-packages/opencv_python.libs/libxkbcommon-71ae2972.so.0.0.0 filter=lfs diff=lfs merge=lfs -text

evalkit_tf437/lib/python3.10/site-packages/aiohttp-3.10.10.dist-info/top_level.txt

@@ -0,0 +1 @@
+aiohttp

evalkit_tf437/lib/python3.10/site-packages/antlr4/IntervalSet.py

@@ -0,0 +1,180 @@
+#
+# 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.
+#
+
+from io import StringIO
+from antlr4.Token import Token
+
+# need forward declarations
+IntervalSet = None
+
+class IntervalSet(object):
+    __slots__ = ('intervals', 'readonly')
+
+    def __init__(self):
+        self.intervals = None
+        self.readonly = False
+
+    def __iter__(self):
+        if self.intervals is not None:
+            for i in self.intervals:
+                for c in i:
+                    yield c
+
+    def __getitem__(self, item):
+        i = 0
+        for k in self:
+            if i==item:
+                return k
+            else:
+                i += 1
+        return Token.INVALID_TYPE
+
+    def addOne(self, v:int):
+        self.addRange(range(v, v+1))
+
+    def addRange(self, v:range):
+        if self.intervals is None:
+            self.intervals = list()
+            self.intervals.append(v)
+        else:
+            # find insert pos
+            k = 0
+            for i in self.intervals:
+                # distinct range -> insert
+                if v.stop<i.start:
+                    self.intervals.insert(k, v)
+                    return
+                # contiguous range -> adjust
+                elif v.stop==i.start:
+                    self.intervals[k] = range(v.start, i.stop)
+                    return
+                # overlapping range -> adjust and reduce
+                elif v.start<=i.stop:
+                    self.intervals[k] = range(min(i.start,v.start), max(i.stop,v.stop))
+                    self.reduce(k)
+                    return
+                k += 1
+            # greater than any existing
+            self.intervals.append(v)
+
+    def addSet(self, other:IntervalSet):
+        if other.intervals is not None:
+            for i in other.intervals:
+                self.addRange(i)
+        return self
+
+    def reduce(self, k:int):
+        # only need to reduce if k is not the last
+        if k<len(self.intervals)-1:
+            l = self.intervals[k]
+            r = self.intervals[k+1]
+            # if r contained in l
+            if l.stop >= r.stop:
+                self.intervals.pop(k+1)
+                self.reduce(k)
+            elif l.stop >= r.start:
+                self.intervals[k] = range(l.start, r.stop)
+                self.intervals.pop(k+1)
+
+    def complement(self, start, stop):
+        result = IntervalSet()
+        result.addRange(range(start,stop+1))
+        for i in self.intervals:
+            result.removeRange(i)
+        return result
+
+    def __contains__(self, item):
+        if self.intervals is None:
+            return False
+        else:
+            return any(item in i for i in self.intervals)
+
+    def __len__(self):
+        return sum(len(i) for i in self.intervals)
+
+    def removeRange(self, v):
+        if v.start==v.stop-1:
+            self.removeOne(v.start)
+        elif self.intervals is not None:
+            k = 0
+            for i in self.intervals:
+                # intervals are ordered
+                if v.stop<=i.start:
+                    return
+                # check for including range, split it
+                elif v.start>i.start and v.stop<i.stop:
+                    self.intervals[k] = range(i.start, v.start)
+                    x = range(v.stop, i.stop)
+                    self.intervals.insert(k, x)
+                    return
+                # check for included range, remove it
+                elif v.start<=i.start and v.stop>=i.stop:
+                    self.intervals.pop(k)
+                    k -= 1  # need another pass
+                # check for lower boundary
+                elif v.start<i.stop:
+                    self.intervals[k] = range(i.start, v.start)
+                # check for upper boundary
+                elif v.stop<i.stop:
+                    self.intervals[k] = range(v.stop, i.stop)
+                k += 1
+
+    def removeOne(self, v):
+        if self.intervals is not None:
+            k = 0
+            for i in self.intervals:
+                # intervals is ordered
+                if v<i.start:
+                    return
+                # check for single value range
+                elif v==i.start and v==i.stop-1:
+                    self.intervals.pop(k)
+                    return
+                # check for lower boundary
+                elif v==i.start:
+                    self.intervals[k] = range(i.start+1, i.stop)
+                    return
+                # check for upper boundary
+                elif v==i.stop-1:
+                    self.intervals[k] = range(i.start, i.stop-1)
+                    return
+                # split existing range
+                elif v<i.stop-1:
+                    x = range(i.start, v)
+                    self.intervals[k] = range(v + 1, i.stop)
+                    self.intervals.insert(k, x)
+                    return
+                k += 1
+
+
+    def toString(self, literalNames:list, symbolicNames:list):
+        if self.intervals is None:
+            return "{}"
+        with StringIO() as buf:
+            if len(self)>1:
+                buf.write("{")
+            first = True
+            for i in self.intervals:
+                for j in i:
+                    if not first:
+                        buf.write(", ")
+                    buf.write(self.elementName(literalNames, symbolicNames, j))
+                    first = False
+            if len(self)>1:
+                buf.write("}")
+            return buf.getvalue()
+
+    def elementName(self, literalNames:list, symbolicNames:list, a:int):
+        if a==Token.EOF:
+            return "<EOF>"
+        elif a==Token.EPSILON:
+            return "<EPSILON>"
+        else:
+            if a<len(literalNames) and literalNames[a] != "<INVALID>":
+                return literalNames[a]
+            if a<len(symbolicNames):
+                return symbolicNames[a]
+            return "<UNKNOWN>"

evalkit_tf437/lib/python3.10/site-packages/antlr4/RuleContext.py

@@ -0,0 +1,227 @@
+# 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.
+#/
+
+
+#  A rule context is a record of a single rule invocation. It knows
+#  which context invoked it, if any. If there is no parent context, then
+#  naturally the invoking state is not valid.  The parent link
+#  provides a chain upwards from the current rule invocation to the root
+#  of the invocation tree, forming a stack. We actually carry no
+#  information about the rule associated with this context (except
+#  when parsing). We keep only the state number of the invoking state from
+#  the ATN submachine that invoked this. Contrast this with the s
+#  pointer inside ParserRuleContext that tracks the current state
+#  being "executed" for the current rule.
+#
+#  The parent contexts are useful for computing lookahead sets and
+#  getting error information.
+#
+#  These objects are used during parsing and prediction.
+#  For the special case of parsers, we use the subclass
+#  ParserRuleContext.
+#
+#  @see ParserRuleContext
+#/
+from io import StringIO
+from antlr4.tree.Tree import RuleNode, INVALID_INTERVAL, ParseTreeVisitor
+from antlr4.tree.Trees import Trees
+
+# need forward declarations
+RuleContext = None
+Parser = None
+
+class RuleContext(RuleNode):
+    __slots__ = ('parentCtx', 'invokingState')
+    EMPTY = None
+
+    def __init__(self, parent:RuleContext=None, invokingState:int=-1):
+        super().__init__()
+        # What context invoked this rule?
+        self.parentCtx = parent
+        # What state invoked the rule associated with this context?
+        #  The "return address" is the followState of invokingState
+        #  If parent is null, this should be -1.
+        self.invokingState = invokingState
+
+
+    def depth(self):
+        n = 0
+        p = self
+        while p is not None:
+            p = p.parentCtx
+            n += 1
+        return n
+
+    # A context is empty if there is no invoking state; meaning nobody call
+    #  current context.
+    def isEmpty(self):
+        return self.invokingState == -1
+
+    # satisfy the ParseTree / SyntaxTree interface
+
+    def getSourceInterval(self):
+        return INVALID_INTERVAL
+
+    def getRuleContext(self):
+        return self
+
+    def getPayload(self):
+        return self
+
+   # Return the combined text of all child nodes. This method only considers
+    #  tokens which have been added to the parse tree.
+    #  <p>
+    #  Since tokens on hidden channels (e.g. whitespace or comments) are not
+    #  added to the parse trees, they will not appear in the output of this
+    #  method.
+    #/
+    def getText(self):
+        if self.getChildCount() == 0:
+            return ""
+        with StringIO() as builder:
+            for child in self.getChildren():
+                builder.write(child.getText())
+            return builder.getvalue()
+
+    def getRuleIndex(self):
+        return -1
+
+    # For rule associated with this parse tree internal node, return
+    # the outer alternative number used to match the input. Default
+    # implementation does not compute nor store this alt num. Create
+    # a subclass of ParserRuleContext with backing field and set
+    # option contextSuperClass.
+    # to set it.
+    def getAltNumber(self):
+        return 0 # should use ATN.INVALID_ALT_NUMBER but won't compile
+
+    # Set the outer alternative number for this context node. Default
+    # implementation does nothing to avoid backing field overhead for
+    # trees that don't need it.  Create
+    # a subclass of ParserRuleContext with backing field and set
+    # option contextSuperClass.
+    def setAltNumber(self, altNumber:int):
+        pass
+
+    def getChild(self, i:int):
+        return None
+
+    def getChildCount(self):
+        return 0
+
+    def getChildren(self):
+        for c in []:
+            yield c
+
+    def accept(self, visitor:ParseTreeVisitor):
+        return visitor.visitChildren(self)
+
+   # # Call this method to view a parse tree in a dialog box visually.#/
+   #  public Future<JDialog> inspect(@Nullable Parser parser) {
+   #      List<String> ruleNames = parser != null ? Arrays.asList(parser.getRuleNames()) : null;
+   #      return inspect(ruleNames);
+   #  }
+   #
+   #  public Future<JDialog> inspect(@Nullable List<String> ruleNames) {
+   #      TreeViewer viewer = new TreeViewer(ruleNames, this);
+   #      return viewer.open();
+   #  }
+   #
+   # # Save this tree in a postscript file#/
+   #  public void save(@Nullable Parser parser, String fileName)
+   #      throws IOException, PrintException
+   #  {
+   #      List<String> ruleNames = parser != null ? Arrays.asList(parser.getRuleNames()) : null;
+   #      save(ruleNames, fileName);
+   #  }
+   #
+   # # Save this tree in a postscript file using a particular font name and size#/
+   #  public void save(@Nullable Parser parser, String fileName,
+   #                   String fontName, int fontSize)
+   #      throws IOException
+   #  {
+   #      List<String> ruleNames = parser != null ? Arrays.asList(parser.getRuleNames()) : null;
+   #      save(ruleNames, fileName, fontName, fontSize);
+   #  }
+   #
+   # # Save this tree in a postscript file#/
+   #  public void save(@Nullable List<String> ruleNames, String fileName)
+   #      throws IOException, PrintException
+   #  {
+   #      Trees.writePS(this, ruleNames, fileName);
+   #  }
+   #
+   # # Save this tree in a postscript file using a particular font name and size#/
+   #  public void save(@Nullable List<String> ruleNames, String fileName,
+   #                   String fontName, int fontSize)
+   #      throws IOException
+   #  {
+   #      Trees.writePS(this, ruleNames, fileName, fontName, fontSize);
+   #  }
+   #
+   # # Print out a whole tree, not just a node, in LISP format
+   #  #  (root child1 .. childN). Print just a node if this is a leaf.
+   #  #  We have to know the recognizer so we can get rule names.
+   #  #/
+   #  @Override
+   #  public String toStringTree(@Nullable Parser recog) {
+   #      return Trees.toStringTree(this, recog);
+   #  }
+   #
+   # Print out a whole tree, not just a node, in LISP format
+   #  (root child1 .. childN). Print just a node if this is a leaf.
+   #
+    def toStringTree(self, ruleNames:list=None, recog:Parser=None):
+        return Trees.toStringTree(self, ruleNames=ruleNames, recog=recog)
+   #  }
+   #
+   #  @Override
+   #  public String toStringTree() {
+   #      return toStringTree((List<String>)null);
+   #  }
+   #
+    def __str__(self):
+        return self.toString(None, None)
+
+   #  @Override
+   #  public String toString() {
+   #      return toString((List<String>)null, (RuleContext)null);
+   #  }
+   #
+   #  public final String toString(@Nullable Recognizer<?,?> recog) {
+   #      return toString(recog, ParserRuleContext.EMPTY);
+   #  }
+   #
+   #  public final String toString(@Nullable List<String> ruleNames) {
+   #      return toString(ruleNames, null);
+   #  }
+   #
+   #  // recog null unless ParserRuleContext, in which case we use subclass toString(...)
+   #  public String toString(@Nullable Recognizer<?,?> recog, @Nullable RuleContext stop) {
+   #      String[] ruleNames = recog != null ? recog.getRuleNames() : null;
+   #      List<String> ruleNamesList = ruleNames != null ? Arrays.asList(ruleNames) : null;
+   #      return toString(ruleNamesList, stop);
+   #  }
+
+    def toString(self, ruleNames:list, stop:RuleContext)->str:
+        with StringIO() as buf:
+            p = self
+            buf.write("[")
+            while p is not None and p is not stop:
+                if ruleNames is None:
+                    if not p.isEmpty():
+                        buf.write(str(p.invokingState))
+                else:
+                    ri = p.getRuleIndex()
+                    ruleName = ruleNames[ri] if ri >= 0 and ri < len(ruleNames) else str(ri)
+                    buf.write(ruleName)
+
+                if p.parentCtx is not None and (ruleNames is not None or not p.parentCtx.isEmpty()):
+                    buf.write(" ")
+
+                p = p.parentCtx
+
+            buf.write("]")
+            return buf.getvalue()

evalkit_tf437/lib/python3.10/site-packages/antlr4/Token.py

@@ -0,0 +1,155 @@
+# 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.
+#
+
+# A token has properties: text, type, line, character position in the line
+# (so we can ignore tabs), token channel, index, and source from which
+# we obtained this token.
+from io import StringIO
+
+
+class Token (object):
+    __slots__ = ('source', 'type', 'channel', 'start', 'stop', 'tokenIndex', 'line', 'column', '_text')
+
+    INVALID_TYPE = 0
+
+    # During lookahead operations, this "token" signifies we hit rule end ATN state
+    # and did not follow it despite needing to.
+    EPSILON = -2
+
+    MIN_USER_TOKEN_TYPE = 1
+
+    EOF = -1
+
+    # All tokens go to the parser (unless skip() is called in that rule)
+    # on a particular "channel".  The parser tunes to a particular channel
+    # so that whitespace etc... can go to the parser on a "hidden" channel.
+
+    DEFAULT_CHANNEL = 0
+
+    # Anything on different channel than DEFAULT_CHANNEL is not parsed
+    # by parser.
+
+    HIDDEN_CHANNEL = 1
+
+    def __init__(self):
+        self.source = None
+        self.type = None # token type of the token
+        self.channel = None # The parser ignores everything not on DEFAULT_CHANNEL
+        self.start = None # optional; return -1 if not implemented.
+        self.stop = None  # optional; return -1 if not implemented.
+        self.tokenIndex = None # from 0..n-1 of the token object in the input stream
+        self.line = None # line=1..n of the 1st character
+        self.column = None # beginning of the line at which it occurs, 0..n-1
+        self._text = None # text of the token.
+
+    @property
+    def text(self):
+        return self._text
+
+    # Explicitly set the text for this token. If {code text} is not
+    # {@code null}, then {@link #getText} will return this value rather than
+    # extracting the text from the input.
+    #
+    # @param text The explicit text of the token, or {@code null} if the text
+    # should be obtained from the input along with the start and stop indexes
+    # of the token.
+
+    @text.setter
+    def text(self, text:str):
+        self._text = text
+
+
+    def getTokenSource(self):
+        return self.source[0]
+
+    def getInputStream(self):
+        return self.source[1]
+
+class CommonToken(Token):
+
+    # An empty {@link Pair} which is used as the default value of
+    # {@link #source} for tokens that do not have a source.
+    EMPTY_SOURCE = (None, None)
+
+    def __init__(self, source:tuple = EMPTY_SOURCE, type:int = None, channel:int=Token.DEFAULT_CHANNEL, start:int=-1, stop:int=-1):
+        super().__init__()
+        self.source = source
+        self.type = type
+        self.channel = channel
+        self.start = start
+        self.stop = stop
+        self.tokenIndex = -1
+        if source[0] is not None:
+            self.line = source[0].line
+            self.column = source[0].column
+        else:
+            self.column = -1
+
+    # Constructs a new {@link CommonToken} as a copy of another {@link Token}.
+    #
+    # <p>
+    # If {@code oldToken} is also a {@link CommonToken} instance, the newly
+    # constructed token will share a reference to the {@link #text} field and
+    # the {@link Pair} stored in {@link #source}. Otherwise, {@link #text} will
+    # be assigned the result of calling {@link #getText}, and {@link #source}
+    # will be constructed from the result of {@link Token#getTokenSource} and
+    # {@link Token#getInputStream}.</p>
+    #
+    # @param oldToken The token to copy.
+     #
+    def clone(self):
+        t = CommonToken(self.source, self.type, self.channel, self.start, self.stop)
+        t.tokenIndex = self.tokenIndex
+        t.line = self.line
+        t.column = self.column
+        t.text = self.text
+        return t
+
+    @property
+    def text(self):
+        if self._text is not None:
+            return self._text
+        input = self.getInputStream()
+        if input is None:
+            return None
+        n = input.size
+        if self.start < n and self.stop < n:
+            return input.getText(self.start, self.stop)
+        else:
+            return "<EOF>"
+
+    @text.setter
+    def text(self, text:str):
+        self._text = text
+
+    def __str__(self):
+        with StringIO() as buf:
+            buf.write("[@")
+            buf.write(str(self.tokenIndex))
+            buf.write(",")
+            buf.write(str(self.start))
+            buf.write(":")
+            buf.write(str(self.stop))
+            buf.write("='")
+            txt = self.text
+            if txt is not None:
+                txt = txt.replace("\n","\\n")
+                txt = txt.replace("\r","\\r")
+                txt = txt.replace("\t","\\t")
+            else:
+                txt = "<no text>"
+            buf.write(txt)
+            buf.write("',<")
+            buf.write(str(self.type))
+            buf.write(">")
+            if self.channel > 0:
+                buf.write(",channel=")
+                buf.write(str(self.channel))
+            buf.write(",")
+            buf.write(str(self.line))
+            buf.write(":")
+            buf.write(str(self.column))
+            buf.write("]")
+            return buf.getvalue()

evalkit_tf437/lib/python3.10/site-packages/antlr4/atn/ATN.py

@@ -0,0 +1,132 @@
+# 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.
+#/
+from antlr4.IntervalSet import IntervalSet
+
+from antlr4.RuleContext import RuleContext
+
+from antlr4.Token import Token
+from antlr4.atn.ATNType import ATNType
+from antlr4.atn.ATNState import ATNState, DecisionState
+
+
+class ATN(object):
+    __slots__ = (
+        'grammarType', 'maxTokenType', 'states', 'decisionToState',
+        'ruleToStartState', 'ruleToStopState', 'modeNameToStartState',
+        'ruleToTokenType', 'lexerActions', 'modeToStartState'
+    )
+
+    INVALID_ALT_NUMBER = 0
+
+    # Used for runtime deserialization of ATNs from strings#/
+    def __init__(self, grammarType:ATNType , maxTokenType:int ):
+        # The type of the ATN.
+        self.grammarType = grammarType
+        # The maximum value for any symbol recognized by a transition in the ATN.
+        self.maxTokenType = maxTokenType
+        self.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...
+        self.decisionToState = []
+        # Maps from rule index to starting state number.
+        self.ruleToStartState = []
+        # Maps from rule index to stop state number.
+        self.ruleToStopState = None
+        self.modeNameToStartState = dict()
+        # 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}.
+        self.ruleToTokenType = None
+        # For lexer ATNs, this is an array of {@link LexerAction} objects which may
+        # be referenced by action transitions in the ATN.
+        self.lexerActions = None
+        self.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.
+    def nextTokensInContext(self, s:ATNState, ctx:RuleContext):
+        from antlr4.LL1Analyzer import LL1Analyzer
+        anal = LL1Analyzer(self)
+        return anal.LOOK(s, ctx=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.
+    def nextTokensNoContext(self, s:ATNState):
+        if s.nextTokenWithinRule is not None:
+            return s.nextTokenWithinRule
+        s.nextTokenWithinRule = self.nextTokensInContext(s, None)
+        s.nextTokenWithinRule.readonly = True
+        return s.nextTokenWithinRule
+
+    def nextTokens(self, s:ATNState, ctx:RuleContext = None):
+        if ctx==None:
+            return self.nextTokensNoContext(s)
+        else:
+            return self.nextTokensInContext(s, ctx)
+
+    def addState(self, state:ATNState):
+        if state is not None:
+            state.atn = self
+            state.stateNumber = len(self.states)
+        self.states.append(state)
+
+    def removeState(self, state:ATNState):
+        self.states[state.stateNumber] = None # just free mem, don't shift states in list
+
+    def defineDecisionState(self, s:DecisionState):
+        self.decisionToState.append(s)
+        s.decision = len(self.decisionToState)-1
+        return s.decision
+
+    def getDecisionState(self, decision:int):
+        if len(self.decisionToState)==0:
+            return None
+        else:
+            return self.decisionToState[decision]
+
+    # 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}
+    #/
+    def getExpectedTokens(self, stateNumber:int, ctx:RuleContext ):
+        if stateNumber < 0 or stateNumber >= len(self.states):
+            raise Exception("Invalid state number.")
+        s = self.states[stateNumber]
+        following = self.nextTokens(s)
+        if Token.EPSILON not in following:
+            return following
+        expected = IntervalSet()
+        expected.addSet(following)
+        expected.removeOne(Token.EPSILON)
+        while (ctx != None and ctx.invokingState >= 0 and Token.EPSILON in following):
+            invokingState = self.states[ctx.invokingState]
+            rt = invokingState.transitions[0]
+            following = self.nextTokens(rt.followState)
+            expected.addSet(following)
+            expected.removeOne(Token.EPSILON)
+            ctx = ctx.parentCtx
+        if Token.EPSILON in following:
+            expected.addOne(Token.EOF)
+        return expected

evalkit_tf437/lib/python3.10/site-packages/antlr4/atn/PredictionMode.py

@@ -0,0 +1,499 @@
+#
+# 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.
+#
+#
+# This enumeration defines the prediction modes available in ANTLR 4 along with
+# utility methods for analyzing configuration sets for conflicts and/or
+# ambiguities.
+
+
+from enum import Enum
+from antlr4.atn.ATN import ATN
+from antlr4.atn.ATNConfig import ATNConfig
+from antlr4.atn.ATNConfigSet import ATNConfigSet
+from antlr4.atn.ATNState import RuleStopState
+from antlr4.atn.SemanticContext import SemanticContext
+
+PredictionMode = None
+
+class PredictionMode(Enum):
+    #
+    # The SLL(*) prediction mode. This prediction mode ignores the current
+    # parser context when making predictions. This is the fastest prediction
+    # mode, and provides correct results for many grammars. This prediction
+    # mode is more powerful than the prediction mode provided by ANTLR 3, but
+    # may result in syntax errors for grammar and input combinations which are
+    # not SLL.
+    #
+    # <p>
+    # When using this prediction mode, the parser will either return a correct
+    # parse tree (i.e. the same parse tree that would be returned with the
+    # {@link #LL} prediction mode), or it will report a syntax error. If a
+    # syntax error is encountered when using the {@link #SLL} prediction mode,
+    # it may be due to either an actual syntax error in the input or indicate
+    # that the particular combination of grammar and input requires the more
+    # powerful {@link #LL} prediction abilities to complete successfully.</p>
+    #
+    # <p>
+    # This prediction mode does not provide any guarantees for prediction
+    # behavior for syntactically-incorrect inputs.</p>
+    #
+    SLL = 0
+    #
+    # The LL(*) prediction mode. This prediction mode allows the current parser
+    # context to be used for resolving SLL conflicts that occur during
+    # prediction. This is the fastest prediction mode that guarantees correct
+    # parse results for all combinations of grammars with syntactically correct
+    # inputs.
+    #
+    # <p>
+    # When using this prediction mode, the parser will make correct decisions
+    # for all syntactically-correct grammar and input combinations. However, in
+    # cases where the grammar is truly ambiguous this prediction mode might not
+    # report a precise answer for <em>exactly which</em> alternatives are
+    # ambiguous.</p>
+    #
+    # <p>
+    # This prediction mode does not provide any guarantees for prediction
+    # behavior for syntactically-incorrect inputs.</p>
+    #
+    LL = 1
+    #
+    # The LL(*) prediction mode with exact ambiguity detection. In addition to
+    # the correctness guarantees provided by the {@link #LL} prediction mode,
+    # this prediction mode instructs the prediction algorithm to determine the
+    # complete and exact set of ambiguous alternatives for every ambiguous
+    # decision encountered while parsing.
+    #
+    # <p>
+    # This prediction mode may be used for diagnosing ambiguities during
+    # grammar development. Due to the performance overhead of calculating sets
+    # of ambiguous alternatives, this prediction mode should be avoided when
+    # the exact results are not necessary.</p>
+    #
+    # <p>
+    # This prediction mode does not provide any guarantees for prediction
+    # behavior for syntactically-incorrect inputs.</p>
+    #
+    LL_EXACT_AMBIG_DETECTION = 2
+
+
+    #
+    # Computes the SLL prediction termination condition.
+    #
+    # <p>
+    # This method computes the SLL prediction termination condition for both of
+    # the following cases.</p>
+    #
+    # <ul>
+    # <li>The usual SLL+LL fallback upon SLL conflict</li>
+    # <li>Pure SLL without LL fallback</li>
+    # </ul>
+    #
+    # <p><strong>COMBINED SLL+LL PARSING</strong></p>
+    #
+    # <p>When LL-fallback is enabled upon SLL conflict, correct predictions are
+    # ensured regardless of how the termination condition is computed by this
+    # method. Due to the substantially higher cost of LL prediction, the
+    # prediction should only fall back to LL when the additional lookahead
+    # cannot lead to a unique SLL prediction.</p>
+    #
+    # <p>Assuming combined SLL+LL parsing, an SLL configuration set with only
+    # conflicting subsets should fall back to full LL, even if the
+    # configuration sets don't resolve to the same alternative (e.g.
+    # {@code {1,2}} and {@code {3,4}}. If there is at least one non-conflicting
+    # configuration, SLL could continue with the hopes that more lookahead will
+    # resolve via one of those non-conflicting configurations.</p>
+    #
+    # <p>Here's the prediction termination rule them: SLL (for SLL+LL parsing)
+    # stops when it sees only conflicting configuration subsets. In contrast,
+    # full LL keeps going when there is uncertainty.</p>
+    #
+    # <p><strong>HEURISTIC</strong></p>
+    #
+    # <p>As a heuristic, we stop prediction when we see any conflicting subset
+    # unless we see a state that only has one alternative associated with it.
+    # The single-alt-state thing lets prediction continue upon rules like
+    # (otherwise, it would admit defeat too soon):</p>
+    #
+    # <p>{@code [12|1|[], 6|2|[], 12|2|[]]. s : (ID | ID ID?) ';' ;}</p>
+    #
+    # <p>When the ATN simulation reaches the state before {@code ';'}, it has a
+    # DFA state that looks like: {@code [12|1|[], 6|2|[], 12|2|[]]}. Naturally
+    # {@code 12|1|[]} and {@code 12|2|[]} conflict, but we cannot stop
+    # processing this node because alternative to has another way to continue,
+    # via {@code [6|2|[]]}.</p>
+    #
+    # <p>It also let's us continue for this rule:</p>
+    #
+    # <p>{@code [1|1|[], 1|2|[], 8|3|[]] a : A | A | A B ;}</p>
+    #
+    # <p>After matching input A, we reach the stop state for rule A, state 1.
+    # State 8 is the state right before B. Clearly alternatives 1 and 2
+    # conflict and no amount of further lookahead will separate the two.
+    # However, alternative 3 will be able to continue and so we do not stop
+    # working on this state. In the previous example, we're concerned with
+    # states associated with the conflicting alternatives. Here alt 3 is not
+    # associated with the conflicting configs, but since we can continue
+    # looking for input reasonably, don't declare the state done.</p>
+    #
+    # <p><strong>PURE SLL PARSING</strong></p>
+    #
+    # <p>To handle pure SLL parsing, all we have to do is make sure that we
+    # combine stack contexts for configurations that differ only by semantic
+    # predicate. From there, we can do the usual SLL termination heuristic.</p>
+    #
+    # <p><strong>PREDICATES IN SLL+LL PARSING</strong></p>
+    #
+    # <p>SLL decisions don't evaluate predicates until after they reach DFA stop
+    # states because they need to create the DFA cache that works in all
+    # semantic situations. In contrast, full LL evaluates predicates collected
+    # during start state computation so it can ignore predicates thereafter.
+    # This means that SLL termination detection can totally ignore semantic
+    # predicates.</p>
+    #
+    # <p>Implementation-wise, {@link ATNConfigSet} combines stack contexts but not
+    # semantic predicate contexts so we might see two configurations like the
+    # following.</p>
+    #
+    # <p>{@code (s, 1, x, {}), (s, 1, x', {p})}</p>
+    #
+    # <p>Before testing these configurations against others, we have to merge
+    # {@code x} and {@code x'} (without modifying the existing configurations).
+    # For example, we test {@code (x+x')==x''} when looking for conflicts in
+    # the following configurations.</p>
+    #
+    # <p>{@code (s, 1, x, {}), (s, 1, x', {p}), (s, 2, x'', {})}</p>
+    #
+    # <p>If the configuration set has predicates (as indicated by
+    # {@link ATNConfigSet#hasSemanticContext}), this algorithm makes a copy of
+    # the configurations to strip out all of the predicates so that a standard
+    # {@link ATNConfigSet} will merge everything ignoring predicates.</p>
+    #
+    @classmethod
+    def hasSLLConflictTerminatingPrediction(cls, mode:PredictionMode, configs:ATNConfigSet):
+        # Configs in rule stop states indicate reaching the end of the decision
+        # rule (local context) or end of start rule (full context). If all
+        # configs meet this condition, then none of the configurations is able
+        # to match additional input so we terminate prediction.
+        #
+        if cls.allConfigsInRuleStopStates(configs):
+            return True
+
+        # pure SLL mode parsing
+        if mode == PredictionMode.SLL:
+            # Don't bother with combining configs from different semantic
+            # contexts if we can fail over to full LL; costs more time
+            # since we'll often fail over anyway.
+            if configs.hasSemanticContext:
+                # dup configs, tossing out semantic predicates
+                dup = ATNConfigSet()
+                for c in configs:
+                    c = ATNConfig(config=c, semantic=SemanticContext.NONE)
+                    dup.add(c)
+                configs = dup
+            # now we have combined contexts for configs with dissimilar preds
+
+        # pure SLL or combined SLL+LL mode parsing
+        altsets = cls.getConflictingAltSubsets(configs)
+        return cls.hasConflictingAltSet(altsets) and not cls.hasStateAssociatedWithOneAlt(configs)
+
+    # Checks if any configuration in {@code configs} is in a
+    # {@link RuleStopState}. Configurations meeting this condition have reached
+    # the end of the decision rule (local context) or end of start rule (full
+    # context).
+    #
+    # @param configs the configuration set to test
+    # @return {@code true} if any configuration in {@code configs} is in a
+    # {@link RuleStopState}, otherwise {@code false}
+    @classmethod
+    def hasConfigInRuleStopState(cls, configs:ATNConfigSet):
+        return any(isinstance(cfg.state, RuleStopState) for cfg in configs)
+
+    # Checks if all configurations in {@code configs} are in a
+    # {@link RuleStopState}. Configurations meeting this condition have reached
+    # the end of the decision rule (local context) or end of start rule (full
+    # context).
+    #
+    # @param configs the configuration set to test
+    # @return {@code true} if all configurations in {@code configs} are in a
+    # {@link RuleStopState}, otherwise {@code false}
+    @classmethod
+    def allConfigsInRuleStopStates(cls, configs:ATNConfigSet):
+        return all(isinstance(cfg.state, RuleStopState) for cfg in configs)
+
+    #
+    # Full LL prediction termination.
+    #
+    # <p>Can we stop looking ahead during ATN simulation or is there some
+    # uncertainty as to which alternative we will ultimately pick, after
+    # consuming more input? Even if there are partial conflicts, we might know
+    # that everything is going to resolve to the same minimum alternative. That
+    # means we can stop since no more lookahead will change that fact. On the
+    # other hand, there might be multiple conflicts that resolve to different
+    # minimums. That means we need more look ahead to decide which of those
+    # alternatives we should predict.</p>
+    #
+    # <p>The basic idea is to split the set of configurations {@code C}, into
+    # conflicting subsets {@code (s, _, ctx, _)} and singleton subsets with
+    # non-conflicting configurations. Two configurations conflict if they have
+    # identical {@link ATNConfig#state} and {@link ATNConfig#context} values
+    # but different {@link ATNConfig#alt} value, e.g. {@code (s, i, ctx, _)}
+    # and {@code (s, j, ctx, _)} for {@code i!=j}.</p>
+    #
+    # <p>Reduce these configuration subsets to the set of possible alternatives.
+    # You can compute the alternative subsets in one pass as follows:</p>
+    #
+    # <p>{@code A_s,ctx = {i | (s, i, ctx, _)}} for each configuration in
+    # {@code C} holding {@code s} and {@code ctx} fixed.</p>
+    #
+    # <p>Or in pseudo-code, for each configuration {@code c} in {@code C}:</p>
+    #
+    # <pre>
+    # map[c] U= c.{@link ATNConfig#alt alt} # map hash/equals uses s and x, not
+    # alt and not pred
+    # </pre>
+    #
+    # <p>The values in {@code map} are the set of {@code A_s,ctx} sets.</p>
+    #
+    # <p>If {@code |A_s,ctx|=1} then there is no conflict associated with
+    # {@code s} and {@code ctx}.</p>
+    #
+    # <p>Reduce the subsets to singletons by choosing a minimum of each subset. If
+    # the union of these alternative subsets is a singleton, then no amount of
+    # more lookahead will help us. We will always pick that alternative. If,
+    # however, there is more than one alternative, then we are uncertain which
+    # alternative to predict and must continue looking for resolution. We may
+    # or may not discover an ambiguity in the future, even if there are no
+    # conflicting subsets this round.</p>
+    #
+    # <p>The biggest sin is to terminate early because it means we've made a
+    # decision but were uncertain as to the eventual outcome. We haven't used
+    # enough lookahead. On the other hand, announcing a conflict too late is no
+    # big deal; you will still have the conflict. It's just inefficient. It
+    # might even look until the end of file.</p>
+    #
+    # <p>No special consideration for semantic predicates is required because
+    # predicates are evaluated on-the-fly for full LL prediction, ensuring that
+    # no configuration contains a semantic context during the termination
+    # check.</p>
+    #
+    # <p><strong>CONFLICTING CONFIGS</strong></p>
+    #
+    # <p>Two configurations {@code (s, i, x)} and {@code (s, j, x')}, conflict
+    # when {@code i!=j} but {@code x=x'}. Because we merge all
+    # {@code (s, i, _)} configurations together, that means that there are at
+    # most {@code n} configurations associated with state {@code s} for
+    # {@code n} possible alternatives in the decision. The merged stacks
+    # complicate the comparison of configuration contexts {@code x} and
+    # {@code x'}. Sam checks to see if one is a subset of the other by calling
+    # merge and checking to see if the merged result is either {@code x} or
+    # {@code x'}. If the {@code x} associated with lowest alternative {@code i}
+    # is the superset, then {@code i} is the only possible prediction since the
+    # others resolve to {@code min(i)} as well. However, if {@code x} is
+    # associated with {@code j>i} then at least one stack configuration for
+    # {@code j} is not in conflict with alternative {@code i}. The algorithm
+    # should keep going, looking for more lookahead due to the uncertainty.</p>
+    #
+    # <p>For simplicity, I'm doing a equality check between {@code x} and
+    # {@code x'} that lets the algorithm continue to consume lookahead longer
+    # than necessary. The reason I like the equality is of course the
+    # simplicity but also because that is the test you need to detect the
+    # alternatives that are actually in conflict.</p>
+    #
+    # <p><strong>CONTINUE/STOP RULE</strong></p>
+    #
+    # <p>Continue if union of resolved alternative sets from non-conflicting and
+    # conflicting alternative subsets has more than one alternative. We are
+    # uncertain about which alternative to predict.</p>
+    #
+    # <p>The complete set of alternatives, {@code [i for (_,i,_)]}, tells us which
+    # alternatives are still in the running for the amount of input we've
+    # consumed at this point. The conflicting sets let us to strip away
+    # configurations that won't lead to more states because we resolve
+    # conflicts to the configuration with a minimum alternate for the
+    # conflicting set.</p>
+    #
+    # <p><strong>CASES</strong></p>
+    #
+    # <ul>
+    #
+    # <li>no conflicts and more than 1 alternative in set =&gt; continue</li>
+    #
+    # <li> {@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s, 3, z)},
+    # {@code (s', 1, y)}, {@code (s', 2, y)} yields non-conflicting set
+    # {@code {3}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} =
+    # {@code {1,3}} =&gt; continue
+    # </li>
+    #
+    # <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)},
+    # {@code (s', 2, y)}, {@code (s'', 1, z)} yields non-conflicting set
+    # {@code {1}} U conflicting sets {@code min({1,2})} U {@code min({1,2})} =
+    # {@code {1}} =&gt; stop and predict 1</li>
+    #
+    # <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 1, y)},
+    # {@code (s', 2, y)} yields conflicting, reduced sets {@code {1}} U
+    # {@code {1}} = {@code {1}} =&gt; stop and predict 1, can announce
+    # ambiguity {@code {1,2}}</li>
+    #
+    # <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 2, y)},
+    # {@code (s', 3, y)} yields conflicting, reduced sets {@code {1}} U
+    # {@code {2}} = {@code {1,2}} =&gt; continue</li>
+    #
+    # <li>{@code (s, 1, x)}, {@code (s, 2, x)}, {@code (s', 3, y)},
+    # {@code (s', 4, y)} yields conflicting, reduced sets {@code {1}} U
+    # {@code {3}} = {@code {1,3}} =&gt; continue</li>
+    #
+    # </ul>
+    #
+    # <p><strong>EXACT AMBIGUITY DETECTION</strong></p>
+    #
+    # <p>If all states report the same conflicting set of alternatives, then we
+    # know we have the exact ambiguity set.</p>
+    #
+    # <p><code>|A_<em>i</em>|&gt;1</code> and
+    # <code>A_<em>i</em> = A_<em>j</em></code> for all <em>i</em>, <em>j</em>.</p>
+    #
+    # <p>In other words, we continue examining lookahead until all {@code A_i}
+    # have more than one alternative and all {@code A_i} are the same. If
+    # {@code A={{1,2}, {1,3}}}, then regular LL prediction would terminate
+    # because the resolved set is {@code {1}}. To determine what the real
+    # ambiguity is, we have to know whether the ambiguity is between one and
+    # two or one and three so we keep going. We can only stop prediction when
+    # we need exact ambiguity detection when the sets look like
+    # {@code A={{1,2}}} or {@code {{1,2},{1,2}}}, etc...</p>
+    #
+    @classmethod
+    def resolvesToJustOneViableAlt(cls, altsets:list):
+        return cls.getSingleViableAlt(altsets)
+
+    #
+    # Determines if every alternative subset in {@code altsets} contains more
+    # than one alternative.
+    #
+    # @param altsets a collection of alternative subsets
+    # @return {@code true} if every {@link BitSet} in {@code altsets} has
+    # {@link BitSet#cardinality cardinality} &gt; 1, otherwise {@code false}
+    #
+    @classmethod
+    def allSubsetsConflict(cls, altsets:list):
+        return not cls.hasNonConflictingAltSet(altsets)
+
+    #
+    # Determines if any single alternative subset in {@code altsets} contains
+    # exactly one alternative.
+    #
+    # @param altsets a collection of alternative subsets
+    # @return {@code true} if {@code altsets} contains a {@link BitSet} with
+    # {@link BitSet#cardinality cardinality} 1, otherwise {@code false}
+    #
+    @classmethod
+    def hasNonConflictingAltSet(cls, altsets:list):
+        return any(len(alts) == 1 for alts in altsets)
+
+    #
+    # Determines if any single alternative subset in {@code altsets} contains
+    # more than one alternative.
+    #
+    # @param altsets a collection of alternative subsets
+    # @return {@code true} if {@code altsets} contains a {@link BitSet} with
+    # {@link BitSet#cardinality cardinality} &gt; 1, otherwise {@code false}
+    #
+    @classmethod
+    def hasConflictingAltSet(cls, altsets:list):
+        return any(len(alts) > 1 for alts in altsets)
+
+    #
+    # Determines if every alternative subset in {@code altsets} is equivalent.
+    #
+    # @param altsets a collection of alternative subsets
+    # @return {@code true} if every member of {@code altsets} is equal to the
+    # others, otherwise {@code false}
+    #
+    @classmethod
+    def allSubsetsEqual(cls, altsets:list):
+        if not altsets:
+            return True
+        first = next(iter(altsets))
+        return all(alts == first for alts in iter(altsets))
+
+    #
+    # Returns the unique alternative predicted by all alternative subsets in
+    # {@code altsets}. If no such alternative exists, this method returns
+    # {@link ATN#INVALID_ALT_NUMBER}.
+    #
+    # @param altsets a collection of alternative subsets
+    #
+    @classmethod
+    def getUniqueAlt(cls, altsets:list):
+        all = cls.getAlts(altsets)
+        if len(all)==1:
+            return next(iter(all))
+        return ATN.INVALID_ALT_NUMBER
+
+    # Gets the complete set of represented alternatives for a collection of
+    # alternative subsets. This method returns the union of each {@link BitSet}
+    # in {@code altsets}.
+    #
+    # @param altsets a collection of alternative subsets
+    # @return the set of represented alternatives in {@code altsets}
+    #
+    @classmethod
+    def getAlts(cls, altsets:list):
+        return set.union(*altsets)
+
+    #
+    # This function gets the conflicting alt subsets from a configuration set.
+    # For each configuration {@code c} in {@code configs}:
+    #
+    # <pre>
+    # map[c] U= c.{@link ATNConfig#alt alt} # map hash/equals uses s and x, not
+    # alt and not pred
+    # </pre>
+    #
+    @classmethod
+    def getConflictingAltSubsets(cls, configs:ATNConfigSet):
+        configToAlts = dict()
+        for c in configs:
+            h = hash((c.state.stateNumber, c.context))
+            alts = configToAlts.get(h, None)
+            if alts is None:
+                alts = set()
+                configToAlts[h] = alts
+            alts.add(c.alt)
+        return configToAlts.values()
+
+    #
+    # Get a map from state to alt subset from a configuration set. For each
+    # configuration {@code c} in {@code configs}:
+    #
+    # <pre>
+    # map[c.{@link ATNConfig#state state}] U= c.{@link ATNConfig#alt alt}
+    # </pre>
+    #
+    @classmethod
+    def getStateToAltMap(cls, configs:ATNConfigSet):
+        m = dict()
+        for c in configs:
+            alts = m.get(c.state, None)
+            if alts is None:
+                alts = set()
+                m[c.state] = alts
+            alts.add(c.alt)
+        return m
+
+    @classmethod
+    def hasStateAssociatedWithOneAlt(cls, configs:ATNConfigSet):
+        return any(len(alts) == 1 for alts in cls.getStateToAltMap(configs).values())
+
+    @classmethod
+    def getSingleViableAlt(cls, altsets:list):
+        viableAlts = set()
+        for alts in altsets:
+            minAlt = min(alts)
+            viableAlts.add(minAlt)
+            if len(viableAlts)>1 : # more than 1 viable alt
+                return ATN.INVALID_ALT_NUMBER
+        return min(viableAlts)

evalkit_tf437/lib/python3.10/site-packages/antlr4/dfa/DFASerializer.py

@@ -0,0 +1,73 @@
+#
+# 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.
+#/
+
+# A DFA walker that knows how to dump them to serialized strings.#/
+from io import StringIO
+from antlr4 import DFA
+from antlr4.Utils import str_list
+from antlr4.dfa.DFAState import DFAState
+
+
+class DFASerializer(object):
+    __slots__ = ('dfa', 'literalNames', 'symbolicNames')
+
+    def __init__(self, dfa:DFA, literalNames:list=None, symbolicNames:list=None):
+        self.dfa = dfa
+        self.literalNames = literalNames
+        self.symbolicNames = symbolicNames
+
+    def __str__(self):
+        if self.dfa.s0 is None:
+            return None
+        with StringIO() as buf:
+            for s in self.dfa.sortedStates():
+                n = 0
+                if s.edges is not None:
+                    n = len(s.edges)
+                for i in range(0, n):
+                    t = s.edges[i]
+                    if t is not None and t.stateNumber != 0x7FFFFFFF:
+                        buf.write(self.getStateString(s))
+                        label = self.getEdgeLabel(i)
+                        buf.write("-")
+                        buf.write(label)
+                        buf.write("->")
+                        buf.write(self.getStateString(t))
+                        buf.write('\n')
+            output = buf.getvalue()
+            if len(output)==0:
+                return None
+            else:
+                return output
+
+    def getEdgeLabel(self, i:int):
+        if i==0:
+            return "EOF"
+        if self.literalNames is not None and i<=len(self.literalNames):
+            return self.literalNames[i-1]
+        elif self.symbolicNames is not None and i<=len(self.symbolicNames):
+            return self.symbolicNames[i-1]
+        else:
+            return str(i-1)
+
+    def getStateString(self, s:DFAState):
+        n = s.stateNumber
+        baseStateStr = ( ":" if s.isAcceptState else "") + "s" + str(n) + ( "^" if s.requiresFullContext else "")
+        if s.isAcceptState:
+            if s.predicates is not None:
+                return baseStateStr + "=>" + str_list(s.predicates)
+            else:
+                return baseStateStr + "=>" + str(s.prediction)
+        else:
+            return baseStateStr
+
+class LexerDFASerializer(DFASerializer):
+
+    def __init__(self, dfa:DFA):
+        super().__init__(dfa, None)
+
+    def getEdgeLabel(self, i:int):
+        return "'" + chr(i) + "'"

evalkit_tf437/lib/python3.10/site-packages/antlr4/dfa/DFAState.py

@@ -0,0 +1,126 @@
+#
+# 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.
+#/
+
+# Map a predicate to a predicted alternative.#/
+from io import StringIO
+from antlr4.atn.ATNConfigSet import ATNConfigSet
+from antlr4.atn.SemanticContext import SemanticContext
+
+
+class PredPrediction(object):
+    __slots__ = ('alt', 'pred')
+
+    def __init__(self, pred:SemanticContext, alt:int):
+        self.alt = alt
+        self.pred = pred
+
+    def __str__(self):
+        return "(" + str(self.pred) + ", " + str(self.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(object):
+    __slots__ = (
+        'stateNumber', 'configs', 'edges', 'isAcceptState', 'prediction',
+        'lexerActionExecutor', 'requiresFullContext', 'predicates'
+    )
+
+    def __init__(self, stateNumber:int=-1, configs:ATNConfigSet=ATNConfigSet()):
+        self.stateNumber = stateNumber
+        self.configs = configs
+        # {@code edges[symbol]} points to target of symbol. Shift up by 1 so (-1)
+        #  {@link Token#EOF} maps to {@code edges[0]}.
+        self.edges = None
+        self.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}.
+        self.prediction = 0
+        self.lexerActionExecutor = None
+        # 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.
+        self.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 {@code 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>
+        self.predicates = None
+
+
+
+    # Get the set of all alts mentioned by all ATN configurations in this
+    #  DFA state.
+    def getAltSet(self):
+        if self.configs is not None:
+            return set(cfg.alt for cfg in self.configs) or None
+        return None
+
+    def __hash__(self):
+        return hash(self.configs)
+
+    # Two {@link 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>
+    def __eq__(self, other):
+        # compare set of ATN configurations in this set with other
+        if self is other:
+            return True
+        elif not isinstance(other, DFAState):
+            return False
+        else:
+            return self.configs==other.configs
+
+    def __str__(self):
+        with StringIO() as buf:
+            buf.write(str(self.stateNumber))
+            buf.write(":")
+            buf.write(str(self.configs))
+            if self.isAcceptState:
+                buf.write("=>")
+                if self.predicates is not None:
+                    buf.write(str(self.predicates))
+                else:
+                    buf.write(str(self.prediction))
+            return buf.getvalue()

evalkit_tf437/lib/python3.10/site-packages/antlr4/dfa/__init__.py

@@ -0,0 +1 @@
+__author__ = 'ericvergnaud'

evalkit_tf437/lib/python3.10/site-packages/antlr4/error/DiagnosticErrorListener.py

@@ -0,0 +1,107 @@
+#
+# 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.
+#
+
+
+#
+# This implementation of {@link ANTLRErrorListener} can be used to identify
+# certain potential correctness and performance problems in grammars. "Reports"
+# are made by calling {@link Parser#notifyErrorListeners} with the appropriate
+# message.
+#
+# <ul>
+# <li><b>Ambiguities</b>: These are cases where more than one path through the
+# grammar can match the input.</li>
+# <li><b>Weak context sensitivity</b>: These are cases where full-context
+# prediction resolved an SLL conflict to a unique alternative which equaled the
+# minimum alternative of the SLL conflict.</li>
+# <li><b>Strong (forced) context sensitivity</b>: These are cases where the
+# full-context prediction resolved an SLL conflict to a unique alternative,
+# <em>and</em> the minimum alternative of the SLL conflict was found to not be
+# a truly viable alternative. Two-stage parsing cannot be used for inputs where
+# this situation occurs.</li>
+# </ul>
+
+from io import StringIO
+from antlr4 import Parser, DFA
+from antlr4.atn.ATNConfigSet import ATNConfigSet
+from antlr4.error.ErrorListener import ErrorListener
+
+class DiagnosticErrorListener(ErrorListener):
+
+    def __init__(self, exactOnly:bool=True):
+        # whether all ambiguities or only exact ambiguities are reported.
+        self.exactOnly = exactOnly
+
+    def reportAmbiguity(self, recognizer:Parser, dfa:DFA, startIndex:int,
+                       stopIndex:int, exact:bool, ambigAlts:set, configs:ATNConfigSet):
+        if self.exactOnly and not exact:
+            return
+
+        with StringIO() as buf:
+            buf.write("reportAmbiguity d=")
+            buf.write(self.getDecisionDescription(recognizer, dfa))
+            buf.write(": ambigAlts=")
+            buf.write(str(self.getConflictingAlts(ambigAlts, configs)))
+            buf.write(", input='")
+            buf.write(recognizer.getTokenStream().getText(startIndex, stopIndex))
+            buf.write("'")
+            recognizer.notifyErrorListeners(buf.getvalue())
+
+
+    def reportAttemptingFullContext(self, recognizer:Parser, dfa:DFA, startIndex:int,
+                       stopIndex:int, conflictingAlts:set, configs:ATNConfigSet):
+        with StringIO() as buf:
+            buf.write("reportAttemptingFullContext d=")
+            buf.write(self.getDecisionDescription(recognizer, dfa))
+            buf.write(", input='")
+            buf.write(recognizer.getTokenStream().getText(startIndex, stopIndex))
+            buf.write("'")
+            recognizer.notifyErrorListeners(buf.getvalue())
+
+    def reportContextSensitivity(self, recognizer:Parser, dfa:DFA, startIndex:int,
+                       stopIndex:int, prediction:int, configs:ATNConfigSet):
+        with StringIO() as buf:
+            buf.write("reportContextSensitivity d=")
+            buf.write(self.getDecisionDescription(recognizer, dfa))
+            buf.write(", input='")
+            buf.write(recognizer.getTokenStream().getText(startIndex, stopIndex))
+            buf.write("'")
+            recognizer.notifyErrorListeners(buf.getvalue())
+
+    def getDecisionDescription(self, recognizer:Parser, dfa:DFA):
+        decision = dfa.decision
+        ruleIndex = dfa.atnStartState.ruleIndex
+
+        ruleNames = recognizer.ruleNames
+        if ruleIndex < 0 or ruleIndex >= len(ruleNames):
+            return str(decision)
+
+        ruleName = ruleNames[ruleIndex]
+        if ruleName is None or len(ruleName)==0:
+            return str(decision)
+
+        return str(decision) + " (" + ruleName + ")"
+
+    #
+    # Computes the set of conflicting or ambiguous alternatives from a
+    # configuration set, if that information was not already provided by the
+    # parser.
+    #
+    # @param reportedAlts The set of conflicting or ambiguous alternatives, as
+    # reported by the parser.
+    # @param configs The conflicting or ambiguous configuration set.
+    # @return Returns {@code reportedAlts} if it is not {@code null}, otherwise
+    # returns the set of alternatives represented in {@code configs}.
+    #
+    def getConflictingAlts(self, reportedAlts:set, configs:ATNConfigSet):
+        if reportedAlts is not None:
+            return reportedAlts
+
+        result = set()
+        for config in configs:
+            result.add(config.alt)
+
+        return result

evalkit_tf437/lib/python3.10/site-packages/antlr4/error/__init__.py

@@ -0,0 +1 @@
+__author__ = 'ericvergnaud'

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/Chunk.py

@@ -0,0 +1,30 @@
+#
+# 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.
+#
+
+class Chunk(object):
+    pass
+
+class TagChunk(Chunk):
+    __slots__ = ('tag', 'label')
+
+    def __init__(self, tag:str, label:str=None):
+        self.tag = tag
+        self.label = label
+
+    def __str__(self):
+        if self.label is None:
+            return self.tag
+        else:
+            return self.label + ":" + self.tag
+
+class TextChunk(Chunk):
+    __slots__ = 'text'
+
+    def __init__(self, text:str):
+        self.text = text
+
+    def __str__(self):
+        return "'" + self.text + "'"

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/ParseTreePattern.py

@@ -0,0 +1,72 @@
+#
+# 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.
+#
+
+#
+# A pattern like {@code <ID> = <expr>;} converted to a {@link ParseTree} by
+# {@link ParseTreePatternMatcher#compile(String, int)}.
+#
+from antlr4.tree.ParseTreePatternMatcher import ParseTreePatternMatcher
+from antlr4.tree.Tree import ParseTree
+from antlr4.xpath.XPath import XPath
+
+
+class ParseTreePattern(object):
+    __slots__ = ('matcher', 'patternRuleIndex', 'pattern', 'patternTree')
+
+    # Construct a new instance of the {@link ParseTreePattern} class.
+    #
+    # @param matcher The {@link ParseTreePatternMatcher} which created this
+    # tree pattern.
+    # @param pattern The tree pattern in concrete syntax form.
+    # @param patternRuleIndex The parser rule which serves as the root of the
+    # tree pattern.
+    # @param patternTree The tree pattern in {@link ParseTree} form.
+    #
+    def __init__(self, matcher:ParseTreePatternMatcher, pattern:str, patternRuleIndex:int , patternTree:ParseTree):
+        self.matcher = matcher
+        self.patternRuleIndex = patternRuleIndex
+        self.pattern = pattern
+        self.patternTree = patternTree
+
+    #
+    # Match a specific parse tree against this tree pattern.
+    #
+    # @param tree The parse tree to match against this tree pattern.
+    # @return A {@link ParseTreeMatch} object describing the result of the
+    # match operation. The {@link ParseTreeMatch#succeeded()} method can be
+    # used to determine whether or not the match was successful.
+    #
+    def match(self, tree:ParseTree):
+        return self.matcher.match(tree, self)
+
+    #
+    # Determine whether or not a parse tree matches this tree pattern.
+    #
+    # @param tree The parse tree to match against this tree pattern.
+    # @return {@code true} if {@code tree} is a match for the current tree
+    # pattern; otherwise, {@code false}.
+    #
+    def matches(self, tree:ParseTree):
+        return self.matcher.match(tree, self).succeeded()
+
+    # Find all nodes using XPath and then try to match those subtrees against
+    # this tree pattern.
+    #
+    # @param tree The {@link ParseTree} to match against this pattern.
+    # @param xpath An expression matching the nodes
+    #
+    # @return A collection of {@link ParseTreeMatch} objects describing the
+    # successful matches. Unsuccessful matches are omitted from the result,
+    # regardless of the reason for the failure.
+    #
+    def findAll(self, tree:ParseTree, xpath:str):
+        subtrees = XPath.findAll(tree, xpath, self.matcher.parser)
+        matches = list()
+        for t in subtrees:
+            match = self.match(t)
+            if match.succeeded():
+                matches.append(match)
+        return matches

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/ParseTreePatternMatcher.py

@@ -0,0 +1,374 @@
+#
+# 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.
+#
+
+#
+# A tree pattern matching mechanism for ANTLR {@link ParseTree}s.
+#
+# <p>Patterns are strings of source input text with special tags representing
+# token or rule references such as:</p>
+#
+# <p>{@code <ID> = <expr>;}</p>
+#
+# <p>Given a pattern start rule such as {@code statement}, this object constructs
+# a {@link ParseTree} with placeholders for the {@code ID} and {@code expr}
+# subtree. Then the {@link #match} routines can compare an actual
+# {@link ParseTree} from a parse with this pattern. Tag {@code <ID>} matches
+# any {@code ID} token and tag {@code <expr>} references the result of the
+# {@code expr} rule (generally an instance of {@code ExprContext}.</p>
+#
+# <p>Pattern {@code x = 0;} is a similar pattern that matches the same pattern
+# except that it requires the identifier to be {@code x} and the expression to
+# be {@code 0}.</p>
+#
+# <p>The {@link #matches} routines return {@code true} or {@code false} based
+# upon a match for the tree rooted at the parameter sent in. The
+# {@link #match} routines return a {@link ParseTreeMatch} object that
+# contains the parse tree, the parse tree pattern, and a map from tag name to
+# matched nodes (more below). A subtree that fails to match, returns with
+# {@link ParseTreeMatch#mismatchedNode} set to the first tree node that did not
+# match.</p>
+#
+# <p>For efficiency, you can compile a tree pattern in string form to a
+# {@link ParseTreePattern} object.</p>
+#
+# <p>See {@code TestParseTreeMatcher} for lots of examples.
+# {@link ParseTreePattern} has two static helper methods:
+# {@link ParseTreePattern#findAll} and {@link ParseTreePattern#match} that
+# are easy to use but not super efficient because they create new
+# {@link ParseTreePatternMatcher} objects each time and have to compile the
+# pattern in string form before using it.</p>
+#
+# <p>The lexer and parser that you pass into the {@link ParseTreePatternMatcher}
+# constructor are used to parse the pattern in string form. The lexer converts
+# the {@code <ID> = <expr>;} into a sequence of four tokens (assuming lexer
+# throws out whitespace or puts it on a hidden channel). Be aware that the
+# input stream is reset for the lexer (but not the parser; a
+# {@link ParserInterpreter} is created to parse the input.). Any user-defined
+# fields you have put into the lexer might get changed when this mechanism asks
+# it to scan the pattern string.</p>
+#
+# <p>Normally a parser does not accept token {@code <expr>} as a valid
+# {@code expr} but, from the parser passed in, we create a special version of
+# the underlying grammar representation (an {@link ATN}) that allows imaginary
+# tokens representing rules ({@code <expr>}) to match entire rules. We call
+# these <em>bypass alternatives</em>.</p>
+#
+# <p>Delimiters are {@code <} and {@code >}, with {@code \} as the escape string
+# by default, but you can set them to whatever you want using
+# {@link #setDelimiters}. You must escape both start and stop strings
+# {@code \<} and {@code \>}.</p>
+#
+from antlr4.CommonTokenStream import CommonTokenStream
+from antlr4.InputStream import InputStream
+from antlr4.ParserRuleContext import ParserRuleContext
+from antlr4.Lexer import Lexer
+from antlr4.ListTokenSource import ListTokenSource
+from antlr4.Token import Token
+from antlr4.error.ErrorStrategy import BailErrorStrategy
+from antlr4.error.Errors import RecognitionException, ParseCancellationException
+from antlr4.tree.Chunk import TagChunk, TextChunk
+from antlr4.tree.RuleTagToken import RuleTagToken
+from antlr4.tree.TokenTagToken import TokenTagToken
+from antlr4.tree.Tree import ParseTree, TerminalNode, RuleNode
+
+# need forward declaration
+Parser = None
+ParseTreePattern = None
+
+class CannotInvokeStartRule(Exception):
+
+    def __init__(self, e:Exception):
+        super().__init__(e)
+
+class StartRuleDoesNotConsumeFullPattern(Exception):
+
+    pass
+
+
+class ParseTreePatternMatcher(object):
+    __slots__ = ('lexer', 'parser', 'start', 'stop', 'escape')
+
+    # Constructs a {@link ParseTreePatternMatcher} or from a {@link Lexer} and
+    # {@link Parser} object. The lexer input stream is altered for tokenizing
+    # the tree patterns. The parser is used as a convenient mechanism to get
+    # the grammar name, plus token, rule names.
+    def __init__(self, lexer:Lexer, parser:Parser):
+        self.lexer = lexer
+        self.parser = parser
+        self.start = "<"
+        self.stop = ">"
+        self.escape = "\\"  # e.g., \< and \> must escape BOTH!
+
+    # Set the delimiters used for marking rule and token tags within concrete
+    # syntax used by the tree pattern parser.
+    #
+    # @param start The start delimiter.
+    # @param stop The stop delimiter.
+    # @param escapeLeft The escape sequence to use for escaping a start or stop delimiter.
+    #
+    # @exception IllegalArgumentException if {@code start} is {@code null} or empty.
+    # @exception IllegalArgumentException if {@code stop} is {@code null} or empty.
+    #
+    def setDelimiters(self, start:str, stop:str, escapeLeft:str):
+        if start is None or len(start)==0:
+            raise Exception("start cannot be null or empty")
+        if stop is None or len(stop)==0:
+            raise Exception("stop cannot be null or empty")
+        self.start = start
+        self.stop = stop
+        self.escape = escapeLeft
+
+    # Does {@code pattern} matched as rule {@code patternRuleIndex} match {@code tree}?#
+    def matchesRuleIndex(self, tree:ParseTree, pattern:str, patternRuleIndex:int):
+        p = self.compileTreePattern(pattern, patternRuleIndex)
+        return self.matches(tree, p)
+
+    # Does {@code pattern} matched as rule patternRuleIndex match tree? Pass in a
+    #  compiled pattern instead of a string representation of a tree pattern.
+    #
+    def matchesPattern(self, tree:ParseTree, pattern:ParseTreePattern):
+        mismatchedNode = self.matchImpl(tree, pattern.patternTree, dict())
+        return mismatchedNode is None
+
+    #
+    # Compare {@code pattern} matched as rule {@code patternRuleIndex} against
+    # {@code tree} and return a {@link ParseTreeMatch} object that contains the
+    # matched elements, or the node at which the match failed.
+    #
+    def matchRuleIndex(self, tree:ParseTree, pattern:str, patternRuleIndex:int):
+        p = self.compileTreePattern(pattern, patternRuleIndex)
+        return self.matchPattern(tree, p)
+
+    #
+    # Compare {@code pattern} matched against {@code tree} and return a
+    # {@link ParseTreeMatch} object that contains the matched elements, or the
+    # node at which the match failed. Pass in a compiled pattern instead of a
+    # string representation of a tree pattern.
+    #
+    def matchPattern(self, tree:ParseTree, pattern:ParseTreePattern):
+        labels = dict()
+        mismatchedNode = self.matchImpl(tree, pattern.patternTree, labels)
+        from antlr4.tree.ParseTreeMatch import ParseTreeMatch
+        return ParseTreeMatch(tree, pattern, labels, mismatchedNode)
+
+    #
+    # For repeated use of a tree pattern, compile it to a
+    # {@link ParseTreePattern} using this method.
+    #
+    def compileTreePattern(self, pattern:str, patternRuleIndex:int):
+        tokenList = self.tokenize(pattern)
+        tokenSrc = ListTokenSource(tokenList)
+        tokens = CommonTokenStream(tokenSrc)
+        from antlr4.ParserInterpreter import ParserInterpreter
+        parserInterp = ParserInterpreter(self.parser.grammarFileName, self.parser.tokenNames,
+                                self.parser.ruleNames, self.parser.getATNWithBypassAlts(),tokens)
+        tree = None
+        try:
+            parserInterp.setErrorHandler(BailErrorStrategy())
+            tree = parserInterp.parse(patternRuleIndex)
+        except ParseCancellationException as e:
+            raise e.cause
+        except RecognitionException as e:
+            raise e
+        except Exception as e:
+            raise CannotInvokeStartRule(e)
+
+        # Make sure tree pattern compilation checks for a complete parse
+        if tokens.LA(1)!=Token.EOF:
+            raise StartRuleDoesNotConsumeFullPattern()
+
+        from antlr4.tree.ParseTreePattern import ParseTreePattern
+        return ParseTreePattern(self, pattern, patternRuleIndex, tree)
+
+    #
+    # Recursively walk {@code tree} against {@code patternTree}, filling
+    # {@code match.}{@link ParseTreeMatch#labels labels}.
+    #
+    # @return the first node encountered in {@code tree} which does not match
+    # a corresponding node in {@code patternTree}, or {@code null} if the match
+    # was successful. The specific node returned depends on the matching
+    # algorithm used by the implementation, and may be overridden.
+    #
+    def matchImpl(self, tree:ParseTree, patternTree:ParseTree, labels:dict):
+        if tree is None:
+            raise Exception("tree cannot be null")
+        if patternTree is None:
+            raise Exception("patternTree cannot be null")
+
+        # x and <ID>, x and y, or x and x; or could be mismatched types
+        if isinstance(tree, TerminalNode) and isinstance(patternTree, TerminalNode ):
+            mismatchedNode = None
+            # both are tokens and they have same type
+            if tree.symbol.type == patternTree.symbol.type:
+                if isinstance( patternTree.symbol, TokenTagToken ): # x and <ID>
+                    tokenTagToken = patternTree.symbol
+                    # track label->list-of-nodes for both token name and label (if any)
+                    self.map(labels, tokenTagToken.tokenName, tree)
+                    if tokenTagToken.label is not None:
+                        self.map(labels, tokenTagToken.label, tree)
+                elif tree.getText()==patternTree.getText():
+                    # x and x
+                    pass
+                else:
+                    # x and y
+                    if mismatchedNode is None:
+                        mismatchedNode = tree
+            else:
+                if mismatchedNode is None:
+                    mismatchedNode = tree
+
+            return mismatchedNode
+
+        if isinstance(tree, ParserRuleContext) and isinstance(patternTree, ParserRuleContext):
+            mismatchedNode = None
+            # (expr ...) and <expr>
+            ruleTagToken = self.getRuleTagToken(patternTree)
+            if ruleTagToken is not None:
+                m = None
+                if tree.ruleContext.ruleIndex == patternTree.ruleContext.ruleIndex:
+                    # track label->list-of-nodes for both rule name and label (if any)
+                    self.map(labels, ruleTagToken.ruleName, tree)
+                    if ruleTagToken.label is not None:
+                        self.map(labels, ruleTagToken.label, tree)
+                else:
+                    if mismatchedNode is None:
+                        mismatchedNode = tree
+
+                return mismatchedNode
+
+            # (expr ...) and (expr ...)
+            if tree.getChildCount()!=patternTree.getChildCount():
+                if mismatchedNode is None:
+                    mismatchedNode = tree
+                return mismatchedNode
+
+            n = tree.getChildCount()
+            for i in range(0, n):
+                childMatch = self.matchImpl(tree.getChild(i), patternTree.getChild(i), labels)
+                if childMatch is not None:
+                    return childMatch
+
+            return mismatchedNode
+
+        # if nodes aren't both tokens or both rule nodes, can't match
+        return tree
+
+    def map(self, labels, label, tree):
+        v = labels.get(label, None)
+        if v is None:
+            v = list()
+            labels[label] = v
+        v.append(tree)
+
+    # Is {@code t} {@code (expr <expr>)} subtree?#
+    def getRuleTagToken(self, tree:ParseTree):
+        if isinstance( tree, RuleNode ):
+            if tree.getChildCount()==1 and isinstance(tree.getChild(0), TerminalNode ):
+                c = tree.getChild(0)
+                if isinstance( c.symbol, RuleTagToken ):
+                    return c.symbol
+        return None
+
+    def tokenize(self, pattern:str):
+        # split pattern into chunks: sea (raw input) and islands (<ID>, <expr>)
+        chunks = self.split(pattern)
+
+        # create token stream from text and tags
+        tokens = list()
+        for chunk in chunks:
+            if isinstance( chunk, TagChunk ):
+                # add special rule token or conjure up new token from name
+                if chunk.tag[0].isupper():
+                    ttype = self.parser.getTokenType(chunk.tag)
+                    if ttype==Token.INVALID_TYPE:
+                        raise Exception("Unknown token " + str(chunk.tag) + " in pattern: " + pattern)
+                    tokens.append(TokenTagToken(chunk.tag, ttype, chunk.label))
+                elif chunk.tag[0].islower():
+                    ruleIndex = self.parser.getRuleIndex(chunk.tag)
+                    if ruleIndex==-1:
+                        raise Exception("Unknown rule " + str(chunk.tag) + " in pattern: " + pattern)
+                    ruleImaginaryTokenType = self.parser.getATNWithBypassAlts().ruleToTokenType[ruleIndex]
+                    tokens.append(RuleTagToken(chunk.tag, ruleImaginaryTokenType, chunk.label))
+                else:
+                    raise Exception("invalid tag: " + str(chunk.tag) + " in pattern: " + pattern)
+            else:
+                self.lexer.setInputStream(InputStream(chunk.text))
+                t = self.lexer.nextToken()
+                while t.type!=Token.EOF:
+                    tokens.append(t)
+                    t = self.lexer.nextToken()
+        return tokens
+
+    # Split {@code <ID> = <e:expr> ;} into 4 chunks for tokenizing by {@link #tokenize}.#
+    def split(self, pattern:str):
+        p = 0
+        n = len(pattern)
+        chunks = list()
+        # find all start and stop indexes first, then collect
+        starts = list()
+        stops = list()
+        while p < n :
+            if p == pattern.find(self.escape + self.start, p):
+                p += len(self.escape) + len(self.start)
+            elif p == pattern.find(self.escape + self.stop, p):
+                p += len(self.escape) + len(self.stop)
+            elif p == pattern.find(self.start, p):
+                starts.append(p)
+                p += len(self.start)
+            elif p == pattern.find(self.stop, p):
+                stops.append(p)
+                p += len(self.stop)
+            else:
+                p += 1
+
+        nt = len(starts)
+
+        if nt > len(stops):
+            raise Exception("unterminated tag in pattern: " + pattern)
+        if nt < len(stops):
+            raise Exception("missing start tag in pattern: " + pattern)
+
+        for i in range(0, nt):
+            if starts[i] >= stops[i]:
+                raise Exception("tag delimiters out of order in pattern: " + pattern)
+
+        # collect into chunks now
+        if nt==0:
+            chunks.append(TextChunk(pattern))
+
+        if nt>0 and starts[0]>0: # copy text up to first tag into chunks
+            text = pattern[0:starts[0]]
+            chunks.add(TextChunk(text))
+
+        for i in range(0, nt):
+            # copy inside of <tag>
+            tag = pattern[starts[i] + len(self.start) : stops[i]]
+            ruleOrToken = tag
+            label = None
+            colon = tag.find(':')
+            if colon >= 0:
+                label = tag[0:colon]
+                ruleOrToken = tag[colon+1 : len(tag)]
+            chunks.append(TagChunk(label, ruleOrToken))
+            if i+1 < len(starts):
+                # copy from end of <tag> to start of next
+                text = pattern[stops[i] + len(self.stop) : starts[i + 1]]
+                chunks.append(TextChunk(text))
+
+        if nt > 0 :
+            afterLastTag = stops[nt - 1] + len(self.stop)
+            if afterLastTag < n : # copy text from end of last tag to end
+                text = pattern[afterLastTag : n]
+                chunks.append(TextChunk(text))
+
+        # strip out the escape sequences from text chunks but not tags
+        for i in range(0, len(chunks)):
+            c = chunks[i]
+            if isinstance( c, TextChunk ):
+                unescaped = c.text.replace(self.escape, "")
+                if len(unescaped) < len(c.text):
+                    chunks[i] = TextChunk(unescaped)
+        return chunks

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/RuleTagToken.py

@@ -0,0 +1,50 @@
+#
+# 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.
+#
+
+#
+# A {@link Token} object representing an entire subtree matched by a parser
+# rule; e.g., {@code <expr>}. These tokens are created for {@link TagChunk}
+# chunks where the tag corresponds to a parser rule.
+#
+from antlr4.Token import Token
+
+
+class RuleTagToken(Token):
+    __slots__ = ('label', 'ruleName')
+    #
+    # Constructs a new instance of {@link RuleTagToken} with the specified rule
+    # name, bypass token type, and label.
+    #
+    # @param ruleName The name of the parser rule this rule tag matches.
+    # @param bypassTokenType The bypass token type assigned to the parser rule.
+    # @param label The label associated with the rule tag, or {@code null} if
+    # the rule tag is unlabeled.
+    #
+    # @exception IllegalArgumentException if {@code ruleName} is {@code null}
+    # or empty.
+
+    def __init__(self, ruleName:str, bypassTokenType:int, label:str=None):
+        if ruleName is None or len(ruleName)==0:
+            raise Exception("ruleName cannot be null or empty.")
+        self.source = None
+        self.type = bypassTokenType # token type of the token
+        self.channel = Token.DEFAULT_CHANNEL # The parser ignores everything not on DEFAULT_CHANNEL
+        self.start = -1 # optional; return -1 if not implemented.
+        self.stop = -1  # optional; return -1 if not implemented.
+        self.tokenIndex = -1 # from 0..n-1 of the token object in the input stream
+        self.line = 0 # line=1..n of the 1st character
+        self.column = -1 # beginning of the line at which it occurs, 0..n-1
+        self.label = label
+        self._text = self.getText() # text of the token.
+
+        self.ruleName = ruleName
+
+
+    def getText(self):
+        if self.label is None:
+            return "<" + self.ruleName + ">"
+        else:
+            return "<" + self.label + ":" + self.ruleName + ">"

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/TokenTagToken.py

@@ -0,0 +1,47 @@
+#
+# 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.
+#
+
+#
+# A {@link Token} object representing a token of a particular type; e.g.,
+# {@code <ID>}. These tokens are created for {@link TagChunk} chunks where the
+# tag corresponds to a lexer rule or token type.
+#
+from antlr4.Token import CommonToken
+
+
+class TokenTagToken(CommonToken):
+    __slots__ = ('tokenName', 'label')
+    # Constructs a new instance of {@link TokenTagToken} with the specified
+    # token name, type, and label.
+    #
+    # @param tokenName The token name.
+    # @param type The token type.
+    # @param label The label associated with the token tag, or {@code null} if
+    # the token tag is unlabeled.
+    #
+    def __init__(self, tokenName:str, type:int, label:str=None):
+        super().__init__(type=type)
+        self.tokenName = tokenName
+        self.label = label
+        self._text = self.getText()
+
+    #
+    # {@inheritDoc}
+    #
+    # <p>The implementation for {@link TokenTagToken} returns the token tag
+    # formatted with {@code <} and {@code >} delimiters.</p>
+    #
+    def getText(self):
+        if self.label is None:
+            return "<" + self.tokenName + ">"
+        else:
+            return "<" + self.label + ":" + self.tokenName + ">"
+
+    # <p>The implementation for {@link TokenTagToken} returns a string of the form
+    # {@code tokenName:type}.</p>
+    #
+    def __str__(self):
+        return self.tokenName + ":" + str(self.type)

evalkit_tf437/lib/python3.10/site-packages/antlr4/tree/Tree.py

@@ -0,0 +1,191 @@
+# 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.
+#/
+
+
+# The basic notion of a tree has a parent, a payload, and a list of children.
+#  It is the most abstract interface for all the trees used by ANTLR.
+#/
+from antlr4.Token import Token
+
+INVALID_INTERVAL = (-1, -2)
+
+class Tree(object):
+    pass
+
+class SyntaxTree(Tree):
+    pass
+
+class ParseTree(SyntaxTree):
+    pass
+
+class RuleNode(ParseTree):
+    pass
+
+class TerminalNode(ParseTree):
+    pass
+
+class ErrorNode(TerminalNode):
+    pass
+
+class ParseTreeVisitor(object):
+    def visit(self, tree):
+        return tree.accept(self)
+
+    def visitChildren(self, node):
+        result = self.defaultResult()
+        n = node.getChildCount()
+        for i in range(n):
+            if not self.shouldVisitNextChild(node, result):
+                return result
+
+            c = node.getChild(i)
+            childResult = c.accept(self)
+            result = self.aggregateResult(result, childResult)
+
+        return result
+
+    def visitTerminal(self, node):
+        return self.defaultResult()
+
+    def visitErrorNode(self, node):
+        return self.defaultResult()
+
+    def defaultResult(self):
+        return None
+
+    def aggregateResult(self, aggregate, nextResult):
+        return nextResult
+
+    def shouldVisitNextChild(self, node, currentResult):
+        return True
+
+ParserRuleContext = None
+
+class ParseTreeListener(object):
+
+    def visitTerminal(self, node:TerminalNode):
+        pass
+
+    def visitErrorNode(self, node:ErrorNode):
+        pass
+
+    def enterEveryRule(self, ctx:ParserRuleContext):
+        pass
+
+    def exitEveryRule(self, ctx:ParserRuleContext):
+        pass
+
+del ParserRuleContext
+
+class TerminalNodeImpl(TerminalNode):
+    __slots__ = ('parentCtx', 'symbol')
+
+    def __init__(self, symbol:Token):
+        self.parentCtx = None
+        self.symbol = symbol
+    def __setattr__(self, key, value):
+        super().__setattr__(key, value)
+
+    def getChild(self, i:int):
+        return None
+
+    def getSymbol(self):
+        return self.symbol
+
+    def getParent(self):
+        return self.parentCtx
+
+    def getPayload(self):
+        return self.symbol
+
+    def getSourceInterval(self):
+        if self.symbol is None:
+            return INVALID_INTERVAL
+        tokenIndex = self.symbol.tokenIndex
+        return (tokenIndex, tokenIndex)
+
+    def getChildCount(self):
+        return 0
+
+    def accept(self, visitor:ParseTreeVisitor):
+        return visitor.visitTerminal(self)
+
+    def getText(self):
+        return self.symbol.text
+
+    def __str__(self):
+        if self.symbol.type == Token.EOF:
+            return "<EOF>"
+        else:
+            return self.symbol.text
+
+# Represents a token that was consumed during resynchronization
+#  rather than during a valid match operation. For example,
+#  we will create this kind of a node during single token insertion
+#  and deletion as well as during "consume until error recovery set"
+#  upon no viable alternative exceptions.
+
+class ErrorNodeImpl(TerminalNodeImpl,ErrorNode):
+
+    def __init__(self, token:Token):
+        super().__init__(token)
+
+    def accept(self, visitor:ParseTreeVisitor):
+        return visitor.visitErrorNode(self)
+
+
+class ParseTreeWalker(object):
+
+    DEFAULT = None
+
+    def walk(self, listener:ParseTreeListener, t:ParseTree):
+        """
+	    Performs a walk on the given parse tree starting at the root and going down recursively
+	    with depth-first search. On each node, {@link ParseTreeWalker#enterRule} is called before
+	    recursively walking down into child nodes, then
+	    {@link ParseTreeWalker#exitRule} is called after the recursive call to wind up.
+	    @param listener The listener used by the walker to process grammar rules
+	    @param t The parse tree to be walked on
+        """
+        if isinstance(t, ErrorNode):
+            listener.visitErrorNode(t)
+            return
+        elif isinstance(t, TerminalNode):
+            listener.visitTerminal(t)
+            return
+        self.enterRule(listener, t)
+        for child in t.getChildren():
+            self.walk(listener, child)
+        self.exitRule(listener, t)
+
+    #
+    # The discovery of a rule node, involves sending two events: the generic
+    # {@link ParseTreeListener#enterEveryRule} and a
+    # {@link RuleContext}-specific event. First we trigger the generic and then
+    # the rule specific. We to them in reverse order upon finishing the node.
+    #
+    def enterRule(self, listener:ParseTreeListener, r:RuleNode):
+        """
+	    Enters a grammar rule by first triggering the generic event {@link ParseTreeListener#enterEveryRule}
+	    then by triggering the event specific to the given parse tree node
+	    @param listener The listener responding to the trigger events
+	    @param r The grammar rule containing the rule context
+        """
+        ctx = r.getRuleContext()
+        listener.enterEveryRule(ctx)
+        ctx.enterRule(listener)
+
+    def exitRule(self, listener:ParseTreeListener, r:RuleNode):
+        """
+	    Exits a grammar rule by first triggering the event specific to the given parse tree node
+	    then by triggering the generic event {@link ParseTreeListener#exitEveryRule}
+	    @param listener The listener responding to the trigger events
+	    @param r The grammar rule containing the rule context
+        """
+        ctx = r.getRuleContext()
+        ctx.exitRule(listener)
+        listener.exitEveryRule(ctx)
+
+ParseTreeWalker.DEFAULT = ParseTreeWalker()

evalkit_tf437/lib/python3.10/site-packages/flash_attn-2.6.1.dist-info/INSTALLER

@@ -0,0 +1 @@
+pip