| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| CodeGenTreeWalker.g | 59 import org.antlr.runtime.DFA;
400 // get the dfa for the BLOCK
402 org.antlr.analysis.DFA dfa = block2.getLookaheadDFA();
428 b=block["ruleBlock", dfa]
529 block[String blockTemplateName, org.antlr.analysis.DFA dfa]
540 if ( $dfa != null )
543 decision = generator.genLookaheadDecision(recognizerST,$dfa);
545 $code.add("decisionNumber", $dfa.getDecisionNumber())
[all...] |
| /external/antlr/antlr-3.4/antlr-ant/main/antlr3-task/ |
| antlr3.jar | |
| /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/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Java.stg | 128 <cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this);}; separator="\n">
129 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
255 <cyclicDFAs:{dfa | protected DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this);}; separator="\n"
[all...] |
| Dbg.stg | 45 <grammar.decisions:{d | <d.dfa.hasSynPred; null="false">}; wrap="\n ", separator=", ">
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| Perl5.stg | 67 use ANTLR::Runtime::DFA;
100 <cyclicDFAs:{dfa | has 'dfa<dfa.decisionNumber>';}; separator="\n">
105 <cyclicDFAs:{dfa |
106 $self->dfa<dfa.decisionNumber>(<name>::DFA<dfa.decisionNumber>->new({ recognizer => $self }));
112 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| Scala.stg | 72 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
111 <cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNumber>(this)}; separator="\n">
194 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
240 <cyclicDFAs:{dfa | private val dfa<dfa.decisionNumber> = new <grammar.recognizerName>.DFA<dfa.decisionNumber>(this)}; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/antlr-ant/main/antlr3-task/antlr3-src/org/apache/tools/ant/antlr/ |
| ANTLR3.java | 104 /** The dfa attribute */
105 private boolean dfa; field in class:ANTLR3
108 /** collapse incident edges into DFA states */
215 this.dfa = enable;
227 * collapse incident edges into DFA states
525 if (dfa) {
526 commandline.createArgument().setValue("-dfa");
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Grammar.java | 32 import org.antlr.analysis.DFA;
159 public DFA dfa; field in class:Grammar.Decision
319 * decision DFA so it can display DFA.
346 /** An external tool requests that DFA analysis abort prematurely. Stops
347 * at DFA granularity, which are limited to a DFA size and time computation
416 * can go back later and build DFA predictors for them. This includes
463 * do the LL(*) work; NFA->DFA conversion
1066 DFA dfa = null; local
[all...] |
| ErrorManager.java | 243 * The set is whatever that method accepts or derives like a DFA.
631 if ( !seen.contains(d.dfa.decisionNumber+"|"+d.getAltSet()) ) {
634 seen.add(d.dfa.decisionNumber+"|"+d.getAltSet());
[all...] |
| /external/chromium_org/third_party/yasm/ |
| re2c.host.darwin-x86.mk | 30 third_party/yasm/source/patched-yasm/tools/re2c/dfa.c \
|
| re2c.host.linux-x86.mk | 30 third_party/yasm/source/patched-yasm/tools/re2c/dfa.c \
|
| /external/chromium_org/third_party/re2/re2/ |
| 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/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/regex-re2/re2/ |
| 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/webrtc/src/modules/audio_processing/aecm/ |
| aecm_core.c | 201 const WebRtc_UWord16* dfa,
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3defs.h | 593 ANTLR3_API ANTLR3_INT32 antlr3dfaspecialTransition (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREAM is, pANTLR3_CYCLIC_DFA dfa, ANTLR3_INT32 s);
594 ANTLR3_API ANTLR3_INT32 antlr3dfaspecialStateTransition (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREAM is, pANTLR3_CYCLIC_DFA dfa, ANTLR3_INT32 s);
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| Dbg.stg | 70 <grammar.decisions:{d | <if(d.dfa.hasSynPred)>True<else>False<endif>}; wrap="\n ", separator=", ">
|
| 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/chromium_org/third_party/re2/ |
| re2.target.darwin-arm.mk | 28 third_party/re2/re2/dfa.cc \
|
| re2.target.darwin-mips.mk | 28 third_party/re2/re2/dfa.cc \
|
| re2.target.darwin-x86.mk | 28 third_party/re2/re2/dfa.cc \
|
| re2.target.linux-arm.mk | 28 third_party/re2/re2/dfa.cc \
|
| re2.target.linux-mips.mk | 28 third_party/re2/re2/dfa.cc \
|
