Lines Matching refs:Node
23 private java.util.Stack<Node> nodes;
31 nodes = new java.util.Stack<Node>();
37 /* Determines whether the current node was actually closed and
39 node scope. */
44 /* Call this to reinitialize the node stack. It is called
53 /* Returns the root node of the AST. It only makes sense to call
55 Node rootNode() {
59 /* Pushes a node on to the stack. */
60 void pushNode(Node n) {
65 /* Returns the node on the top of the stack, and remove it from the
67 Node popNode() {
74 /* Returns the node currently on the top of the stack. */
75 Node peekNode() {
79 /* Returns the number of children on the stack in the current node
86 void clearNodeScope(Node n) {
94 void openNodeScope(Node n) {
101 /* A definite node is constructed from a specified number of
103 made the children of the definite node. Then the definite node
105 void closeNodeScope(Node n, int num) {
108 Node c = popNode();
118 /* A conditional node is constructed if its condition is true. All
119 the nodes that have been pushed since the node was opened are
120 made children of the the conditional node, which is then pushed
121 on to the stack. If the condition is false the node is not
123 void closeNodeScope(Node n, boolean condition) {
128 Node c = popNode();
