/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...] |
/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/test/java/org/antlr/test/ |
TestSemanticPredicates.java | 30 import org.antlr.analysis.DFA; 262 DFA dfa = g.getLookaheadDFA(1); local 263 assertEquals(null, dfa); // can't analyze. 266 String result = serializer.serialize(dfa.startState); 636 * alt 1 in rule 'a', it is unnecessary to continue NFA->DFA 714 /** For a DFA state with lots of configurations that have the same 815 DFA dfa = g.getLookaheadDFA(decision); local 817 String result = serializer.serialize(dfa.startState) [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
SimpleCParser.java | [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
SimpleCParser.java | [all...] |
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
LeftRecursiveRuleWalker.g | 49 import org.antlr.runtime.DFA;
|
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/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
CSharp2.stg | 184 #region DFA 185 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n"> 190 <cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endi (…) [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
CSharp3.stg | 179 #region DFA 180 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n"> 185 <cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endi (…) [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/runtime/Ruby/test/functional/debugging/ |
debug-mode.rb | 602 example 'debug-mode parser block-location events triggered by invoking a cyclic DFA for prediction' do 604 grammar DFA;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
DOTGenerator.java | 48 public static STGroup stlib = new STGroupDir("org/antlr/tool/templates/dot/dfa"); 75 dot = stlib.getInstanceOf("dfa"); 135 System.out.println("dfa "+s.dfa.decisionNumber+ 140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) 271 DFA dfa = decisionState.getDecisionASTNode().getLookaheadDFA(); 272 if ( dfa!=null ) { 273 String dot = getDOT( dfa.startState );
|
/external/chromium_org/third_party/re2/re2/testing/ |
dfa_test.cc | 15 DEFINE_int32(size, 8, "log2(number of DFA nodes)"); 21 // Check that multithreaded access to DFA class works. 23 // Helper thread: builds entire DFA for prog. 36 // Create regexp with 2^FLAGS_size states in DFA. 58 // Build the DFA simultaneously in a bunch of threads. 85 // Check that DFA size requirements are followed. 87 // the DFA once the memory limits are reached. 89 // Create regexp with 2^30 states in DFA. 116 //LOG(INFO) << StringPrintf("Limit %d: prog used %d, DFA budget %d, total %d\n", 129 // Such a string is useful for testing a DFA. If you have a DF [all...] |
/external/regex-re2/re2/testing/ |
dfa_test.cc | 15 DEFINE_int32(size, 8, "log2(number of DFA nodes)"); 21 // Check that multithreaded access to DFA class works. 23 // Helper thread: builds entire DFA for prog. 36 // Create regexp with 2^FLAGS_size states in DFA. 58 // Build the DFA simultaneously in a bunch of threads. 85 // Check that DFA size requirements are followed. 87 // the DFA once the memory limits are reached. 89 // Create regexp with 2^30 states in DFA. 116 //LOG(INFO) << StringPrintf("Limit %d: prog used %d, DFA budget %d, total %d\n", 129 // Such a string is useful for testing a DFA. If you have a DF [all...] |
/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...] |
NFAToDFAConverter.java | 37 /** Code that embodies the NFA conversion to DFA. A new object is needed 38 * per DFA (also required for thread safety if multiple conversions 42 /** A list of DFA states we still need to process during NFA conversion */ 54 /** We are converting which DFA? */ 55 protected DFA dfa; field in class:NFAToDFAConverter 70 public NFAToDFAConverter(DFA dfa) { 71 this.dfa = dfa; [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
CodeGenerator.java | 32 import org.antlr.analysis.DFA; 66 * to have a separate file for the cyclic DFA as ANTLR generates bytecodes 288 // CREATE NFA FROM GRAMMAR, CREATE DFA FROM NFA 295 // some grammar analysis errors will not yield reliable DFA 300 // OPTIMIZE DFA 624 /** Generate code that computes the predicted alt given a DFA. The 632 DFA dfa) 635 // If we are doing inline DFA and this one is acyclic and LL(*) 637 // check is not done by DFA.verify(); that is, verify() avoid 745 DFA dfa = ((DFAState)edge.target).dfa; \/\/ which DFA are we in local [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
code.c | 10 #include "tools/re2c/dfa.h" 728 void DFA_findSCCs(DFA *d){ 747 void DFA_split(DFA *d, State *s){ 761 void DFA_emit(DFA *d, FILE *o){
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
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/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/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
DebugGrammarLexer.cs | 683 #region DFA
|
ProfileGrammarLexer.cs | 683 #region DFA
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/ |
Delphi.stg | 220 <cyclicDFAs:{dfa | FDFA<dfa.decisionNumber> := TDFA<dfa.decisionNumber>.Create(Self<@debugAddition()>);}; separator="\n"> 221 <cyclicDFAs:{dfa | <if(dfa.specialStateSTs)>FDFA<dfa.decisionNumber>.SpecialStateTransitionHandler := DFA<dfa.decisionNumber>_SpecialStateTransition;<endif>}; separator="\n"> 224 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !> 409 <cyclicDFAs:{dfa | FDFA<dfa.decisionNumber> := TDFA<dfa.decisionNumber>.Create(Self);}; separator="\n" [all...] |
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/ |
ObjC.stg | 261 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> *dfa<dfa.decisionNumber>;}; separator="\n"> 344 <cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = [DFA<dfa.decisionNumber> newDFA<dfa.decisionNumber>WithRecognizer:self];}; separator="\n" [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/output1/ |
Fuzzy.m | 55 #pragma mark Cyclic DFA implementation start DFA38 123 /* start dfa.specialStateSTs */ 279 /* end dfa.specialStateSTs */ 293 #pragma mark Cyclic DFA implementation end DFA38 [all...] |