| /external/doclava/src/com/google/doclava/parser/ |
| JavaParser.java | 21 import org.antlr.runtime.DFA;
[all...] |
| JavaLexer.java | 21 import org.antlr.runtime.DFA;
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| SemanticContext.java | 48 * we will have to combine p1 and p2 into DFA state as we will be
78 DFA dfa);
173 DFA dfa)
182 generator.grammar.decisionsWhoseDFAsUsesSemPreds.add(dfa);
187 dfa.getNFADecisionStartState().getEnclosingRule();
257 DFA dfa)
284 DFA dfa
[all...] |
| DFAState.java | 38 /** A DFA state represents a set of possible NFA configurations.
39 * As Aho, Sethi, Ullman p. 117 says "The DFA uses its state
42 * input a1a2..an, the DFA is in a state that represents the
45 * In conventional NFA->DFA conversion, therefore, the subset T
61 * A DFA state may have multiple references to a particular state,
69 /** We are part of what DFA? Use this ref to get access to the
72 public DFA dfa; field in class:DFAState
74 /** Track the transitions emanating from this DFA state. The List
80 /** When doing an acyclic DFA, this is the number of lookahead symbol
[all...] |
| LL1DFA.java | 38 /** A special DFA that is exactly LL(1) or LL(1) with backtracking mode
41 public class LL1DFA extends DFA {
43 * an LL(1) DFA. One edge per set.
71 /** From a set of edgeset->list-of-alts mappings, create a DFA
137 //System.out.println("dfa for preds=\n"+this);
|
| DecisionProbe.java | 41 * discovered while building the DFA predictor.
43 * The information is collected during NFA->DFA conversion and, while
60 * is represented internall with a DFA comprised of multiple states, each of
63 * Because of this, you need to iterate over this list of DFA states. You'll
72 public DFA dfa; field in class:DecisionProbe
74 /** Track all DFA states with nondeterministic alternatives.
75 * By reaching the same DFA state, a path through the NFA for some input
79 * Note that from the DFA state, you can ask for
92 /** Was a syntactic ambiguity resolved with predicates? Any DFA
[all...] |
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestCharDFAConversion.java | 30 import org.antlr.analysis.DFA;
223 DFA dfa = g.getLookaheadDFA(1); local
224 String result = serializer.serialize(dfa.startState);
264 // same DFA as nongreedy .* but code gen checks number of
382 // less efficient of a DFA
524 DFA dfa = g.getLookaheadDFA(decision); local
525 assertNotNull("unknown decision #"+decision, dfa);
527 String result = serializer.serialize(dfa.startState)
[all...] |
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| DFA.pm | 1 package ANTLR::Runtime::DFA;
49 # Which recognizer encloses this DFA? Needed to check backtracking
61 # using this DFA (representing the covering regular approximation
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| dfa.py | 37 class DFA(object):
38 """@brief A DFA implemented as a set of transition tables.
51 ## Which recognizer encloses this DFA? Needed to check backtracking
67 using this DFA (representing the covering regular approximation
146 raise RuntimeError("DFA bang!")
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| nuances.rb | 132 // this rule used to generate an infinite loop in DFA.predict
158 example "testing for DFA-based decision bug" do
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarAST.java | 30 import org.antlr.analysis.DFA;
69 /** If this is a decision node, what is the lookahead DFA? */
70 public DFA lookaheadDFA = null;
179 public DFA getLookaheadDFA() {
183 public void setLookaheadDFA(DFA lookaheadDFA) {
|
| 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...] |
| GrammarReport.java | 30 import org.antlr.analysis.DFA;
143 if( d.dfa==null ) {
147 Rule r = d.dfa.decisionNFAStartState.enclosingRule;
157 //if ( g.decisionsWhoseDFAsUsesSynPreds.contains(d.dfa) ) dfaWithSynPred++;
158 if ( d.dfa.hasSynPred() ) dfaWithSynPred++;
167 // int nalts = grammar.getNumberOfAltsForDecisionNFA(d.dfa.decisionNFAStartState);
170 // grammar.getNFAStateForAltOfDecision(d.dfa.decisionNFAStartState, a);
172 if ( !d.dfa.isCyclic() ) {
173 if ( d.dfa.isClassicDFA() ) {
174 int maxk = d.dfa.getMaxLookaheadDepth()
295 DFA dfa = (DFA) it.next(); local
[all...] |
| Interpreter.java | 30 import org.antlr.analysis.DFA;
140 // Create the DFA predictors for each decision
178 // Create the DFA predictors for each decision
236 DFA dfa = s.nfa.grammar.getLookaheadDFA(s.getDecisionNumber()); local
240 dfa.getNFADecisionStartState().getDescription()+
245 int predictedAlt = predict(dfa);
247 String description = dfa.getNFADecisionStartState().getDescription();
250 dfa.getDecisionNumber(),
321 // could be jumping to new grammar, make sure DFA create
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCParser.h | 25 #pragma mark Cyclic DFA interface start DFA2
32 #pragma mark Cyclic DFA interface end DFA2
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCParser.h | 12 #pragma mark Cyclic DFA interface start DFA2
19 #pragma mark Cyclic DFA interface end DFA2
|
| SimpleCLexer.m | 55 #pragma mark Cyclic DFA implementation start DFA4
172 #pragma mark Cyclic DFA implementation end DFA4
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/ |
| Ruby.stg | 236 # - - - - - - - - - - DFA definitions - - - - - - - - - - -
780 /** Same as a normal DFA state except that we don't examine
794 /** A DFA state that is actually the loopback decision of a
829 /** A DFA state where a SWITCH may be generated. The code
871 /** The code to initiate execution of a cyclic DFA; this is used
872 * in the rule to predict an alt just like the fixed DFA case.
876 alt_<decisionNumber> = @dfa<decisionNumber>.predict( @input )
884 * used except for special DFA states that cannot be encoded as
887 cyclicDFA(dfa) ::= <<
888 class DFA<dfa.decisionNumber> \< ANTLR3::DF
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| DFA.java | 30 /** A DFA implemented as a set of transition tables.
39 * lexer's Tokens rule DFA has 326 states roughly.
41 public class DFA {
52 /** Which recognizer encloses this DFA? Needed to check backtracking */
58 * using this DFA (representing the covering regular approximation
66 System.err.println("Enter DFA.predict for decision "+decisionNumber);
72 if ( debug ) System.err.println("DFA "+decisionNumber+" state "+s+" LA(1)="+(char)input.LA(1)+"("+input.LA(1)+
77 System.err.println("DFA "+decisionNumber+
82 System.err.println("DFA "+decisionNumber+
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/output1/ |
| SymbolTableLexer.m | 55 #pragma mark Cyclic DFA implementation start DFA4
146 #pragma mark Cyclic DFA implementation end DFA4
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/ |
| CPP.stg | 151 // cyclic dfa's
152 <cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this);}; separator="\n">
153 // dfa tables..
210 <cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
| DebugGrammarParser.cs | 1436 #region DFA
1445 class DFA2 : DFA
[all...] |
| ProfileGrammarParser.cs | 1440 #region DFA
1449 class DFA2 : DFA
[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/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...] |
