Searched defs:node (Results 1 - 25 of 1594) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jar ... java.lang.Object implements org.dom4j.Node { public abstract org.dom4j.Node node (int) throws ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DRecognitionException.as76 /** If this is a tree parser exception, node is set to the node with
79 public var node:Object; variable
92 /** If you are parsing a tree node stream, you will encounter som
125 this.node = nodes.LT(1);
127 var payload:Token = adaptor.getToken(node);
131 // imaginary node; no line/pos info; scan backwards
147 else { // node created from real token
152 else if ( this.node is Tree) {
153 this.line = this.node
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3exception.h160 /** If this is a tree parser exception then the node is set to point to the node
163 void * node; member in struct:ANTLR3_EXCEPTION_struct
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3basetreeadaptor.c181 // This will already have been included as a child of another node
187 // For each child of the current tree, define a node using the
188 // memory address of the node to name it
197 // Name the node
260 // This will already have been included as a child of another node
379 "\tbgcolor=\"lightgrey\"; node [shape=box, fixedsize=false, fontsize=12, fontname=\"Helvetica-bold\", fontcolor=\"blue\"\n"
422 // First produce the node defintions
438 /** Create and return a nil tree node (no token payload)
506 // Send the create node event
564 /** Use the adaptor implementation to add a child node wit
900 getUniqueID(pANTLR3_BASE_TREE_ADAPTOR adaptor, pANTLR3_BASE_TREE node) argument
[all...]
H A Dantlr3collections.c1735 /** Rather than use the bit index of a trie node to shift
1779 /* Now we need to allocate the root node. This makes it easier
1781 * for the root node.
1796 /* Now we seed the root node with the index being the
1804 * of the root node to point back to itself.
1810 /* Finally, note that the key for this root node is 0 because
1830 /* Starting at the root node in the trie, compare the bit index
1831 * of the current node with its next child node (starts left from root).
1832 * When the bit index of the child node i
2190 freeIntNode(pANTLR3_INT_TRIE_NODE node) argument
2415 DFS(pANTLR3_TOPO topo, ANTLR3_UINT32 node) argument
[all...]
H A Dantlr3commontreenodestream.c2 /// Defines the implementation of the common node stream the default
3 /// tree node stream used by ANTLR.
153 // Create an adaptor for the common tree node stream
157 // Create space for the tree node stream interface
180 // Install the common tree node stream API
193 // Install the tree node stream API
232 // Create the node list map
288 // Create an adaptor for the common tree node stream
298 // Create space for the tree node stream interface
323 // Install the common tree node strea
754 pANTLR3_BASE_TREE node; local
[all...]
H A Dantlr3debughandlers.c83 static void createNodeTok (pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE node, pANTLR3_COMMON_TOKEN token);
460 // Given a tree node, create a stringified version of it in the supplied
464 serializeNode(pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE node) argument
486 if (node == NULL)
491 // Now we serialize the elements of the node.Note that the debugger only
498 delboy->tokenString->addi(delboy->tokenString, delboy->adaptor->getUniqueID(delboy->adaptor, node));
503 delboy->tokenString->addi(delboy->tokenString, delboy->adaptor->getType(delboy->adaptor, node));
507 token = delboy->adaptor->getToken(delboy->adaptor, node);
527 // Start Index of the node
530 delboy->tokenString->addi(delboy->tokenString, (ANTLR3_UINT32)(delboy->adaptor->getTokenStartIndex(delboy->adaptor, node)));
1003 createNodeTok(pANTLR3_DEBUG_EVENT_LISTENER delboy, pANTLR3_BASE_TREE node, pANTLR3_COMMON_TOKEN token) argument
[all...]
H A Dantlr3treeparser.c94 /* Install the tree node stream
209 pANTLR3_BASE_TREE node; local
220 // Create a new empty node, by stealing the current one, or the previous one if the current one is EOF
235 node = current->dupNode(current);
239 token = node->getToken(node);
248 // Finally return the pointer to our new node
250 return node;
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DBlankDebugEventListener.cs118 public virtual void CreateNode(object node, IToken token) { argument
H A DDebugEventHub.cs269 public virtual void CreateNode(object node, IToken token) { argument
272 listener.CreateNode(node, token);
H A DDebugEventRepeater.cs146 public virtual void CreateNode(object node, IToken token) { argument
147 _listener.CreateNode(node, token);
H A DDebugEventSocketProxy.cs264 buf.Append("LN\t"); // lookahead node; distinguish from LT in protocol
330 public override void CreateNode(object node, IToken token) { argument
331 int ID = adaptor.GetUniqueID(node);
H A DDebugTreeAdaptor.cs47 * The debug listener has to deal with tree node IDs for which it did
48 * not see a createNode event. A single <unknown> node is sufficient even
66 object node = adaptor.Create(payload);
67 dbg.CreateNode(node, payload);
68 return node;
73 object node = adaptor.ErrorNode(input, start, stop, e);
74 if (node != null) {
75 dbg.ErrorNode(node);
77 return node;
107 object node
217 GetUniqueID(object node) argument
[all...]
H A DIDebugEventListener.cs274 * about a node except its type and text (obtained from the adaptor).
276 * the hashCode usually of the node so it only works if hashCode is
279 * just one UP node and one DOWN navigation node.
289 * just one UP node and one DOWN navigation node.
315 * Upon syntax error, recognizers bracket the error with an error node
323 /** <summary>Announce a new node built from token elements such as type etc...</summary>
333 /** <summary>Announce a new node built from an existing token.</summary>
337 * RemoteDebugEventSocketListener then only node
341 CreateNode(object node, IToken token) argument
[all...]
H A DTraceDebugEventListener.cs95 public override void CreateNode(object node, IToken token) { argument
96 int ID = adaptor.GetUniqueID(node);
97 string text = adaptor.GetText(node);
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTree.cs43 * an empty node whose children represent the list. An empty, but
44 * non-null node is called "nil".
55 * Create a new node from an existing node does nothing for BaseTree
57 * be copied as the children are not considered part of this node.
60 public BaseTree(ITree node) { argument
160 /** <summary>Add t as child of this node.</summary>
175 // t is an empty node possibly with children
214 /** <summary>Add all elements of kids list as children of this node</summary> */
396 * Return a list of all ancestors of this node
[all...]
H A DBaseTreeAdaptor.cs56 * Create tree node that holds the start and stop tokens associated
64 * node type.
67 * subclass your own tree node class to avoid class cast exception.
73 //System.out.println("returning error node '"+t+"' @index="+input.index());
88 * not the tree node routines to do the construction.
133 * child as the new root node.
144 * simple node or nil root with a single child node--it must be a root
145 * node. If newRoot is ^(nil x) return x as newRoot.
160 // handle ^(nil real-node)
255 GetUniqueID(object node) argument
[all...]
H A DBufferedTreeNodeStream.cs43 * This node stream sucks all nodes out of the tree specified in
57 * This is the old CommonTreeNodeStream that buffered up entire node stream.
119 /** <summary>The complete mapping from stream index to tree node.
142 /** <summary>The index into the nodes list of the current node (next node
259 nodes.Add(t); // add this node
261 // add DOWN node if t has children
271 // add UP node if t has children
277 /** What is the stream index for node? 0..n-1
278 * Return -1 if node no
280 GetNodeIndex(object node) argument
[all...]
H A DCommonTree.cs38 * A tree node that is wrapper for a Token object. After 3.0 release
41 * spend the space in every tree node. If you don't want these extra
52 * What token indexes bracket all tokens associated with this node
59 /** <summary>Who is the parent node of this node; if null, implies node is root</summary> */
62 /** <summary>What index is this node in the child list? Range: 0..n-1</summary> */
68 public CommonTree(CommonTree node) argument
69 : base(node) {
70 if (node
[all...]
H A DITreeAdaptor.cs52 * Create a tree node from Token object; for CommonTree type trees,
58 * Override if you want another kind of node to be built.
63 /** <summary>Duplicate a single tree node.</summary>
64 * <remarks>Override if you want another kind of node to be built.</remarks>
68 /** <summary>Duplicate tree recursively, using dupNode() for each node</summary> */
72 * Return a nil node (an empty but non-null node) that can hold
80 * Return a tree node representing an error. This node records the
88 * be packaged up in the error node
172 GetUniqueID(object node) argument
[all...]
H A DTreeWizard.cs54 * This class can build a token type -> node index for repeated use or for
131 * node stream. This lets us convert a node pointer to a
205 * Walk the entire tree and make a node name to nodes mapping.
208 * of your AST node type. The Integer is the token type of the node.
301 * Visit every ttype node in t, invoking the visitor. This is a quicker
354 * The implementation uses the root node of the pattern in combination
378 * on the various nodes and '.' (dot) as the node/subtree wildcard,
385 * If a node specifie
554 fillReverseIndex( object node, int streamIndex ) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DBlankDebugEventListener.cs149 public virtual void CreateNode( object node, IToken token ) argument
H A DDebugEventHub.cs328 public virtual void CreateNode( object node, IToken token ) argument
333 listener.CreateNode( node, token );
H A DDebugEventRepeater.cs177 public virtual void CreateNode( object node, IToken token ) argument
179 _listener.CreateNode( node, token );

Completed in 757 milliseconds

1234567891011>>