OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:DFA
(Results
76 - 94
of
94
) sorted by null
1
2
3
4
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/template/
group-file-lexer.rb
910
# - - - - - - - - - -
DFA
definitions - - - - - - - - - - -
911
class DFA12 < ANTLR3::
DFA
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
ActionScript.stg
102
<cyclicDFAs:cyclicDFA()> <! dump tables for all
DFA
!>
218
<cyclicDFAs:cyclicDFA()> <! dump tables for all
DFA
!>
592
* number. A
DFA
predicts the alternative and then a simple switch
832
/** Same as a normal
DFA
state except that we don't examine lookahead
842
/** A
DFA
state that is actually the loopback decision of a closure
877
/** A
DFA
state where a SWITCH may be generated. The code generator
921
/** The code to initiate execution of a cyclic
DFA
; this is used
922
* in the rule to predict an alt just like the fixed
DFA
case.
926
alt<decisionNumber> =
dfa
<decisionNumber>.predict(input);
929
cyclicDFACtor(
dfa
) ::= <
[
all
...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
Python.stg
137
<cyclicDFAs:{
dfa
| <cyclicDFAInit(
dfa
)>}; separator="\n">
152
<cyclicDFAs:cyclicDFA()> <! dump tables for all
DFA
!>
258
<cyclicDFAs:{
dfa
| <cyclicDFAInit(
dfa
)>}; separator="\n">
290
<cyclicDFAs:cyclicDFA()> <! dump tables for all
DFA
!>
735
* number. A
DFA
predicts the alternative and then a simple switch
991
/** Same as a normal
DFA
state except that we don't examine lookahead
1001
/** A
DFA
state that is actually the loopback decision of a closure
1035
/** A
DFA
state where a SWITCH may be generated. The code generato
[
all
...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
TestDFAConversion.java
31
import org.antlr.analysis.
DFA
;
315
"options {k=2;}\n" + // just makes bigger
DFA
410
// Should be ok like k=1 'except bigger
DFA
1640
DFA
dfa
= g.getLookaheadDFA(decision);
local
[
all
...]
TestCompositeGrammars.java
632
org.antlr.analysis.
DFA
dfa
= g.getLookaheadDFA(1);
local
634
String result = serializer.serialize(
dfa
.startState);
680
"b : 'x' | 'y' {;} ;\n"; // preds generated but not need in
DFA
here
[
all
...]
/prebuilts/devtools/tools/lib/
jython-standalone-2.5.3.jar
/prebuilts/tools/common/m2/repository/org/python/jython/2.5.3/
jython-2.5.3.jar
/prebuilts/tools/common/m2/repository/org/python/jython-standalone/2.5.3/
jython-standalone-2.5.3.jar
/external/antlr/antlr-3.4/lib/
antlr-3.4-complete.jar
/prebuilts/misc/common/antlr/
antlr-3.4-complete.jar
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
TreeToNFAConverter.g
49
import org.antlr.runtime.
DFA
;
/prebuilts/misc/common/jython/
jython.jar
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
actions.c
8
#include "tools/re2c/
dfa
.h"
645
DFA
*
dfa
;
local
688
dfa
= DFA_new(ins, re->size, 0, 256, rep);
689
DFA_emit(
dfa
, o);
690
DFA_delete(
dfa
);
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
SimpleCParser.m
28
#pragma mark Cyclic
DFA
implementation start DFA2
110
#pragma mark Cyclic
DFA
implementation end DFA2
[
all
...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
SimpleCParser.m
56
#pragma mark Cyclic
DFA
implementation start DFA2
134
#pragma mark Cyclic
DFA
implementation end DFA2
[
all
...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
C.stg
[
all
...]
/external/smali/smali/src/main/java/org/jf/smali/
smaliParser.java
[
all
...]
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.pas
118
/// Used currently only after a cyclic
DFA
and just before starting
364
/// When walking ahead with cyclic
DFA
for syntactic predicates, we
[
all
...]
Antlr.Runtime.Tree.pas
[
all
...]
Completed in 492 milliseconds
1
2
3
4