| /external/antlr/tool/src/test/java/org/antlr/test/ |
| D | TestDFAMatching.java | 31 import org.antlr.analysis.NFA;
54 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER); in testSimpleAltCharTest()
81 checkPrediction(dfa,"q", NFA.INVALID_ALT_NUMBER); in testFiniteCommonLeftPrefixes()
94 checkPrediction(dfa,".2", NFA.INVALID_ALT_NUMBER); in testSimpleLoops()
|
| /external/antlr/tool/src/main/java/org/antlr/analysis/ |
| D | DFAState.java | 67 public static final int PREDICTED_ALT_UNSET = NFA.INVALID_ALT_NUMBER-1;
434 int alt = NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
444 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniquelyPredictedAlt()
448 return NFA.INVALID_ALT_NUMBER; in getUniquelyPredictedAlt()
460 int alt = NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
464 if ( alt==NFA.INVALID_ALT_NUMBER ) { in getUniqueAlt()
468 return NFA.INVALID_ALT_NUMBER; in getUniqueAlt()
|
| D | NFA.java | 38 public class NFA { class
49 public NFA(Grammar g) { in NFA() method in NFA
|
| D | NFAState.java | 57 public NFA nfa = null;
108 public NFAState(NFA nfa) { in NFAState()
|
| D | LL1DFA.java | 110 s.cachedUniquelyPredicatedAlt = NFA.INVALID_ALT_NUMBER; in LL1DFA()
|
| D | NFAToDFAConverter.java | 289 if ( t.getUniqueAlt()==NFA.INVALID_ALT_NUMBER ) { in findNewDFAStatesAndAddDFATransitions()
971 if ( alt!=NFA.INVALID_ALT_NUMBER ) { // uniquely predicts an alt? in addDFAStateToWorkList()
|
| /external/skia/src/sksl/lex/ |
| D | RegexNode.h | 14 struct NFA;
64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| D | NFAtoDFA.h | 35 NFAtoDFA(NFA* nfa) in NFAtoDFA()
160 const NFA& fNFA;
|
| D | NFA.h | 18 struct NFA { struct
|
| D | NFA.cpp | 10 int NFA::match(std::string s) const { in match()
|
| D | RegexNode.cpp | 12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
|
| D | Main.cpp | 166 NFA nfa; in process()
|
| /external/skqp/src/sksl/lex/ |
| D | RegexNode.h | 14 struct NFA;
64 std::vector<int> createStates(NFA* nfa, const std::vector<int>& accept) const;
|
| D | NFAtoDFA.h | 35 NFAtoDFA(NFA* nfa) in NFAtoDFA()
160 const NFA& fNFA;
|
| D | NFA.h | 18 struct NFA { struct
|
| D | NFA.cpp | 10 int NFA::match(std::string s) const { in match()
|
| D | RegexNode.cpp | 12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const { in createStates()
|
| D | Main.cpp | 166 NFA nfa; in process()
|
| /external/antlr/tool/src/main/java/org/antlr/codegen/ |
| D | ACyclicDFACodeGenerator.java | 95 int EOTPredicts = NFA.INVALID_ALT_NUMBER; in walkFixedDFAGeneratingStateMachine()
159 if ( EOTPredicts!=NFA.INVALID_ALT_NUMBER ) { in walkFixedDFAGeneratingStateMachine()
|
| /external/antlr/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| D | dot.stg | 34 digraph NFA {
43 digraph NFA {
|
| /external/antlr/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| D | TreeToNFAConverter.g | 33 /** Build an NFA from a tree representing an ANTLR grammar. */
57 /** Which NFA object are we filling in? */
58 protected NFA nfa = null;
60 /** Which grammar are we converting an NFA for? */
70 public TreeToNFAConverter(TreeNodeStream input, Grammar g, NFA nfa, NFAFactory factory) {
553 // for NFA construction
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | Interpreter.java | 248 if ( predictedAlt == NFA.INVALID_ALT_NUMBER ) { in parseEngine()
431 return NFA.INVALID_ALT_NUMBER; in predict()
|
| D | NFAFactory.java | 50 NFA nfa = null;
62 public NFAFactory(NFA nfa) { in NFAFactory()
|
| /external/one-true-awk/ |
| D | b.c | 76 #define NFA 20 /* cache this many dynamic fa's */ macro
77 fa *fatab[NFA];
103 if (nfatab < NFA) { /* room for another */ in makedfa()
|
| /external/antlr/tool/ |
| D | CHANGES.txt | 134 * Added option -Xconversiontimeout back in. Turns out we hit NFA conversion
651 * an NFA target of EOF predicate transition in DFA cause an exception in
825 * actions are now added to the NFA.
1161 the same input sequence reaches multiple locations in the NFA
1163 NFA states to look for more input. Commonly at EOF target states.
1188 wacking NFA configurations etc in each DFA state after DFA construction.
1315 src/org/antlr/analysis/NFA.java # edit
1316 NFA now span multiple grammars and so I moved the NFAs state
1417 NFA state numbers and unique token types. This keeps a tree
1791 * Changed (hidden) option -verbose to -Xnfastates; this just prints out the NFA states along each n…
[all …]
|