omlish 0.0.0.dev57__py3-none-any.whl → 0.0.0.dev58__py3-none-any.whl

omlish/antlr/_runtime/atn/ATNDeserializer.py

@@ -0,0 +1,449 @@
+# type: ignore
+# ruff: noqa
+# flake8: noqa
+# 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 typing import Callable
+from ..Token import Token
+from .ATN import ATN
+from .ATNType import ATNType
+from .ATNState import *
+from .Transition import *
+from .LexerAction import *
+from .ATNDeserializationOptions import ATNDeserializationOptions
+
+SERIALIZED_VERSION = 4
+
+class ATNDeserializer (object):
+    __slots__ = ('deserializationOptions', 'data', 'pos')
+
+    def __init__(self, options : ATNDeserializationOptions = None):
+        if options is None:
+            options = ATNDeserializationOptions.defaultOptions
+        self.deserializationOptions = options
+
+    def deserialize(self, data : [int]):
+        self.data = data
+        self.pos = 0
+        self.checkVersion()
+        atn = self.readATN()
+        self.readStates(atn)
+        self.readRules(atn)
+        self.readModes(atn)
+        sets = []
+        self.readSets(atn, sets)
+        self.readEdges(atn, sets)
+        self.readDecisions(atn)
+        self.readLexerActions(atn)
+        self.markPrecedenceDecisions(atn)
+        self.verifyATN(atn)
+        if self.deserializationOptions.generateRuleBypassTransitions \
+                and atn.grammarType == ATNType.PARSER:
+            self.generateRuleBypassTransitions(atn)
+            # re-verify after modification
+            self.verifyATN(atn)
+        return atn
+
+    def checkVersion(self):
+        version = self.readInt()
+        if version != SERIALIZED_VERSION:
+            raise Exception("Could not deserialize ATN with version " + str(version) + " (expected " + str(SERIALIZED_VERSION) + ").")
+
+    def readATN(self):
+        idx = self.readInt()
+        grammarType = ATNType.fromOrdinal(idx)
+        maxTokenType = self.readInt()
+        return ATN(grammarType, maxTokenType)
+
+    def readStates(self, atn:ATN):
+        loopBackStateNumbers = []
+        endStateNumbers = []
+        nstates = self.readInt()
+        for i in range(0, nstates):
+            stype = self.readInt()
+            # ignore bad type of states
+            if stype==ATNState.INVALID_TYPE:
+                atn.addState(None)
+                continue
+            ruleIndex = self.readInt()
+            s = self.stateFactory(stype, ruleIndex)
+            if stype == ATNState.LOOP_END: # special case
+                loopBackStateNumber = self.readInt()
+                loopBackStateNumbers.append((s, loopBackStateNumber))
+            elif isinstance(s, BlockStartState):
+                endStateNumber = self.readInt()
+                endStateNumbers.append((s, endStateNumber))
+
+            atn.addState(s)
+
+        # delay the assignment of loop back and end states until we know all the state instances have been initialized
+        for pair in loopBackStateNumbers:
+            pair[0].loopBackState = atn.states[pair[1]]
+
+        for pair in endStateNumbers:
+            pair[0].endState = atn.states[pair[1]]
+
+        numNonGreedyStates = self.readInt()
+        for i in range(0, numNonGreedyStates):
+            stateNumber = self.readInt()
+            atn.states[stateNumber].nonGreedy = True
+
+        numPrecedenceStates = self.readInt()
+        for i in range(0, numPrecedenceStates):
+            stateNumber = self.readInt()
+            atn.states[stateNumber].isPrecedenceRule = True
+
+    def readRules(self, atn:ATN):
+        nrules = self.readInt()
+        if atn.grammarType == ATNType.LEXER:
+            atn.ruleToTokenType = [0] * nrules
+
+        atn.ruleToStartState = [0] * nrules
+        for i in range(0, nrules):
+            s = self.readInt()
+            startState = atn.states[s]
+            atn.ruleToStartState[i] = startState
+            if atn.grammarType == ATNType.LEXER:
+                tokenType = self.readInt()
+                atn.ruleToTokenType[i] = tokenType
+
+        atn.ruleToStopState = [0] * nrules
+        for state in atn.states:
+            if not isinstance(state, RuleStopState):
+                continue
+            atn.ruleToStopState[state.ruleIndex] = state
+            atn.ruleToStartState[state.ruleIndex].stopState = state
+
+    def readModes(self, atn:ATN):
+        nmodes = self.readInt()
+        for i in range(0, nmodes):
+            s = self.readInt()
+            atn.modeToStartState.append(atn.states[s])
+
+    def readSets(self, atn:ATN, sets:list):
+        m = self.readInt()
+        for i in range(0, m):
+            iset = IntervalSet()
+            sets.append(iset)
+            n = self.readInt()
+            containsEof = self.readInt()
+            if containsEof!=0:
+                iset.addOne(-1)
+            for j in range(0, n):
+                i1 = self.readInt()
+                i2 = self.readInt()
+                iset.addRange(range(i1, i2 + 1)) # range upper limit is exclusive
+
+    def readEdges(self, atn:ATN, sets:list):
+        nedges = self.readInt()
+        for i in range(0, nedges):
+            src = self.readInt()
+            trg = self.readInt()
+            ttype = self.readInt()
+            arg1 = self.readInt()
+            arg2 = self.readInt()
+            arg3 = self.readInt()
+            trans = self.edgeFactory(atn, ttype, src, trg, arg1, arg2, arg3, sets)
+            srcState = atn.states[src]
+            srcState.addTransition(trans)
+
+        # edges for rule stop states can be derived, so they aren't serialized
+        for state in atn.states:
+            for i in range(0, len(state.transitions)):
+                t = state.transitions[i]
+                if not isinstance(t, RuleTransition):
+                    continue
+                outermostPrecedenceReturn = -1
+                if atn.ruleToStartState[t.target.ruleIndex].isPrecedenceRule:
+                    if t.precedence == 0:
+                        outermostPrecedenceReturn = t.target.ruleIndex
+                trans = EpsilonTransition(t.followState, outermostPrecedenceReturn)
+                atn.ruleToStopState[t.target.ruleIndex].addTransition(trans)
+
+        for state in atn.states:
+            if isinstance(state, BlockStartState):
+                # we need to know the end state to set its start state
+                if state.endState is None:
+                    raise Exception("IllegalState")
+                # block end states can only be associated to a single block start state
+                if state.endState.startState is not None:
+                    raise Exception("IllegalState")
+                state.endState.startState = state
+
+            if isinstance(state, PlusLoopbackState):
+                for i in range(0, len(state.transitions)):
+                    target = state.transitions[i].target
+                    if isinstance(target, PlusBlockStartState):
+                        target.loopBackState = state
+            elif isinstance(state, StarLoopbackState):
+                for i in range(0, len(state.transitions)):
+                    target = state.transitions[i].target
+                    if isinstance(target, StarLoopEntryState):
+                        target.loopBackState = state
+
+    def readDecisions(self, atn:ATN):
+        ndecisions = self.readInt()
+        for i in range(0, ndecisions):
+            s = self.readInt()
+            decState = atn.states[s]
+            atn.decisionToState.append(decState)
+            decState.decision = i
+
+    def readLexerActions(self, atn:ATN):
+        if atn.grammarType == ATNType.LEXER:
+            count = self.readInt()
+            atn.lexerActions = [ None ] * count
+            for i in range(0, count):
+                actionType = self.readInt()
+                data1 = self.readInt()
+                data2 = self.readInt()
+                lexerAction = self.lexerActionFactory(actionType, data1, data2)
+                atn.lexerActions[i] = lexerAction
+
+    def generateRuleBypassTransitions(self, atn:ATN):
+
+        count = len(atn.ruleToStartState)
+        atn.ruleToTokenType = [ 0 ] * count
+        for i in range(0, count):
+            atn.ruleToTokenType[i] = atn.maxTokenType + i + 1
+
+        for i in range(0, count):
+            self.generateRuleBypassTransition(atn, i)
+
+    def generateRuleBypassTransition(self, atn:ATN, idx:int):
+
+        bypassStart = BasicBlockStartState()
+        bypassStart.ruleIndex = idx
+        atn.addState(bypassStart)
+
+        bypassStop = BlockEndState()
+        bypassStop.ruleIndex = idx
+        atn.addState(bypassStop)
+
+        bypassStart.endState = bypassStop
+        atn.defineDecisionState(bypassStart)
+
+        bypassStop.startState = bypassStart
+
+        excludeTransition = None
+
+        if atn.ruleToStartState[idx].isPrecedenceRule:
+            # wrap from the beginning of the rule to the StarLoopEntryState
+            endState = None
+            for state in atn.states:
+                if self.stateIsEndStateFor(state, idx):
+                    endState = state
+                    excludeTransition = state.loopBackState.transitions[0]
+                    break
+
+            if excludeTransition is None:
+                raise Exception("Couldn't identify final state of the precedence rule prefix section.")
+
+        else:
+
+            endState = atn.ruleToStopState[idx]
+
+        # all non-excluded transitions that currently target end state need to target blockEnd instead
+        for state in atn.states:
+            for transition in state.transitions:
+                if transition == excludeTransition:
+                    continue
+                if transition.target == endState:
+                    transition.target = bypassStop
+
+        # all transitions leaving the rule start state need to leave blockStart instead
+        ruleToStartState = atn.ruleToStartState[idx]
+        count = len(ruleToStartState.transitions)
+        while count > 0:
+            bypassStart.addTransition(ruleToStartState.transitions[count-1])
+            del ruleToStartState.transitions[-1]
+
+        # link the new states
+        atn.ruleToStartState[idx].addTransition(EpsilonTransition(bypassStart))
+        bypassStop.addTransition(EpsilonTransition(endState))
+
+        matchState = BasicState()
+        atn.addState(matchState)
+        matchState.addTransition(AtomTransition(bypassStop, atn.ruleToTokenType[idx]))
+        bypassStart.addTransition(EpsilonTransition(matchState))
+
+
+    def stateIsEndStateFor(self, state:ATNState, idx:int):
+        if state.ruleIndex != idx:
+            return None
+        if not isinstance(state, StarLoopEntryState):
+            return None
+
+        maybeLoopEndState = state.transitions[len(state.transitions) - 1].target
+        if not isinstance(maybeLoopEndState, LoopEndState):
+            return None
+
+        if maybeLoopEndState.epsilonOnlyTransitions and \
+                isinstance(maybeLoopEndState.transitions[0].target, RuleStopState):
+            return state
+        else:
+            return None
+
+
+    #
+    # Analyze the {@link StarLoopEntryState} states in the specified ATN to set
+    # the {@link StarLoopEntryState#isPrecedenceDecision} field to the
+    # correct value.
+    #
+    # @param atn The ATN.
+    #
+    def markPrecedenceDecisions(self, atn:ATN):
+        for state in atn.states:
+            if not isinstance(state, StarLoopEntryState):
+                continue
+
+            # We analyze the ATN to determine if this ATN decision state is the
+            # decision for the closure block that determines whether a
+            # precedence rule should continue or complete.
+            #
+            if atn.ruleToStartState[state.ruleIndex].isPrecedenceRule:
+                maybeLoopEndState = state.transitions[len(state.transitions) - 1].target
+                if isinstance(maybeLoopEndState, LoopEndState):
+                    if maybeLoopEndState.epsilonOnlyTransitions and \
+                            isinstance(maybeLoopEndState.transitions[0].target, RuleStopState):
+                        state.isPrecedenceDecision = True
+
+    def verifyATN(self, atn:ATN):
+        if not self.deserializationOptions.verifyATN:
+            return
+        # verify assumptions
+        for state in atn.states:
+            if state is None:
+                continue
+
+            self.checkCondition(state.epsilonOnlyTransitions or len(state.transitions) <= 1)
+
+            if isinstance(state, PlusBlockStartState):
+                self.checkCondition(state.loopBackState is not None)
+
+            if isinstance(state, StarLoopEntryState):
+                self.checkCondition(state.loopBackState is not None)
+                self.checkCondition(len(state.transitions) == 2)
+
+                if isinstance(state.transitions[0].target, StarBlockStartState):
+                    self.checkCondition(isinstance(state.transitions[1].target, LoopEndState))
+                    self.checkCondition(not state.nonGreedy)
+                elif isinstance(state.transitions[0].target, LoopEndState):
+                    self.checkCondition(isinstance(state.transitions[1].target, StarBlockStartState))
+                    self.checkCondition(state.nonGreedy)
+                else:
+                    raise Exception("IllegalState")
+
+            if isinstance(state, StarLoopbackState):
+                self.checkCondition(len(state.transitions) == 1)
+                self.checkCondition(isinstance(state.transitions[0].target, StarLoopEntryState))
+
+            if isinstance(state, LoopEndState):
+                self.checkCondition(state.loopBackState is not None)
+
+            if isinstance(state, RuleStartState):
+                self.checkCondition(state.stopState is not None)
+
+            if isinstance(state, BlockStartState):
+                self.checkCondition(state.endState is not None)
+
+            if isinstance(state, BlockEndState):
+                self.checkCondition(state.startState is not None)
+
+            if isinstance(state, DecisionState):
+                self.checkCondition(len(state.transitions) <= 1 or state.decision >= 0)
+            else:
+                self.checkCondition(len(state.transitions) <= 1 or isinstance(state, RuleStopState))
+
+    def checkCondition(self, condition:bool, message=None):
+        if not condition:
+            if message is None:
+                message = "IllegalState"
+            raise Exception(message)
+
+    def readInt(self):
+        i = self.data[self.pos]
+        self.pos += 1
+        return i
+
+    edgeFactories = [ lambda args : None,
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : EpsilonTransition(target),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        RangeTransition(target, Token.EOF, arg2) if arg3 != 0 else RangeTransition(target, arg1, arg2),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        RuleTransition(atn.states[arg1], arg2, arg3, target),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        PredicateTransition(target, arg1, arg2, arg3 != 0),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        AtomTransition(target, Token.EOF) if arg3 != 0 else AtomTransition(target, arg1),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        ActionTransition(target, arg1, arg2, arg3 != 0),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        SetTransition(target, sets[arg1]),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        NotSetTransition(target, sets[arg1]),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        WildcardTransition(target),
+                      lambda atn, src, trg, arg1, arg2, arg3, sets, target : \
+                        PrecedencePredicateTransition(target, arg1)
+                      ]
+
+    def edgeFactory(self, atn:ATN, type:int, src:int, trg:int, arg1:int, arg2:int, arg3:int, sets:list):
+        target = atn.states[trg]
+        if type > len(self.edgeFactories) or self.edgeFactories[type] is None:
+            raise Exception("The specified transition type: " + str(type) + " is not valid.")
+        else:
+            return self.edgeFactories[type](atn, src, trg, arg1, arg2, arg3, sets, target)
+
+    stateFactories = [  lambda : None,
+                        lambda : BasicState(),
+                        lambda : RuleStartState(),
+                        lambda : BasicBlockStartState(),
+                        lambda : PlusBlockStartState(),
+                        lambda : StarBlockStartState(),
+                        lambda : TokensStartState(),
+                        lambda : RuleStopState(),
+                        lambda : BlockEndState(),
+                        lambda : StarLoopbackState(),
+                        lambda : StarLoopEntryState(),
+                        lambda : PlusLoopbackState(),
+                        lambda : LoopEndState()
+                    ]
+
+    def stateFactory(self, type:int, ruleIndex:int):
+        if type> len(self.stateFactories) or self.stateFactories[type] is None:
+            raise Exception("The specified state type " + str(type) + " is not valid.")
+        else:
+            s = self.stateFactories[type]()
+            if s is not None:
+                s.ruleIndex = ruleIndex
+        return s
+
+    CHANNEL = 0     #The type of a {@link LexerChannelAction} action.
+    CUSTOM = 1      #The type of a {@link LexerCustomAction} action.
+    MODE = 2        #The type of a {@link LexerModeAction} action.
+    MORE = 3        #The type of a {@link LexerMoreAction} action.
+    POP_MODE = 4    #The type of a {@link LexerPopModeAction} action.
+    PUSH_MODE = 5   #The type of a {@link LexerPushModeAction} action.
+    SKIP = 6        #The type of a {@link LexerSkipAction} action.
+    TYPE = 7        #The type of a {@link LexerTypeAction} action.
+
+    actionFactories = [ lambda data1, data2: LexerChannelAction(data1),
+                        lambda data1, data2: LexerCustomAction(data1, data2),
+                        lambda data1, data2: LexerModeAction(data1),
+                        lambda data1, data2: LexerMoreAction.INSTANCE,
+                        lambda data1, data2: LexerPopModeAction.INSTANCE,
+                        lambda data1, data2: LexerPushModeAction(data1),
+                        lambda data1, data2: LexerSkipAction.INSTANCE,
+                        lambda data1, data2: LexerTypeAction(data1)
+                      ]
+
+    def lexerActionFactory(self, type:int, data1:int, data2:int):
+
+        if type > len(self.actionFactories) or self.actionFactories[type] is None:
+            raise Exception("The specified lexer action type " + str(type) + " is not valid.")
+        else:
+            return self.actionFactories[type](data1, data2)

omlish/antlr/_runtime/atn/ATNSimulator.py

@@ -0,0 +1,50 @@
+# type: ignore
+# ruff: noqa
+# flake8: noqa
+#
+# 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 ..PredictionContext import PredictionContextCache, PredictionContext, getCachedPredictionContext
+from .ATN import ATN
+from .ATNConfigSet import ATNConfigSet
+from ..dfa.DFAState import DFAState
+
+
+class ATNSimulator(object):
+    __slots__ = ('atn', 'sharedContextCache', '__dict__')
+
+    # Must distinguish between missing edge and edge we know leads nowhere#/
+    ERROR = DFAState(configs=ATNConfigSet())
+    ERROR.stateNumber = 0x7FFFFFFF
+
+    # The context cache maps all PredictionContext objects that are ==
+    #  to a single cached copy. This cache is shared across all contexts
+    #  in all ATNConfigs in all DFA states.  We rebuild each ATNConfigSet
+    #  to use only cached nodes/graphs in addDFAState(). We don't want to
+    #  fill this during closure() since there are lots of contexts that
+    #  pop up but are not used ever again. It also greatly slows down closure().
+    #
+    #  <p>This cache makes a huge difference in memory and a little bit in speed.
+    #  For the Java grammar on java.*, it dropped the memory requirements
+    #  at the end from 25M to 16M. We don't store any of the full context
+    #  graphs in the DFA because they are limited to local context only,
+    #  but apparently there's a lot of repetition there as well. We optimize
+    #  the config contexts before storing the config set in the DFA states
+    #  by literally rebuilding them with cached subgraphs only.</p>
+    #
+    #  <p>I tried a cache for use during closure operations, that was
+    #  whacked after each adaptivePredict(). It cost a little bit
+    #  more time I think and doesn't save on the overall footprint
+    #  so it's not worth the complexity.</p>
+    #/
+    def __init__(self, atn:ATN, sharedContextCache:PredictionContextCache):
+        self.atn = atn
+        self.sharedContextCache = sharedContextCache
+
+    def getCachedContext(self, context:PredictionContext):
+        if self.sharedContextCache is None:
+            return context
+        visited = dict()
+        return getCachedPredictionContext(context, self.sharedContextCache, visited)