Searched
full:walk (Results
376 -
400 of
1479) sorted by null
<<11121314151617181920>>
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| TreeIterator.cs | 47 // navigation nodes to return during walk and at end
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| TokenRewriteStream.cs | 473 // Walk buffer, executing instructions and emitting tokens 555 * Don't actually delete; make op null in list. Easier to walk list. 569 // WALK REPLACES 630 // WALK INSERTS
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| CommonTree.cs | 247 * are set. Walk depth first, visit bottom up. Only updates nodes
|
| CommonTreeNodeStream.cs | 231 // we'll have to walk from start to stop in tree; we're not keeping
|
| ITree.cs | 72 /** <summary>Walk upwards and get first ancestor with this token type.</summary> */
|
| ITreeNodeStream.cs | 115 * walk recursively from start until stop. You can always return
|
| TreeIterator.cs | 50 // navigation nodes to return during walk and at end
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/ |
| ITreeNodeStream`1.cs | 114 * walk recursively from start until stop. You can always return
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| TokenRewriteStream.java | 376 // Walk buffer, executing instructions and emitting tokens 446 * Don't actually delete; make op null in list. Easier to walk list. 459 // WALK REPLACES 510 // WALK INSERTS
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| CommonTree.java | 135 * are set. Walk depth first, visit bottom up. Only updates nodes
|
| CommonTreeNodeStream.java | 151 // we'll have to walk from start to stop in tree; we're not keeping
|
| Tree.java | 60 /** Walk upwards and get first ancestor with this token type. */
|
| TreeFilter.java | 69 To implement a top-down visitor, we do a depth first walk of the tree,
|
| TreeIterator.java | 47 // navigation nodes to return during walk and at end
|
| TreeNodeStream.java | 86 * walk recursively from start until stop. You can always return
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/ |
| DFA.js | 124 // walk first to find how big it is.
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRTree.h | 43 /** Walk upwards and get first ancestor with this token type. */
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRTree.h | 43 /** Walk upwards and get first ancestor with this token type. */
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRTree.h | 43 /** Walk upwards and get first ancestor with this token type. */
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRCommonTreeNodeStream.m | 223 // we'll have to walk from start to stop in tree; we're not keeping
|
| ANTLRTokenRewriteStream.m | 476 // Walk buffer, executing instructions and emitting tokens 546 * Don't actually delete; make op null in list. Easier to walk list. 560 // WALK REPLACES 597 // WALK INSERTS
|
| ANTLRTree.h | 49 /** Walk upwards and get first ancestor with this token type. */
|
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| ANTLRv3Tree.g | 29 /** ANTLR v3 tree grammar to walk trees created by ANTLRv3.g */
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| CompositeGrammar.java | 237 // walk backwards to root, collecting grammars 281 // walk all grammars preorder, priority given to grammar listed first. 458 // first walk to remove all overridden rules 503 // walk all children, adding rules not already defined
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemCopyOf.java | 164 // generated, so we need to only walk the child nodes.
|
Completed in 644 milliseconds
<<11121314151617181920>>