Searched refs:node (Results 1 - 25 of 3060) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/
H A DRunnerController.java215 TestGroupTreeNode node = (TestGroupTreeNode) value;
217 label.setIcon( node.hasFail ?
223 TestCaseTreeNode node = (TestCaseTreeNode) value;
224 label.setIcon( (node.data.isPass())?
231 "Invalide tree node type + " + value.getClass().getName());
/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 DBaseRecognizer.as244 msg = "mismatched tree node: "+mtne.node+
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...]
H A DRecognizerSharedState.as28 * one token/tree node is consumed for two errors.
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DBaseTree.as32 * an empty node whose children represent the list. An empty, but
33 * non-null node is called "nil".
38 /** Create a new node from an existing node does nothing for BaseTree
40 * be copied as the children are not considered part of this node.
42 public function BaseTree(node:Tree = null) {
76 /** Add t as child of this node.
87 if ( childTree.isNil ) { // t is an empty node possibly with children
121 /** Add all elements of kids list as children of this node */
279 /** Return a list of all ancestors of this node
[all...]
H A DBaseTreeAdaptor.as22 /** create tree node that holds the start and stop tokens associated
28 * node type.
31 * subclass your own tree node class to avoid class cast exception.
36 //System.out.println("returning error node '"+t+"' @index="+input.index());
50 * not the tree node routines to do the construction.
89 * child as the new root node.
100 * simple node or nil root with a single child node--it must be a root
101 * node. If newRoot is ^(nil x) return x as newRoot.
119 // handle ^(nil real-node)
[all...]
H A DCommonTree.as32 /** A tree node that is wrapper for a Token object. After 3.0 release
35 * spend the space in every tree node. If you don't want these extra
42 /** What token indexes bracket all tokens associated with this node
47 /** Who is the parent node of this node; if null, implies node is root */
50 /** What index is this node in the child list? Range: 0..n-1 */
53 public function CommonTree(node:CommonTree = null) {
54 if (node != null) {
55 super(node);
[all...]
H A DCommonTreeNodeStream.as36 * This node stream sucks all nodes out of the tree specified in
61 /** The complete mapping from stream index to tree node.
84 /** The index into the nodes list of the current node (next node
109 /** Reuse an existing node stream's buffer of nodes. Do not point at a
110 * node stream that can change. Must have static node list. start/stop
137 nodes.push(t); // add this node
139 // add DOWN node if t has children
149 // add UP node i
[all...]
H A DRewriteRuleNodeStream.as22 // we dup every node, so don't have to worry about calling dup; short-
24 throw new Error("dup can't be called for a node stream.");
H A DTreeAdaptor.as44 /** Create a tree node from Token object; for CommonTree type trees,
48 * Override if you want another kind of node to be built.
52 /** Duplicate a single tree node.
53 * Override if you want another kind of node to be built.
57 /** Duplicate tree recursively, using dupNode() for each node */
60 /** Return a nil node (an empty but non-null node) that can hold
66 /** Return a tree node representing an error. This node records the
72 * be packaged up in the error node
[all...]
H A DTreeParser.as79 /** Match '.' in tree parser has special meaning. Skip node or
80 * entire tree if node has children. If children, scan until
81 * corresponding UP node.
88 input.consume(); // not subtree, consume 1 node and return
91 // current node is a subtree, skip to corresponding UP.
122 return grammarFileName+": node from "+
132 e.token = adaptor.getToken(e.node);
133 if ( e.token==null ) { // could be an UP/DOWN node
134 e.token = new CommonToken(adaptor.getType(e.node),
135 adaptor.getText(e.node));
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3commontreenodestream.h2 /// Definition of the ANTLR3 common tree node stream.
58 /// the tree node stream. This will point to an implementation
67 /// Get tree node at current input pointer + i ahead where i=1 is next node.
68 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
75 /// returns a tree node instead of a token. Makes code gen identical
81 /// the object that provides node objects.
86 /// trees. E.g., get text of a node.
121 /// Get a tree node at an absolute index i; 0..n-1.
133 /// tree. Also, it might be able to modify the node strea
[all...]
H A Dantlr3debugeventlistener.h293 * about a node except its type and text (obtained from the adaptor).
295 * the memory address of the node.
298 * just one UP node and one DOWN navigation node.
300 * Note that unlike the Java version, the node type of the C parsers
312 * just one UP node and one DOWN navigation node.
331 * with an error node if they are building ASTs. This event
336 /** Announce a new node built from token elements such as type etc...
344 /** Announce a new node buil
[all...]
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.Tests/
H A DITreeNodeStreamFixture.cs394 // Assume we want to hit node 107 and then "call 102" then return
399 { // consume til 107 node
438 // Assume we want to hit node 107 and then "call 102", which
444 { // consume til 107 node
467 // RETURN (to Up node in 102 subtree)
611 ITree node = (ITree)stream.LT(1);
612 Assert.AreEqual(i, node.Type);
622 ITree node = (ITree)stream.LT(i); // look ahead to ith token
623 Assert.AreEqual(N + i, node.Type);
/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);

Completed in 8407 milliseconds

1234567891011>>