/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
IAstRuleReturnScope.cs | 39 object Tree
|
IAstRuleReturnScope`1.cs | 39 new TAstLabel Tree
|
AstParserRuleReturnScope`2.cs | 39 public TTree Tree 52 object IAstRuleReturnScope.Tree 56 return Tree;
|
/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;
|
TemplateTreeRuleReturnScope`2.cs | 33 namespace Antlr.Runtime.Tree
|
/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(){};
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
Tree.java | 28 package org.antlr.runtime.tree; 34 /** What does a tree look like? ANTLR has a number of support classes 39 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can 42 * This is a tree node without any payload; just navigation and factory stuff. 44 public interface Tree { 45 public static final Tree INVALID_NODE = new CommonTree(Token.INVALID_TOKEN); 47 Tree getChild(int i); 51 // Tree tracks parent and child index now > 3.0 53 public Tree getParent(); 55 public void setParent(Tree t) [all...] |
CommonTreeAdaptor.java | 28 package org.antlr.runtime.tree; 33 /** A TreeAdaptor that works with any Tree implementation. It provides 36 * objects, you need to override this and then set the parser tree adaptor to 52 return ((Tree)t).dupNode(); 90 * Only works with Tree nodes. For rules that match nothing, 100 ((Tree)t).setTokenStartIndex(start); 101 ((Tree)t).setTokenStopIndex(stop); 106 return ((Tree)t).getTokenStartIndex(); 111 return ((Tree)t).getTokenStopIndex(); 116 return ((Tree)t).getText() [all...] |
BaseTree.java | 28 package org.antlr.runtime.tree; 33 /** A generic tree implementation with no payload. You must subclass to 35 * instead of the child-sibling approach in v2. A flat tree (a list) is 39 public abstract class BaseTree implements Tree { 49 public BaseTree(Tree node) { 52 public Tree getChild(int i) { 56 return (Tree)children.get(i); 66 public Tree getFirstChildWithType(int type) { 68 Tree t = (Tree) children.get(i) [all...] |
BaseTreeAdaptor.java | 28 package org.antlr.runtime.tree; 37 /** A TreeAdaptor that works with any Tree implementation. */ 41 * expensive: we have to create a hashtable with all tree nodes in it. 50 /** create tree node that holds the start and stop tokens associated 53 * If you specify your own kind of tree nodes, you will likely have to 59 * subclass your own tree node class to avoid class cast exception. 69 public boolean isNil(Object tree) { 70 return ((Tree)tree).isNil(); 73 public Object dupTree(Object tree) { [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
TreeTraverserTest.java | 36 private static final class Tree { 38 final List<Tree> children; 40 public Tree(char value, Tree... children) { 60 private static final TreeTraverser<Tree> ADAPTER = new TreeTraverser<Tree>() { 62 public Iterable<Tree> children(Tree node) { 88 static final Tree a = new Tree('a') [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
TreeTraverserTest.java | 38 private static final class Tree { 40 final List<Tree> children; 42 public Tree(char value, Tree... children) { 62 private static final TreeTraverser<Tree> ADAPTER = new TreeTraverser<Tree>() { 64 public Iterable<Tree> children(Tree node) { 90 static final Tree a = new Tree('a') [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeConstants.cs | 33 namespace Antlr.Runtime.Tree
|
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> */
|
TreeRewriter.cs | 33 namespace Antlr.Runtime.Tree { 70 if (r != null && !t.Equals(r.Tree) && r.Tree != null) { 73 ((CommonTree)(object)r.Tree).ToStringTree()); 77 if (r != null && r.Tree != null) 78 return r.Tree; 103 // to override, just define tree grammar rule topdown and turn on
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
TestTreeNodeStream.java | 32 import org.antlr.runtime.tree.*; 35 /** Test the tree node stream. */ 48 Tree t = new CommonTree(new CommonToken(101)); 62 Tree t = new CommonTree(new CommonToken(101)); 78 Tree root = new CommonTree((Token)null); 80 Tree t = new CommonTree(new CommonToken(101)); 85 Tree u = new CommonTree(new CommonToken(105)); 101 Tree root = new CommonTree((Token)null); 118 Tree root = new CommonTree((Token)null); 133 Tree t = new CommonTree(new CommonToken(101)) [all...] |
TestBufferedTreeNodeStream.java | 31 import org.antlr.runtime.tree.BufferedTreeNodeStream; 32 import org.antlr.runtime.tree.CommonTree; 33 import org.antlr.runtime.tree.Tree; 34 import org.antlr.runtime.tree.TreeNodeStream; 52 Tree r0 = new CommonTree(new CommonToken(101)); 53 Tree r1 = new CommonTree(new CommonToken(102)); 56 Tree r2 = new CommonTree(new CommonToken(106)); 67 assertEquals(107, ((Tree)stream.LT(1)).getType()); 71 assertEquals(104, ((Tree)stream.LT(1)).getType()) [all...] |
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
proto.h | 278 extern Tree *tmake(Tree *root, ...);
280 extern Tree *tmake();
327 extern void preorder( Tree * );
328 extern Tree * tnode( int );
329 extern void _Tfree( Tree * );
330 extern Tree * tdup( Tree * );
331 extern int is_single_tuple( Tree * );
332 extern Tree * tappend( Tree *, Tree * ); [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
DebugGrammarParserHelper.cs | 34 using Antlr.Runtime.Tree;
|
ProfileGrammarParserHelper.cs | 34 using Antlr.Runtime.Tree;
|
/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...] |
/device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
BaseOrderedCollectionRedBlackTreeLib.c | 2 An OrderedCollectionLib instance that provides a red-black tree
3 implementation, and allocates and releases tree nodes with
9 tree. Complete ordered traversal takes O(n) time.
60 Retrieve the user structure linked by the specified tree node.
64 @param[in] Node Pointer to the tree node whose associated user structure we
80 A slow function that asserts that the tree is a valid red-black tree, and
88 @param[in] Tree The tree to validate.
92 IN CONST RED_BLACK_TREE *Tree
[all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
BaseTree.as | 28 package org.antlr.runtime.tree { 29 /** A generic tree implementation with no payload. You must subclass to 31 * instead of the child-sibling approach in v2. A flat tree (a list) is 35 public class BaseTree implements Tree { 42 public function BaseTree(node:Tree = null) { 45 public function getChild(i:int):Tree { 59 public function getFirstChildWithType(type:int):Tree { 61 var t:Tree = Tree(_children[i]); 82 public function addChild(t:Tree):void [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
MismatchedTreeNodeException.java | 30 import org.antlr.runtime.tree.TreeNodeStream; 31 import org.antlr.runtime.tree.Tree;
|