| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| AnalysisTimeoutException.java | 30 /** Analysis took too long; bail out of entire DFA construction. */
32 public DFA abortedDFA;
33 public AnalysisTimeoutException(DFA abortedDFA) {
|
| 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) {
|
| 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 in this gramma
142 DFA dfa = grammar.getLookaheadDFA(decisionNumber); local
[all...] |
| MachineProbe.java | 42 DFA dfa; field in class:MachineProbe
44 public MachineProbe(DFA dfa) {
45 this.dfa = dfa;
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
85 // walk looking for edge whose target is next dfa state
109 * Given an alternative associated with a DFA state, return the list of
148 // /** Used to find paths through syntactically ambiguous DFA. If we'v
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestDFAMatching.java | 30 import org.antlr.analysis.DFA;
48 DFA dfa = g.getLookaheadDFA(1); local
49 checkPrediction(dfa,"a",1);
50 checkPrediction(dfa,"b",2);
51 checkPrediction(dfa,"c",3);
52 checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER);
61 DFA dfa = g.getLookaheadDFA(1); local
62 checkPrediction(dfa,"a",1)
75 DFA dfa = g.getLookaheadDFA(1); local
89 DFA dfa = g.getLookaheadDFA(3); local
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| 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/ |
| dfa.h | 10 struct DFA;
81 typedef struct DFA {
87 } 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*, FILE *)
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| 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 {
59 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 ~DFA();
1825 DFA *dfa = ANNOTATE_UNPROTECTED_READ(*pdfa); local
1911 DFA* dfa = GetDFA(kind); local
2120 DFA* dfa = NULL; local
[all...] |
| 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 cached for kFirstMatc
[all...] |
| /external/regex-re2/re2/ |
| 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 {
57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
58 ~DFA();
1823 DFA *dfa = ANNOTATE_UNPROTECTED_READ(*pdfa); local
1909 DFA* dfa = GetDFA(kind); local
2118 DFA* dfa = NULL; local
[all...] |
| 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 cached for kFirstMatc
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/ |
| 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/ |
| test-dfa.rb | 8 class DFASubclass < ANTLR3::DFA
23 dfa = DFASubclass.new(nil, 1)
24 dfa.eot.should == DFASubclass::EOT
25 dfa.eof.should == DFASubclass::EOF
26 dfa.max.should == DFASubclass::MAX
27 dfa.min.should == DFASubclass::MIN
28 dfa.accept.should == DFASubclass::ACCEPT
29 dfa.special.should == DFASubclass::SPECIAL
30 dfa.transition.should == DFASubclass::TRANSITION
49 ANTLR3::DFA.unpack(*packed).should == unpacke
[all...] |
| /external/llvm/utils/TableGen/ |
| 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 {
130 DFA();
131 ~DFA();
140 // Modify the DFA.
146 // writeTable: Print out a table representing the DFA
[all...] |
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| 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/ |
| 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/ |
| 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/ |
| 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/ |
| 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/ |
| SimpleCLexer.h | 13 #pragma mark Cyclic DFA interface start DFA4
20 #pragma mark Cyclic DFA interface end DFA4
|
| 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/ActionScript/project/src/org/antlr/runtime/ |
| 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,
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 "+decisionNumber
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| 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 {
54 public DFA()
57 public DFA(SpecialStateTransitionHandler specialStateTransition) {
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)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| 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
66 /** <summary>Which recognizer encloses this DFA? Needed to check backtracking</summary> */
71 public DFA()
76 public DFA( SpecialStateTransitionHandler specialStateTransition )
91 * using this DFA (representing the covering regular approximation
100 Console.Error.WriteLine( "Enter DFA.predict for decision " + decisionNumber )
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| 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
163 | DFA cannot be instantiated without providing state array information.
165 | provided in the DFA subclass constants.
225 | DFA BANG!
289 | DFA BANG
[all...] |
