| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| AnalysisRecursionOverflowException.java | 32 public DFAState ovfState;
34 public AnalysisRecursionOverflowException(DFAState ovfState,
|
| MachineProbe.java | 48 List<DFAState> getAnyDFAPathToTarget(DFAState targetState) {
49 Set<DFAState> visited = new HashSet<DFAState>();
53 public List<DFAState> getAnyDFAPathToTarget(DFAState startState,
54 DFAState targetState, Set<DFAState> visited) {
55 List<DFAState> dfaStates = new ArrayList<DFAState>();
[all...] |
| DecisionProbe.java | 57 * as having multiple flaws each one uniquely identified by a DFAState.
65 * getSampleNonDeterministicInputSequence() require a DFAState. This state
82 protected Set<DFAState> statesWithSyntacticallyAmbiguousAltsSet = new HashSet<DFAState>();
89 protected Map<DFAState, Set<Integer>> stateToSyntacticallyAmbiguousTokensRuleAltsMap =
90 new HashMap<DFAState, Set<Integer>>();
96 protected Set<DFAState> statesResolvedWithSemanticPredicatesSet = new HashSet<DFAState>();
103 protected Map<DFAState, Map<Integer,SemanticContext>> stateToAltSetWithSemanticPredicatesMap =
104 new HashMap<DFAState, Map<Integer,SemanticContext>>()
[all...] |
| DFA.java | 68 public DFAState startState;
79 /** A set of all uniquely-numbered DFA states. Maps hash of DFAState
80 * to the actual DFAState object. We use this to detect
81 * existing DFA states. Map<DFAState,DFAState>. Use Map so
86 protected Map<DFAState, DFAState> uniqueStates = new HashMap<DFAState, DFAState>();
88 /** Maps the state number to the actual DFAState. Use a Vector as i
[all...] |
| DFAOptimizer.java | 184 protected void optimizeExitBranches(DFAState d) {
193 DFAState edgeTarget = ((DFAState)edge.target);
214 protected void optimizeEOTBranches(DFAState d) {
222 DFAState edgeTarget = ((DFAState)edge.target);
250 protected void unlinkUnneededStateData(DFAState d) {
259 DFAState edgeTarget = ((DFAState)edge.target);
|
| NFAToDFAConverter.java | 86 DFAState d = (DFAState) work.get(0);
139 protected DFAState computeStartState() {
141 DFAState startState = dfa.newState();
201 protected void findNewDFAStatesAndAddDFATransitions(DFAState d) {
256 DFAState t = reach(d, EOTLabel);
275 DFAState t = reach(d, label);
306 DFAState targetState = addDFAStateToWorkList(t);
408 protected static int addTransition(DFAState d,
410 DFAState targetState
[all...] |
| LL1DFA.java | 52 DFAState s0 = newState();
61 DFAState acceptAltState = newState();
78 DFAState s0 = newState();
91 DFAState s = newState();
108 DFAState predDFATarget = getAcceptState(alt);
|
| DFAState.java | 65 public class DFAState extends State {
165 public DFAState(DFA dfa) {
191 public int addTransition(DFAState target, Label label) {
389 * This is used when we add DFAState objects to the DFA.states Map and
410 * configurations. The DFAState state number is irrelevant.
414 DFAState other = (DFAState)o;
|
| /external/skia/src/sksl/lex/ |
| DFAState.h | 13 struct DFAState {
41 DFAState()
45 DFAState(int id, Label label)
49 DFAState(const DFAState& other) = delete;
59 template<> struct hash<DFAState::Label> {
60 size_t operator()(const DFAState::Label& s) const {
|
| NFAtoDFA.h | 9 #include "DFAState.h"
43 getState(DFAState::Label({}));
48 DFAState* start = getState(DFAState::Label(startStates));
64 DFAState* getState(DFAState::Label label) {
68 fStates[label] = std::unique_ptr<DFAState>(new DFAState(id, label));
101 void scanState(DFAState* state) {
118 DFAState* nextState = this->getState(DFAState::Label(next))
[all...] |
| /external/skqp/src/sksl/lex/ |
| DFAState.h | 13 struct DFAState {
41 DFAState()
45 DFAState(int id, Label label)
49 DFAState(const DFAState& other) = delete;
59 template<> struct hash<DFAState::Label> {
60 size_t operator()(const DFAState::Label& s) const {
|
| NFAtoDFA.h | 9 #include "DFAState.h"
43 getState(DFAState::Label({}));
48 DFAState* start = getState(DFAState::Label(startStates));
64 DFAState* getState(DFAState::Label label) {
68 fStates[label] = std::unique_ptr<DFAState>(new DFAState(id, label));
101 void scanState(DFAState* state) {
118 DFAState* nextState = this->getState(DFAState::Label(next))
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 74 if ( startState instanceof DFAState ) {
80 walkCreatingDFADOT(dot, (DFAState)startState);
112 DFAState s)
139 if ( edge.target instanceof DFAState &&
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES )
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin'
294 if ( !edge.isSemanticPredicate() && target instanceof DFAState ) {
297 ((DFAState)target).getGatedPredicatesInNFAConfigurations();
315 if ( s instanceof DFAState ) {
320 if ( s instanceof DFAState ) {
[all...] |
| GrammarDanglingStateMessage.java | 30 import org.antlr.analysis.DFAState;
43 public DFAState problemState;
46 DFAState problemState)
|
| RecursionOverflowMessage.java | 30 import org.antlr.analysis.DFAState;
42 public DFAState sampleBadState;
48 DFAState sampleBadState,
|
| GrammarInsufficientPredicatesMessage.java | 30 import org.antlr.analysis.DFAState;
41 public DFAState problemState;
44 DFAState problemState,
|
| GrammarNonDeterminismMessage.java | 30 import org.antlr.analysis.DFAState;
45 public DFAState problemState;
48 DFAState problemState)
|
| FASerializer.java | 166 if ( edge.target instanceof DFAState ) {
169 ((DFAState)edge.target).getGatedPredicatesInNFAConfigurations();
206 if ( s instanceof DFAState ) {
207 stateStr = ":s"+n+"=>"+((DFAState)s).getUniquelyPredictedAlt();
|
| ErrorManager.java | 31 import org.antlr.analysis.DFAState;
616 DFAState d)
625 DFAState d)
656 DFAState d,
673 DFAState sampleBadState,
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 53 DFAState s,
65 String dfaStateName = "dfaState";
96 DFAState EOTTarget = null;
104 EOTTarget = (DFAState)edge.target;
132 DFAState target = (DFAState)edge.target;
147 (DFAState)edge.target,
167 // rather than the current DFAState s so the error message
181 (DFAState)predEdge.target,
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/pgen2/ |
| pgen.py | 188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
203 return states # List of DFAState instances; first one is start
234 # dfa is a list of DFAState instances
347 class DFAState(object):
355 self.arcs = {} # map from label to DFAState
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
|
| /external/python/cpython2/Lib/lib2to3/pgen2/ |
| pgen.py | 188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
203 return states # List of DFAState instances; first one is start
234 # dfa is a list of DFAState instances
347 class DFAState(object):
355 self.arcs = {} # map from label to DFAState
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
|
| /external/python/cpython3/Lib/lib2to3/pgen2/ |
| pgen.py | 188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
203 return states # List of DFAState instances; first one is start
234 # dfa is a list of DFAState instances
347 class DFAState(object):
355 self.arcs = {} # map from label to DFAState
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
203 return states # List of DFAState instances; first one is start
234 # dfa is a list of DFAState instances
347 class DFAState(object):
355 self.arcs = {} # map from label to DFAState
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 188 states = [DFAState(closure(start), finish)]
200 st = DFAState(nfaset, finish)
203 return states # List of DFAState instances; first one is start
234 # dfa is a list of DFAState instances
347 class DFAState(object):
355 self.arcs = {} # map from label to DFAState
360 assert isinstance(next, DFAState)
370 assert isinstance(other, DFAState)
|
