Searched defs:DFA (Results 1 - 12 of 12) sorted by relevance

/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DDFA.as3 /** 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/JavaScript/src/org/antlr/runtime/
H A DDFA.js1 /** 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/Perl5/lib/ANTLR/Runtime/
H A DDFA.pm1 package ANTLR::Runtime::DFA;
49 # Which recognizer encloses this DFA? Needed to check backtracking
61 # using this DFA (representing the covering regular approximation
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Ddfa.rb37 =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...]
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Ddfa.py37 class DFA(object): class in inherits:object
38 """@brief A DFA implemented as a set of transition tables.
51 ## Which recognizer encloses this DFA? Needed to check backtracking
67 using this DFA (representing the covering regular approximation
146 raise RuntimeError("DFA bang!")
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
H A DDFA.cs39 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/Java/src/main/java/org/antlr/runtime/
H A DDFA.java30 /** A DFA implemented as a set of transition tables.
39 * lexer's Tokens rule DFA has 326 states roughly.
41 public class DFA { class
52 /** Which recognizer encloses this DFA? Needed to check backtracking */
58 * using this DFA (representing the covering regular approximation
66 System.err.println("Enter DFA.predict for decision "+decisionNumber);
72 if ( debug ) System.err.println("DFA "+decisionNumber+" state "+s+" LA(1)="+(char)input.LA(1)+"("+input.LA(1)+
77 System.err.println("DFA "+decisionNumber+
82 System.err.println("DFA "+decisionNumber+
/external/llvm/utils/TableGen/
H A DDFAPacketizerEmitter.cpp1 //===- 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:__anon9909
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/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DDFA.cs38 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/regex-re2/re2/
H A Ddfa.cc5 // 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();
407 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) function in class:re2::DFA
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFA.java40 /** A DFA (converted from a grammar's NFA).
44 public class DFA { class
54 /** Prevent explosion of DFA states during conversion. The max number
55 * of states per alt in a single decision's DFA.
62 /** How many edges can each DFA state have before a "special" state
67 /** What's the start state for this DFA? */
70 /** This DFA is being built for which decision? */
73 /** From what NFAState did we create the DFA? */
76 /** The printable grammar fragment associated with this DFA */
79 /** A set of all uniquely-numbered DFA state
224 protected DFA() {;} method in class:DFA
226 public DFA(int decisionNumber, NFAState decisionStartState) { method in class:DFA
[all...]
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...

Completed in 214 milliseconds