KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > apache > cayenne > exp > parser > Node


1 /*****************************************************************
2  * Licensed to the Apache Software Foundation (ASF) under one
3  * or more contributor license agreements. See the NOTICE file
4  * distributed with this work for additional information
5  * regarding copyright ownership. The ASF licenses this file
6  * to you under the Apache License, Version 2.0 (the
7  * "License"); you may not use this file except in compliance
8  * with the License. You may obtain a copy of the License at
9  *
10  * http://www.apache.org/licenses/LICENSE-2.0
11  *
12  * Unless required by applicable law or agreed to in writing,
13  * software distributed under the License is distributed on an
14  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15  * KIND, either express or implied. See the License for the
16  * specific language governing permissions and limitations
17  * under the License.
18  ****************************************************************/
19
20 package org.apache.cayenne.exp.parser;
21
22 /**
23  * Provides basic machinery for constructing the parent and child relationships
24  * between nodes. All AST nodes must implement this interface.
25  *
26  * <p>Generated by JJTree</p>
27  *
28  * @since 1.1
29  */
30 public interface Node {
31
32     /** Called after the node has been made the current
33       node. It indicates that child nodes can now be added to it. */
34     public void jjtOpen();
35
36     /** Called after all the child nodes have been
37       added. */
38     public void jjtClose();
39
40     /** This pair of methods are used to inform the node of its
41       parent. */
42     public void jjtSetParent(Node n);
43     public Node jjtGetParent();
44
45     /** This method tells the node to add its argument to the node's
46       list of children. */
47     public void jjtAddChild(Node n, int i);
48
49     /** This method returns a child node. The children are numbered
50        from zero, left to right. */
51     public Node jjtGetChild(int i);
52
53     /** Return the number of children the node has. */
54     public int jjtGetNumChildren();
55 }
56
Popular Tags