Searched refs:iterator (Results 1 - 25 of 6149) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-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 DFlexAntTasks.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 DTokenRewriteStream.java398 Iterator it = indexToOp.values().iterator();
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBufferedTreeNodeStream.java375 public Iterator iterator() { method in class:BufferedTreeNodeStream
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
H A DCommonTreeNodeStream.js298 iterator: function() {
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dtoken.rb300 iterator methods for token generators. Furthermore, it
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/
H A DTool.java698 for (Iterator itr = rules.iterator(); itr.hasNext();) {
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFA.java421 it = states.iterator();
424 it = getUniqueStates().values().iterator();
991 for (Iterator it = synpreds.iterator(); it.hasNext();) {
H A DDFAState.java532 // 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 DDecisionProbe.java202 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 DLL1DFA.java86 for (Iterator it = edgeMap.keySet().iterator(); it.hasNext();) {
H A DNFAToDFAConverter.java1495 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 DSemanticContext.java689 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 DCodeGenerator.java491 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 DBitSet.java103 for (Iterator iter = other.intervals.iterator(); iter.hasNext();) {
129 Iterator it = elements.iterator();
333 Iterator iter = elements.iterator();
H A DGraph.java87 for (Iterator it = nodes.values().iterator(); it.hasNext();) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
H A DIntervalSet.java368 // 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 DOrderedHashSet.java91 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 DAssignTokenTypesBehavior.java236 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 DAttributeScope.java178 for (Iterator it = thisKeys.iterator(); it.hasNext();) {
H A DCompositeGrammar.java260 for (Iterator it = rules.iterator(); it.hasNext();) {
286 for (Iterator it = delegate.getRules().iterator(); it.hasNext();) {
H A DDOTGenerator.java247 for (Iterator itr = rules.iterator(); itr.hasNext();) {
268 Iterator iter = decisionList.iterator();
346 for (Iterator it = configurations.iterator(); it.hasNext();) {
H A DGrammar.java790 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 DGrammarAST.java449 Iterator<Tree> thisDescendants = descendants(this, true).iterator();
450 Iterator<Tree> otherDescendants = descendants(other, true).iterator();
H A DGrammarNonDeterminismMessage.java76 for (Iterator it = disabledAlts.iterator(); it.hasNext();) {
97 for (Iterator iter = nondetAlts.iterator(); iter.hasNext();) {

Completed in 4552 milliseconds

1234567891011>>