/* * Copyright (c) 1997, 2003, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.  Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */  /* Generated By:JJTree: Do not edit this line. Node.java */ package com.sun.jmx.snmp.IPAcl; /* All AST nodes must implement this interface.  It provides basic   machinery for constructing the parent and child relationships   between nodes. */ interface Node {   /** This method is called after the node has been made the current    node.  It indicates that child nodes can now be added to it. */  public void jjtOpen();   /** This method is called after all the child nodes have been    added. */  public void jjtClose();   /** This pair of methods are used to inform the node of its    parent. */  public void jjtSetParent(Node n);  public Node jjtGetParent();   /** This method tells the node to add its argument to the node's    list of children.  */  public void jjtAddChild(Node n, int i);   /** This method returns a child node.  The children are numbered     from zero, left to right. */  public Node jjtGetChild(int i);   /** Return the number of children the node has. */  public int jjtGetNumChildren();}