OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:DFA
(Results
1 - 13
of
13
) sorted by null
/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/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/Perl5/lib/ANTLR/Runtime/
DFA.pm
1
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/
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
...]
/external/antlr/antlr-3.4/runtime/Python/antlr3/
dfa.py
37
class
DFA
(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/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/Java/src/main/java/org/antlr/runtime/
DFA.java
30
/** A
DFA
implemented as a set of transition tables.
39
* lexer's Tokens rule
DFA
has 326 states roughly.
41
public class
DFA
{
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/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DFA.java
40
/** A
DFA
(converted from a grammar's NFA).
44
public class
DFA
{
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
states. Maps hash of DFAStat
[
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
42
// two states [0x01] and [0x10] into a
DFA
with a single state [0x01, 0x10].
94
// class
DFA
: deterministic finite automaton for processor resource tracking.
97
class
DFA
{
99
DFA
();
112
// Modify the
DFA
.
131
// writeTable: Print out a table representing the
DFA
.
139
// Constructors for State, Transition, and
DFA
155
DFA
::DFA()
[
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
();
1779
DFA *
dfa
= *p
dfa
;
local
1863
DFA*
dfa
= GetDFA(kind);
local
2072
DFA*
dfa
= NULL;
local
[
all
...]
/external/antlr/antlr-3.4/lib/
antlr-3.4-complete.jar
/prebuilt/common/antlr/
antlr-3.4-complete.jar
Completed in 5399 milliseconds