/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | ... antlr.analysis.DFAState d
java.util.Iterator it
public boolean analysisOverflowed () public boolean isNonLLStarDecision () public int getNumberOfStates ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | ... util.List content () public abstract java.util.Iterator nodeIterator () public abstract void setContent (java.util.List ... |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | TokenRewriteStream.java | 398 Iterator it = indexToOp.values().iterator();
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | BufferedTreeNodeStream.java | 375 public Iterator iterator() { method in class:BufferedTreeNodeStream
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
H A D | CommonTreeNodeStream.js | 298 iterator: function() {
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | token.rb | 300 iterator methods for token generators. Furthermore, it
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/ |
H A D | Tool.java | 698 for (Iterator itr = rules.iterator(); itr.hasNext();) {
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFA.java | 421 it = states.iterator(); 424 it = getUniqueStates().values().iterator(); 991 for (Iterator it = synpreds.iterator(); it.hasNext();) {
|
H A D | DFAState.java | 532 // and so we save a hash map and iterator creation for each 551 for (Iterator it = states.iterator(); it.hasNext();) { 611 for (Iterator it = states.iterator(); it.hasNext();) {
|
H A D | DecisionProbe.java | 202 statesWithSyntacticallyAmbiguousAltsSet.iterator(); 322 for (Iterator it = labels.iterator(); it.hasNext();) { 429 problemStates.iterator(); 461 for (Iterator it = danglingStates.iterator(); it.hasNext();) { 550 for (Iterator altsIt = sortedAlts.iterator(); altsIt.hasNext();) { 570 for (Iterator it = dfaStatesUnaliased.iterator(); it.hasNext();) { 605 for (Iterator it = dfaStatesWithRecursionProblems.iterator(); it.hasNext();) {
|
H A D | LL1DFA.java | 86 for (Iterator it = edgeMap.keySet().iterator(); it.hasNext();) {
|
H A D | NFAToDFAConverter.java | 1495 for (Iterator it = nondeterministicAlts.iterator(); it.hasNext();) { 1561 for (Iterator it = nondeterministicAlts.iterator(); it.hasNext();) { 1571 for (Iterator itrSet = contextsForThisAlt.iterator(); itrSet.hasNext();) { 1636 iter = altToPredMap.values().iterator(); 1726 for (Iterator it = s.iterator(); it.hasNext();) {
|
H A D | SemanticContext.java | 689 return result.operands.iterator().next(); 732 a = opsA.iterator().next(); 740 b = opsB.iterator().next(); 745 return new SemanticContext[] { result.iterator().next(), a, b }; 765 a = opsA.iterator().next(); 773 b = opsB.iterator().next(); 778 return new SemanticContext[] { result.iterator().next(), a, b };
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | CodeGenerator.java | 491 for (Iterator it = actionScopeKeySet.iterator(); it.hasNext();) { 497 (GrammarAST)scopeActions.values().iterator().next(); 511 for (Iterator it = actionScopeKeySet.iterator(); it.hasNext();) { 528 for (Iterator nameIT = actionNameSet.iterator(); nameIT.hasNext();) { 775 Iterator iter = iset.getIntervals().iterator(); 811 Iterator tokenIDs = grammar.getTokenIDs().iterator(); 868 Iterator tokenIDs = grammar.getTokenIDs().iterator(); 878 Iterator literals = grammar.getStringLiterals().iterator();
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | BitSet.java | 103 for (Iterator iter = other.intervals.iterator(); iter.hasNext();) { 129 Iterator it = elements.iterator(); 333 Iterator iter = elements.iterator();
|
H A D | Graph.java | 87 for (Iterator it = nodes.values().iterator(); it.hasNext();) { 100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
H A D | IntervalSet.java | 368 // move theirs iterator yet 399 * the intervals are sorted, we can use an iterator for each list and 421 // move this iterator looking for interval that might overlap 425 // move other iterator looking for interval that might overlap 450 // Move the iterator of lower range [a..b], but not 452 // with the next iterator. So, if mine=[0..115] and 571 Iterator iter = this.intervals.iterator();
|
H A D | OrderedHashSet.java | 91 public Iterator<T> iterator() { method in class:OrderedHashSet 92 return elements.iterator();
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | AssignTokenTypesBehavior.java | 236 for (Iterator it = literals.iterator(); it.hasNext();) { 251 for (Iterator it = s.iterator(); it.hasNext();) { 273 for (Iterator it = s.iterator(); it.hasNext();) { 291 for (Iterator it = s.iterator(); it.hasNext();) { 302 for (Iterator it = s.iterator(); it.hasNext();) { 308 for (Iterator it = s.iterator(); it.hasNext();) {
|
H A D | AttributeScope.java | 178 for (Iterator it = thisKeys.iterator(); it.hasNext();) {
|
H A D | CompositeGrammar.java | 260 for (Iterator it = rules.iterator(); it.hasNext();) { 286 for (Iterator it = delegate.getRules().iterator(); it.hasNext();) {
|
H A D | DOTGenerator.java | 247 for (Iterator itr = rules.iterator(); itr.hasNext();) { 268 Iterator iter = decisionList.iterator(); 346 for (Iterator it = configurations.iterator(); it.hasNext();) {
|
H A D | Grammar.java | 790 Iterator optionNames = options.keySet().iterator(); 946 Iterator optionNames = options.keySet().iterator(); 975 for (Iterator itr = rules.iterator(); itr.hasNext();) { 1887 for (Iterator it = rules.iterator(); it.hasNext();) { 1899 for (Iterator it2 = namedActions.iterator(); it2.hasNext();) { 1916 for (Iterator it = rules.iterator(); it.hasNext();) { 1933 for (Iterator labelit = labels.iterator(); labelit.hasNext();) { 2217 for (Iterator it = importedTokenIDs.iterator(); it.hasNext();) { 2519 for (Iterator it = keys.iterator(); it.hasNext();) { 2816 for(Iterator iter = lineColumnToLookaheadDFAMap.keySet().iterator(); [all...] |
H A D | GrammarAST.java | 449 Iterator<Tree> thisDescendants = descendants(this, true).iterator(); 450 Iterator<Tree> otherDescendants = descendants(other, true).iterator();
|
H A D | GrammarNonDeterminismMessage.java | 76 for (Iterator it = disabledAlts.iterator(); it.hasNext();) { 97 for (Iterator iter = nondetAlts.iterator(); iter.hasNext();) {
|