/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
AstTreeRuleReturnScope`2.cs | 33 namespace Antlr.Runtime.Tree 39 public TOutputTree Tree 52 object IAstRuleReturnScope.Tree 56 return Tree;
|
RewriteEarlyExitException.cs | 33 namespace Antlr.Runtime.Tree
|
RewriteEmptyStreamException.cs | 33 namespace Antlr.Runtime.Tree
|
AntlrRuntime_BaseTreeDebugView.cs | 33 namespace Antlr.Runtime.Tree 41 public AntlrRuntime_BaseTreeDebugView(BaseTree tree) 43 _tree = tree;
|
CommonTreeAdaptor.cs | 33 namespace Antlr.Runtime.Tree 37 * A TreeAdaptor that works with any Tree implementation. It provides 40 * objects, you need to override this and then set the parser tree adaptor to
|
RewriteCardinalityException.cs | 33 namespace Antlr.Runtime.Tree
|
RewriteRuleNodeStream.cs | 33 namespace Antlr.Runtime.Tree 39 * Queues up nodes matched on left side of -> in a tree parser. This is
|
RewriteRuleSubtreeStream.cs | 33 namespace Antlr.Runtime.Tree 60 * tree root node. Also prevents us from duplicating recently-added 66 * Referencing a rule result twice is ok; dup entire tree as 71 * and super.next() doesn't know which to call: dup node or dup tree. 86 object tree = NextCore(); 87 while (adaptor.IsNil(tree) && adaptor.GetChildCount(tree) == 1) 88 tree = adaptor.GetChild(tree, 0); 89 //System.Console.WriteLine("_next={0}", ((ITree)tree).ToStringTree()) [all...] |
TreeVisitor.cs | 33 namespace Antlr.Runtime.Tree 37 /** <summary>Do a depth first walk of a tree, applying pre() and post() actions as we go.</summary> */ 52 * Visit every node in tree t and trigger an action for each node 62 // System.out.println("visit "+((Tree)t).toStringTree());
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
AstParserRuleReturnScope`2.cs | 39 public TTree Tree 52 object IAstRuleReturnScope.Tree 56 return Tree;
|
IAstRuleReturnScope.cs | 39 object Tree
|
IAstRuleReturnScope`1.cs | 39 new TAstLabel Tree
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
RewriteEarlyExitException.cs | 33 namespace Antlr.Runtime.Tree {
|
RewriteEmptyStreamException.cs | 33 namespace Antlr.Runtime.Tree {
|
TreeConstants.cs | 33 namespace Antlr.Runtime.Tree
|
RewriteCardinalityException.cs | 33 namespace Antlr.Runtime.Tree {
|
RewriteRuleNodeStream.cs | 36 namespace Antlr.Runtime.Tree { 41 /// Queues up nodes matched on left side of -> in a tree parser. This is
|
RewriteRuleSubtreeStream.cs | 33 namespace Antlr.Runtime.Tree { 55 * tree root node. Also prevents us from duplicating recently-added 61 * Referencing a rule result twice is ok; dup entire tree as 66 * and super.next() doesn't know which to call: dup node or dup tree. 79 object tree = NextCore(); 80 while (adaptor.IsNil(tree) && adaptor.GetChildCount(tree) == 1) 81 tree = adaptor.GetChild(tree, 0); 82 //System.Console.WriteLine("_next={0}", ((ITree)tree).ToStringTree()) [all...] |
TreeRuleReturnScope.cs | 33 namespace Antlr.Runtime.Tree { 36 * the start property is a tree nodes not Token object 44 /** <summary>Gets the first node or root node of tree matched for this rule.</summary> */
|
TreeVisitor.cs | 33 namespace Antlr.Runtime.Tree 35 /** <summary>Do a depth first walk of a tree, applying pre() and post() actions as we go.</summary> */ 50 * Visit every node in tree t and trigger an action for each node 60 // System.out.println("visit "+((Tree)t).toStringTree());
|
ITreeVisitorAction.cs | 33 namespace Antlr.Runtime.Tree
|
RewriteRuleTokenStream.cs | 36 namespace Antlr.Runtime.Tree { 83 /// Don't convert to a tree unless they explicitly call NextTree(). 84 /// This way we can do hetero tree nodes in rewrite.
|
/external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
Tree.js | 1 /** What does a tree look like? ANTLR has a number of support classes 6 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can 9 * This is a tree node without any payload; just navigation and factory stuff. 11 org.antlr.runtime.tree.Tree = function(){};
|
/prebuilts/go/darwin-x86/doc/play/ |
tree.go | 3 // this binary tree comparison. 25 // A Tree is a binary tree with integer values. 26 type Tree struct { 27 Left *Tree 29 Right *Tree 32 // Walk traverses a tree depth-first, 34 func Walk(t *Tree, ch chan int) { 45 func Walker(t *Tree) <-chan int { 57 func Compare(t1, t2 *Tree) bool [all...] |
/prebuilts/go/linux-x86/doc/play/ |
tree.go | 3 // this binary tree comparison. 25 // A Tree is a binary tree with integer values. 26 type Tree struct { 27 Left *Tree 29 Right *Tree 32 // Walk traverses a tree depth-first, 34 func Walk(t *Tree, ch chan int) { 45 func Walker(t *Tree) <-chan int { 57 func Compare(t1, t2 *Tree) bool [all...] |