| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| TreePatternLexer.cs | 33 namespace Antlr.Runtime.Tree
47 /** <summary>The tree pattern to lex like "(A B C)"</summary> */
|
| CommonTree.cs | 33 namespace Antlr.Runtime.Tree
38 * A tree node that is wrapper for a Token object. After 3.0 release
39 * while building tree rewrite stuff, it became clear that computing
41 * spend the space in every tree node. If you don't want these extra
|
| CommonTreeNodeStream.cs | 33 namespace Antlr.Runtime.Tree
47 /** <summary>Pull nodes from which tree?</summary> */
50 /** <summary>If this tree (root) was created from a token stream, track it.</summary> */
53 /** <summary>What tree adaptor was used to build these trees</summary> */
57 /** The tree iterator we are using */
63 /** <summary>Tree (nil A B C) trees like flat A B C streams</summary> */
66 /** <summary>Tracks tree depth. Level=0 means we're at root node level.</summary> */
69 public CommonTreeNodeStream( object tree )
70 : this( new CommonTreeAdaptor(), tree )
74 public CommonTreeNodeStream( ITreeAdaptor adaptor, object tree )
[all...] |
| 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> */
|
| TreeParser.cs | 33 namespace Antlr.Runtime.Tree
40 * A parser for a stream of tree nodes. "tree grammars" result in a subclass
115 * Match '.' in tree parser has special meaning. Skip node or
116 * entire tree if node has children. If children, scan until
156 * from tree parser errors inline...
167 * the input tree not the user.
177 * Tree parsers parse nodes they usually have a token object as
|
| BaseTree.cs | 33 namespace Antlr.Runtime.Tree
41 * A generic tree implementation with no payload. You must subclass to
43 * instead of the child-sibling approach in v2. A flat tree (a list) is
308 * a list (nil-root tree). num of children can increase or decrease.
495 /** <summary>Print out a whole tree not just a node</summary> */
525 /** <summary>Override to say how a node (not a tree) should look as text</summary> */
528 #region Tree Members
|
| BaseTreeAdaptor.cs | 33 namespace Antlr.Runtime.Tree
42 /** <summary>A TreeAdaptor that works with any Tree implementation.</summary> */
48 * expensive: we have to create a hashtable with all tree nodes in it.
60 * Create tree node that holds the start and stop tokens associated
65 * If you specify your own kind of tree nodes, you will likely have to
71 * subclass your own tree node class to avoid class cast exception.
82 public virtual bool IsNil( object tree )
84 return ( (ITree)tree ).IsNil;
109 public virtual object DupTree( object tree )
111 return DupTree( tree, null )
[all...] |
| ITreeAdaptor.cs | 33 namespace Antlr.Runtime.Tree
42 * This takes the place of the tree construction code generated in the
45 * I do not need to know the type of a tree at all so they are all
54 * Create a tree node from Token object; for CommonTree type trees,
113 /** <summary>Duplicate a single tree node.</summary>
124 /** <summary>Duplicate tree recursively, using dupNode() for each node</summary> */
125 object DupTree( object tree );
129 * a list of element as the children. If you want a flat tree (a list)
136 * Return a tree node representing an error. This node records the
148 * This only makes sense during token parsing, not tree parsing
[all...] |
| BufferedTreeNodeStream.cs | 33 namespace Antlr.Runtime.Tree
42 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary>
44 * This node stream sucks all nodes out of the tree specified in
46 * the tree using an array of Object pointers. The stream necessarily
51 * This stream is most suitable for tree interpreters that need to
52 * jump around a lot or for tree parsers requiring speed (at cost of memory).
54 * but just in bookkeeping, not tree walking etc...
128 /** <summary>The complete mapping from stream index to tree node.
139 /** <summary>Pull nodes from which tree?</summary> *
[all...] |
| TreeWizard.cs | 36 namespace Antlr.Runtime.Tree
61 * patterns like "(A B C)". You can create a tree from that pattern or
101 * When using %label:TOKENNAME in a tree for parse(), we must
232 * Walk the entire tree and make a node name to nodes mapping.
305 /** <summary>Return a List of tree nodes with token type ttype</summary> */
437 * the pattern is malformed or the tree does not match.
454 System.out.println("t="+((Tree)t).toStringTree());
470 * in tree matched against nodes in pattern with labels.
518 * Create a tree or node from the indicated tree pattern that closel
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
| 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/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTree.cs | 33 namespace Antlr.Runtime.Tree {
38 * A tree node that is wrapper for a Token object. After 3.0 release
39 * while building tree rewrite stuff, it became clear that computing
41 * spend the space in every tree node. If you don't want these extra
|
| CommonTreeNodeStream.cs | 33 namespace Antlr.Runtime.Tree {
45 /** <summary>Pull nodes from which tree?</summary> */
48 /** <summary>If this tree (root) was created from a token stream, track it.</summary> */
51 /** <summary>What tree adaptor was used to build these trees</summary> */
55 /** The tree iterator we are using */
61 /** <summary>Tree (nil A B C) trees like flat A B C streams</summary> */
64 /** <summary>Tracks tree depth. Level=0 means we're at root node level.</summary> */
67 public CommonTreeNodeStream(object tree)
68 : this(new CommonTreeAdaptor(), tree) {
71 public CommonTreeNodeStream(ITreeAdaptor adaptor, object tree) {
[all...] |
| 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> */
|
| TreeParser.cs | 33 namespace Antlr.Runtime.Tree {
39 * A parser for a stream of tree nodes. "tree grammars" result in a subclass
105 * Match '.' in tree parser has special meaning. Skip node or
106 * entire tree if node has children. If children, scan until
142 * from tree parser errors inline...
152 * the input tree not the user.
161 * Tree parsers parse nodes they usually have a token object as
|
| BaseTree.cs | 33 namespace Antlr.Runtime.Tree {
40 * A generic tree implementation with no payload. You must subclass to
42 * instead of the child-sibling approach in v2. A flat tree (a list) is
259 * a list (nil-root tree). num of children can increase or decrease.
414 /** <summary>Print out a whole tree not just a node</summary> */
438 /** <summary>Override to say how a node (not a tree) should look as text</summary> */
441 #region Tree Members
|
| BaseTreeAdaptor.cs | 33 namespace Antlr.Runtime.Tree {
40 /** <summary>A TreeAdaptor that works with any Tree implementation.</summary> */
45 * expensive: we have to create a hashtable with all tree nodes in it.
56 * Create tree node that holds the start and stop tokens associated
61 * If you specify your own kind of tree nodes, you will likely have to
67 * subclass your own tree node class to avoid class cast exception.
77 public virtual bool IsNil(object tree) {
78 return ((ITree)tree).IsNil;
81 public virtual object DupTree(object tree) {
82 return DupTree(tree, null)
[all...] |
| 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...] |
| BufferedTreeNodeStream.cs | 33 namespace Antlr.Runtime.Tree {
41 /** <summary>A buffered stream of tree nodes. Nodes can be from a tree of ANY kind.</summary>
43 * This node stream sucks all nodes out of the tree specified in
45 * the tree using an array of Object pointers. The stream necessarily
50 * This stream is most suitable for tree interpreters that need to
51 * jump around a lot or for tree parsers requiring speed (at cost of memory).
53 * but just in bookkeeping, not tree walking etc...
119 /** <summary>The complete mapping from stream index to tree node.
130 /** <summary>Pull nodes from which tree?</summary> *
[all...] |
| TreeWizard.cs | 36 namespace Antlr.Runtime.Tree {
60 * patterns like "(A B C)". You can create a tree from that pattern or
93 * When using %label:TOKENNAME in a tree for parse(), we must
205 * Walk the entire tree and make a node name to nodes mapping.
266 /** <summary>Return a List of tree nodes with token type ttype</summary> */
381 * the pattern is malformed or the tree does not match.
397 System.out.println("t="+((Tree)t).toStringTree());
412 * in tree matched against nodes in pattern with labels.
451 * Create a tree or node from the indicated tree pattern that closel
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| exceptions.py | 87 # For parsers. Even when it's a tree parser, token might be set.
90 # If this is a tree parser exception, node is set to the node with
104 # If you are parsing a tree node stream, you will encounter som
117 from antlr3.tree import TreeNodeStream
137 from antlr3.tree import Tree, CommonTree
165 elif isinstance(self.node, Tree):
181 from antlr3.tree import TreeNodeStream
197 """@brief A mismatched char or Token or tree node."""
353 """@brief The next tree mode does not match the expected type.""
[all...] |
| /external/chromium_org/tools/idl_parser/ |
| idl_node.py | 14 # applied as children of The IDLNodes, so they do not exist in the final tree.
73 # This class implements the AST tree, providing the associations between
140 def Tree(self, filter_nodes=None, accept_props=None):
|
| /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/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...] |
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 53 std::pair<Record *, Record *> EmitNode (const ChildMap &Tree, raw_ostream& OS,
73 const ChildMap &Tree,
78 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
103 if (Tree.find(R) != Tree.end()) {
105 = EmitNode(Tree, OS, R);
158 ChildMap Tree;
164 Tree.insert(std::make_pair(R->getValueAsDef("Base"), R));
166 Tree.insert(std::make_pair(&Root, R))
[all...] |
