Searched refs:DFA (Results 76 - 88 of 88) sorted by relevance

1234

/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/template/
H A Dgroup-file-lexer.rb910 # - - - - - - - - - - DFA definitions - - - - - - - - - - -
911 class DFA12 < ANTLR3::DFA
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
H A DActionScript.stg102 <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.
931 dfa<dfa.decisionNumber> = new DFA(this, <dfa.decisionNumber>,
933 DFA<df
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
H A DPython.stg152 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
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 generator
1080 /** The code to initiate execution of a cyclic DFA; this is used
1081 * in the rule to predict an alt just like the fixed DFA case.
1088 /* Dump DFA tables as run-length-encoded Strings of octal values.
1093 * encode/decode approach. See analysis and runtime DFA fo
[all...]
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
H A DTestDFAConversion.java31 import org.antlr.analysis.DFA;
315 "options {k=2;}\n" + // just makes bigger DFA
410 // Should be ok like k=1 'except bigger DFA
1209 result DFA.
1640 DFA dfa = g.getLookaheadDFA(decision);
1641 assertNotNull("no DFA for decision "+decision, dfa);
H A DTestCompositeGrammars.java632 org.antlr.analysis.DFA dfa = g.getLookaheadDFA(1);
680 "b : 'x' | 'y' {;} ;\n"; // preds generated but not need in DFA here
/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/ ...
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DTreeToNFAConverter.g49 import org.antlr.runtime.DFA;
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
H A Dactions.c645 DFA *dfa;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
H A DSimpleCParser.m28 #pragma mark Cyclic DFA implementation start DFA2
110 #pragma mark Cyclic DFA implementation end DFA2
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
H A DSimpleCParser.m56 #pragma mark Cyclic DFA implementation start DFA2
134 #pragma mark Cyclic DFA implementation end DFA2
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/
H A DC.stg1049 * DFA tables for the lexer
1051 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
1053 * End of DFA tables for the lexer
1432 * DFA tables for the parser
1434 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
1436 * End of DFA tables for the parser
2036 * number. A DFA predicts the alternative and then a simple switch
2355 /** Same as a normal DFA state except that we don't examine lookahead
2367 /** A DFA state that is actually the loopback decision of a closure
2412 /** A DFA stat
[all...]
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.pas118 /// Used currently only after a cyclic DFA and just before starting
364 /// When walking ahead with cyclic DFA for syntactic predicates, we
986 TSpecialStateTransitionHandler = function(const DFA: IDFA; S: Integer;
990 /// A DFA implemented as a set of transition tables.
1003 /// As a point of reference, the Tokens rule DFA for the lexer in the Java grammar
1017 /// DFA (representing the covering regular approximation to the underlying CFL).
H A DAntlr.Runtime.Tree.pas1875 /// When walking ahead with cyclic DFA or for syntactic predicates,

Completed in 798 milliseconds

1234