/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | AnalysisTimeoutException.java | 30 /** Analysis took too long; bail out of entire DFA construction. */ 32 public DFA abortedDFA; 33 public AnalysisTimeoutException(DFA abortedDFA) {
|
H A D | NonLLStarDecisionException.java | 30 /** Used to abort DFA construction when we find non-LL(*) decision; i.e., 34 public DFA abortedDFA; 35 public NonLLStarDecisionException(DFA abortedDFA) {
|
H A D | DFAOptimizer.java | 39 * PRUNE_EBNF_EXIT_BRANCHES) during DFA construction, but then it 42 * during DFA construction and before determinism checks. 44 * In general, ANTLR's NFA->DFA->codegen pipeline seems very robust 47 * within the confines of, for example, a DFA. The code generator 100 * Tokens rule DFA goes 110 * Done during DFA construction. See method addTransition() in 115 * Done during DFA construction. See addDFAState() in NFAToDFAConverter. 123 /** Used by DFA state machine generator to avoid infinite recursion 124 * resulting from cycles int the DFA. This is a set of int state #s. 137 // optimize each DFA i [all...] |
H A D | MachineProbe.java | 42 DFA dfa; 44 public MachineProbe(DFA dfa) { 109 * Given an alternative associated with a DFA state, return the list of 148 // /** Used to find paths through syntactically ambiguous DFA. If we've
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestDFAMatching.java | 30 import org.antlr.analysis.DFA; 48 DFA dfa = g.getLookaheadDFA(1); 61 DFA dfa = g.getLookaheadDFA(1); 75 DFA dfa = g.getLookaheadDFA(1); 89 DFA dfa = g.getLookaheadDFA(3); 95 protected void checkPrediction(DFA dfa, String input, int expected)
|
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
H A D | testdfa.py | 8 """Test case for the DFA class.""" 13 We need a Recognizer in order to instanciate a DFA. 24 """DFA.__init__() 30 dfa = antlr3.DFA( 43 """DFA.unpack()""" 46 antlr3.DFA.unpack(
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
H A D | dfa.h | 10 struct DFA; 81 typedef struct DFA { struct 87 } DFA; typedef in typeref:struct:DFA 89 DFA *DFA_new(Ins*, unsigned int, unsigned int, unsigned int, Char*); 90 void DFA_delete(DFA*); 91 void DFA_addState(DFA*, State**, State*); 92 State *DFA_findState(DFA*, Ins**, unsigned int); 93 void DFA_split(DFA*, State*); 95 void DFA_findSCCs(DFA*); 96 void DFA_emit(DFA*, FIL [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | dfa.cc | 5 // A DFA (deterministic finite automaton)-based regular expression search. 7 // The DFA search has two main parts: the construction of the automaton, 20 // the definition of class DFA. 33 "Whether the RE2 DFA should bail out early " 49 // Changing this to true compiles in prints that trace execution of the DFA. 53 // A DFA implementation of a regular expression program. 56 // the comments in the sections that follow the DFA definition. 57 class DFA { class in namespace:re2 59 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); 60 ~DFA(); 436 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) function in class:re2::DFA [all...] |
H A D | prog.h | 74 class DFA; 225 // Tracking this lets the DFA collapse commonly-treated byte ranges 237 // (the DFA has only one-byte lookahead). 266 // Search using DFA: much faster than NFA but only finds 269 // If the DFA runs out of memory, sets *failed to true and returns false. 277 // Build the entire DFA for the given match kind. FOR TESTING ONLY. 278 // Usually the DFA is built out incrementally, as needed, which 340 DFA* GetDFA(MatchKind kind); 358 DFA* volatile dfa_first_; // DFA cache [all...] |
/external/regex-re2/re2/ |
H A D | dfa.cc | 5 // A DFA (deterministic finite automaton)-based regular expression search. 7 // The DFA search has two main parts: the construction of the automaton, 20 // the definition of class DFA. 31 "Whether the RE2 DFA should bail out early " 47 // Changing this to true compiles in prints that trace execution of the DFA. 51 // A DFA implementation of a regular expression program. 54 // the comments in the sections that follow the DFA definition. 55 class DFA { class in namespace:re2 57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); 58 ~DFA(); 434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) function in class:re2::DFA [all...] |
H A D | prog.h | 74 class DFA; 225 // Tracking this lets the DFA collapse commonly-treated byte ranges 237 // (the DFA has only one-byte lookahead). 266 // Search using DFA: much faster than NFA but only finds 269 // If the DFA runs out of memory, sets *failed to true and returns false. 277 // Build the entire DFA for the given match kind. FOR TESTING ONLY. 278 // Usually the DFA is built out incrementally, as needed, which 340 DFA* GetDFA(MatchKind kind); 358 DFA* volatile dfa_first_; // DFA cache [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/ |
H A D | SymbolTableLexer.h | 12 #pragma mark Cyclic DFA interface start DFA4 19 #pragma mark Cyclic DFA interface end DFA4
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-dfa.rb | 8 class DFASubclass < ANTLR3::DFA 49 ANTLR3::DFA.unpack(*packed).should == unpacked
|
/external/llvm/utils/TableGen/ |
H A D | DFAPacketizerEmitter.cpp | 1 //===- DFAPacketizerEmitter.cpp - Packetization DFA for a VLIW machine-----===// 13 // automaton (DFA) that models all possible mappings of machine instructions 29 // class DFAPacketizerEmitter: class that generates and prints out the DFA 76 // two states [0x01] and [0x10] into a DFA with a single state [0x01, 0x10]. 125 // class DFA: deterministic finite automaton for processor resource tracking. 128 class DFA { class in namespace:__anon22853 130 DFA(); 131 ~DFA(); 140 // Modify the DFA. 146 // writeTable: Print out a table representing the DFA 164 DFA::DFA(): currentState(NULL) {} function in class:DFA [all...] |
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
H A D | DFA.js | 1 /** A DFA implemented as a set of transition tables. 10 * lexer's Tokens rule DFA has 326 states roughly. 12 org.antlr.runtime.DFA = function() {}; 14 org.antlr.runtime.DFA.prototype = { 16 * using this DFA (representing the covering regular approximation 119 org.antlr.lang.augmentObject(org.antlr.runtime.DFA, { 147 return org.antlr.runtime.DFA.unpackEncodedString(encodedString);
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
H A D | SimpleCParser.h | 25 #pragma mark Cyclic DFA interface start DFA2 32 #pragma mark Cyclic DFA interface end DFA2
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/ |
H A D | FuzzyLexer.h | 13 #pragma mark Cyclic DFA interface start DFA38 20 #pragma mark Cyclic DFA interface end DFA38
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/output1/ |
H A D | FuzzyLexer.h | 13 #pragma mark Cyclic DFA interface start DFA38 20 #pragma mark Cyclic DFA interface end DFA38
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
H A D | SimpleCLexer.java | 695 static final short[] DFA4_eot = DFA.unpackEncodedString(DFA4_eotS); 696 static final short[] DFA4_eof = DFA.unpackEncodedString(DFA4_eofS); 697 static final char[] DFA4_min = DFA.unpackEncodedStringToUnsignedChars(DFA4_minS); 698 static final char[] DFA4_max = DFA.unpackEncodedStringToUnsignedChars(DFA4_maxS); 699 static final short[] DFA4_accept = DFA.unpackEncodedString(DFA4_acceptS); 700 static final short[] DFA4_special = DFA.unpackEncodedString(DFA4_specialS); 707 DFA4_transition[i] = DFA.unpackEncodedString(DFA4_transitionS[i]); 711 class DFA4 extends DFA {
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
H A D | SimpleCLexer.h | 13 #pragma mark Cyclic DFA interface start DFA4 20 #pragma mark Cyclic DFA interface end DFA4
|
H A D | SimpleCLexer.java | 695 static final short[] DFA4_eot = DFA.unpackEncodedString(DFA4_eotS); 696 static final short[] DFA4_eof = DFA.unpackEncodedString(DFA4_eofS); 697 static final char[] DFA4_min = DFA.unpackEncodedStringToUnsignedChars(DFA4_minS); 698 static final char[] DFA4_max = DFA.unpackEncodedStringToUnsignedChars(DFA4_maxS); 699 static final short[] DFA4_accept = DFA.unpackEncodedString(DFA4_acceptS); 700 static final short[] DFA4_special = DFA.unpackEncodedString(DFA4_specialS); 707 DFA4_transition[i] = DFA.unpackEncodedString(DFA4_transitionS[i]); 711 class DFA4 extends DFA {
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | DFA.cs | 38 public delegate int SpecialStateTransitionHandler(DFA dfa, int s, IIntStream input); 40 /** <summary>A DFA implemented as a set of transition tables.</summary> 50 * lexer's Tokens rule DFA has 326 states roughly. 53 public class DFA { class in namespace:Antlr.Runtime 54 public DFA() method in class:Antlr.Runtime.DFA 57 public DFA(SpecialStateTransitionHandler specialStateTransition) { method in class:Antlr.Runtime.DFA 71 /** <summary>Which recognizer encloses this DFA? Needed to check backtracking</summary> */ 78 * using this DFA (representing the covering regular approximation 85 Console.Error.WriteLine("Enter DFA.predict for decision " + decisionNumber); 92 Console.Error.WriteLine("DFA " [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | DFA.cs | 39 public delegate int SpecialStateTransitionHandler( DFA dfa, int s, IIntStream input ); 41 /** <summary>A DFA implemented as a set of transition tables.</summary> 51 * lexer's Tokens rule DFA has 326 states roughly. 54 public class DFA class in namespace:Antlr.Runtime 66 /** <summary>Which recognizer encloses this DFA? Needed to check backtracking</summary> */ 71 public DFA() method in class:Antlr.Runtime.DFA 76 public DFA( SpecialStateTransitionHandler specialStateTransition ) method in class:Antlr.Runtime.DFA 91 * using this DFA (representing the covering regular approximation 100 Console.Error.WriteLine( "Enter DFA.predict for decision " + decisionNumber ); 109 Console.Error.WriteLine( "DFA " [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | DFA.as | 3 /** A DFA implemented as a set of transition tables. 12 * lexer's Tokens rule DFA has 326 states roughly. 14 public class DFA { 25 /** Which recognizer encloses this DFA? Needed to check backtracking */ 32 public function DFA(recognizer:BaseRecognizer, decisionNumber:int, description:String, function 57 * using this DFA (representing the covering regular approximation 63 trace("Enter DFA.predict for decision "+decisionNumber); 70 if ( debug ) trace("DFA "+decisionNumber+" state "+s+" LA(1)="+String.fromCharCode(input.LA(1))+"("+input.LA(1)+ 75 trace("DFA "+decisionNumber+ 80 trace("DFA " [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | dfa.rb | 37 =begin rdoc ANTLR3::DFA 39 DFA is a class that implements a finite state machine that chooses between 42 Deterministic Finite Automata (DFA) are finite state machines that are capable 49 generate a special DFA class definition to implement a decision. 63 In generated code, ANTLR defines DFA states using seven parameters, each defined 100 class DFA class in class:ANTLR3 163 | DFA cannot be instantiated without providing state array information. 165 | provided in the DFA subclass constants. 225 | DFA BANG! 289 | DFA BAN [all...] |