HomeSort by relevance Sort by last modified time
    Searched refs:Tree (Results 51 - 75 of 281) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
ITree.cs 33 namespace Antlr.Runtime.Tree {
37 * What does a tree look like? ANTLR has a number of support classes
44 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
47 * This is a tree node without any payload; just navigation and factory stuff.
58 // Tree tracks parent and child index now > 3.0
101 * a list (nil-root tree). num of children can increase or decrease.
110 * the tree is a flat list.
139 /** <summary>Return a token type; needed for tree parsing</summary> */
RewriteEarlyExitException.cs 33 namespace Antlr.Runtime.Tree {
RewriteEmptyStreamException.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
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.
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());
ITreeAdaptor.cs 33 namespace Antlr.Runtime.Tree {
41 * This takes the place of the tree construction code generated in the
44 * I do not need to know the type of a tree at all so they are all
52 * Create a tree node from Token object; for CommonTree type trees,
63 /** <summary>Duplicate a single tree node.</summary>
68 /** <summary>Duplicate tree recursively, using dupNode() for each node</summary> */
69 object DupTree(object tree);
73 * a list of element as the children. If you want a flat tree (a list)
80 * Return a tree node representing an error. This node records the
92 * This only makes sense during token parsing, not tree parsing
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
ITree.cs 33 namespace Antlr.Runtime.Tree
38 * What does a tree look like? ANTLR has a number of support classes
45 * NOTE: When constructing trees, ANTLR can build any kind of tree; it can
48 * This is a tree node without any payload; just navigation and factory stuff.
61 // Tree tracks parent and child index now > 3.0
106 * a list (nil-root tree). num of children can increase or decrease.
115 * the tree is a flat list.
147 /** <summary>Return a token type; needed for tree parsing</summary> */
ITreeVisitorAction.cs 33 namespace Antlr.Runtime.Tree
RewriteEarlyExitException.cs 33 namespace Antlr.Runtime.Tree
RewriteEmptyStreamException.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
RewriteRuleTokenStream.cs 33 namespace Antlr.Runtime.Tree
72 * Don't convert to a tree unless they explicitly call nextTree.
73 * This way we can do hetero tree nodes in rewrite.
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/ObjC/Framework/examples/treeparser/
Main.java 2 import org.antlr.runtime.tree.*;
12 System.out.println("tree: "+((Tree)r.tree).toStringTree());
13 CommonTree r0 = ((CommonTree)r.tree);
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/
ast.ml 2 * Abstract Syntax Tree (aka Parse Tree)
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/
ast.ml 2 * Abstract Syntax Tree (aka Parse Tree)
  /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/
ast.ml 2 * Abstract Syntax Tree (aka Parse Tree)
  /frameworks/base/core/jni/
android_graphics_drawable_VectorDrawable.cpp 35 VectorDrawable::Tree* tree = new VectorDrawable::Tree(rootGroup); local
36 return reinterpret_cast<jlong>(tree);
41 VectorDrawable::Tree* treeToCopy = reinterpret_cast<VectorDrawable::Tree*>(treePtr);
42 VectorDrawable::Tree* tree = new VectorDrawable::Tree(treeToCopy, rootGroup); local
43 return reinterpret_cast<jlong>(tree);
95 VectorDrawable::Tree* tree = reinterpret_cast<VectorDrawable::Tree*>(treePtr); local
104 VectorDrawable::Tree* tree = reinterpret_cast<VectorDrawable::Tree*>(treePtr); local
117 VectorDrawable::Tree* tree = reinterpret_cast<VectorDrawable::Tree*>(treePtr); local
122 VectorDrawable::Tree* tree = reinterpret_cast<VectorDrawable::Tree*>(treePtr); local
127 VectorDrawable::Tree* tree = reinterpret_cast<VectorDrawable::Tree*>(treePtr); local
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DebugTreeParser.cs 40 using ITreeNodeStream = Antlr.Runtime.Tree.ITreeNodeStream;
41 using TreeParser = Antlr.Runtime.Tree.TreeParser;
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
DebugTreeParser.cs 39 using ITreeNodeStream = Antlr.Runtime.Tree.ITreeNodeStream;
40 using TreeParser = Antlr.Runtime.Tree.TreeParser;
ParseTreeBuilder.cs 36 using ParseTree = Antlr.Runtime.Tree.ParseTree;
40 * to build a simple parse tree using ParseTree nodes.
57 public virtual ParseTree Tree
80 /** <summary>Backtracking or cyclic DFA, don't want to add nodes to tree</summary> */
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/
ITreeAdaptor`1.cs 33 namespace Antlr.Runtime.Tree
40 * Create a tree node from Token object; for CommonTree type trees,
51 /** <summary>Duplicate a single tree node.</summary>
56 /** <summary>Duplicate tree recursively, using dupNode() for each node</summary> */
57 T DupTree(T tree);
61 * a list of element as the children. If you want a flat tree (a list)
68 * Return a tree node representing an error. This node records the
80 * This only makes sense during token parsing, not tree parsing.
81 * Tree parsing should happen only when parsing and tree constructio
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
ANTLRCommonTreeNodeStream.h 39 /** Pull nodes from which tree? */
42 /** If this tree (root) was created from a token stream, track it. */
45 /** What tree adaptor was used to build these trees */
48 /** The tree iterator we using */
54 /** Tree (nil A B C) trees like flat A B C streams */
57 /** Tracks tree depth. Level=0 means we're at root node level. */
65 + (ANTLRCommonTreeNodeStream *) newANTLRCommonTreeNodeStream:(id<ANTLRTreeAdaptor>)anAdaptor Tree:(ANTLRCommonTree *)theTree;
69 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)adaptor Tree:(ANTLRCommonTree *)theTree;
73 /** Pull elements from tree iterator. Track tree level 0..max_level
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
ANTLRCommonTreeNodeStream.h 39 /** Pull nodes from which tree? */
42 /** If this tree (root) was created from a token stream, track it. */
45 /** What tree adaptor was used to build these trees */
48 /** The tree iterator we using */
54 /** Tree (nil A B C) trees like flat A B C streams */
57 /** Tracks tree depth. Level=0 means we're at root node level. */
65 + (ANTLRCommonTreeNodeStream *) newANTLRCommonTreeNodeStream:(id<ANTLRTreeAdaptor>)anAdaptor Tree:(ANTLRCommonTree *)theTree;
69 - (id) initWithTreeAdaptor:(id<ANTLRTreeAdaptor>)adaptor Tree:(ANTLRCommonTree *)theTree;
73 /** Pull elements from tree iterator. Track tree level 0..max_level
    [all...]

Completed in 277 milliseconds

1 23 4 5 6 7 8 91011>>