| /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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Dbg.stg | 45 <grammar.decisions:{d | <d.dfa.hasSynPred; null="false">}; wrap="\n ", separator=", ">
|
| /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...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| regex_internal.h | 494 /* `node_idx' is the index in dfa->nodes, if `type' == 0.
613 const re_dfa_t *const dfa; member in struct:__anon19638
615 const re_dfa_t *dfa; member in struct:__anon19638
682 Idx nbackref; /* The number of backreference in this dfa. */
689 /* If this dfa has "multibyte node", which is a backreference or
|
| /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...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/ |
| Tool.java | 204 else if (args[i].equals("-dfa")) {
278 System.err.println("missing max inline dfa states -Xmaxinlinedfastates option; ignoring");
318 DFA.MAX_STATE_TRANSITIONS_FOR_TABLE = Integer.parseInt(args[i]);
327 DFA.MAX_TIME_PER_DFA_CREATION = Integer.parseInt(args[i]);
633 /** Create NFA, DFA and generate code for grammar.
635 * it's ok to create DFA, which must check for left-recursion. That check
637 * After all NFA, comes DFA conversion for root grammar then code gen for
638 * root grammar. DFA and code gen for delegates comes next.
673 DFA dfa = g.getLookaheadDFA(d) local
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/ |
| antlr3.rb | 57 antlr3/dfa.rb::
58 defines a single DFA class that is used to simulate state machines for certain
210 require 'antlr3/dfa'
|
| /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/regex-re2/ |
| Makefile | 95 obj/re2/dfa.o\
|
| /external/openfst/src/test/ |
| algo_test.h | 1130 DeterminizeFst<Arc> dfa(rfsa);
1131 DifferenceFst<Arc> cfsa(univ_fsa_, dfa);
[all...] |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /prebuilt/common/antlr/ |
| antlr-3.4-complete.jar | |
