| /* |
| * Copyright (c) 1997, 2012, 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. JJTParserState.java */ |
| |
| package com.sun.jmx.snmp.IPAcl; |
| |
| class JJTParserState { |
| private java.util.Stack<Node> nodes; |
| private java.util.Stack<Integer> marks; |
| |
| private int sp; // number of nodes on stack |
| private int mk; // current mark |
| private boolean node_created; |
| |
| JJTParserState() { |
| nodes = new java.util.Stack<>(); |
| marks = new java.util.Stack<>(); |
| sp = 0; |
| mk = 0; |
| } |
| |
| /* Determines whether the current node was actually closed and |
| pushed. This should only be called in the final user action of a |
| node scope. */ |
| boolean nodeCreated() { |
| return node_created; |
| } |
| |
| /* Call this to reinitialize the node stack. It is called |
| automatically by the parser's ReInit() method. */ |
| void reset() { |
| nodes.removeAllElements(); |
| marks.removeAllElements(); |
| sp = 0; |
| mk = 0; |
| } |
| |
| /* Returns the root node of the AST. It only makes sense to call |
| this after a successful parse. */ |
| Node rootNode() { |
| return nodes.elementAt(0); |
| } |
| |
| /* Pushes a node on to the stack. */ |
| void pushNode(Node n) { |
| nodes.push(n); |
| ++sp; |
| } |
| |
| /* Returns the node on the top of the stack, and remove it from the |
| stack. */ |
| Node popNode() { |
| if (--sp < mk) { |
| mk = marks.pop().intValue(); |
| } |
| return nodes.pop(); |
| } |
| |
| /* Returns the node currently on the top of the stack. */ |
| Node peekNode() { |
| return nodes.peek(); |
| } |
| |
| /* Returns the number of children on the stack in the current node |
| scope. */ |
| int nodeArity() { |
| return sp - mk; |
| } |
| |
| |
| void clearNodeScope(Node n) { |
| while (sp > mk) { |
| popNode(); |
| } |
| mk = marks.pop().intValue(); |
| } |
| |
| |
| void openNodeScope(Node n) { |
| marks.push(new Integer(mk)); |
| mk = sp; |
| n.jjtOpen(); |
| } |
| |
| |
| /* A definite node is constructed from a specified number of |
| children. That number of nodes are popped from the stack and |
| made the children of the definite node. Then the definite node |
| is pushed on to the stack. */ |
| void closeNodeScope(Node n, int num) { |
| mk = marks.pop().intValue(); |
| while (num-- > 0) { |
| Node c = popNode(); |
| c.jjtSetParent(n); |
| n.jjtAddChild(c, num); |
| } |
| n.jjtClose(); |
| pushNode(n); |
| node_created = true; |
| } |
| |
| |
| /* A conditional node is constructed if its condition is true. All |
| the nodes that have been pushed since the node was opened are |
| made children of the the conditional node, which is then pushed |
| on to the stack. If the condition is false the node is not |
| constructed and they are left on the stack. */ |
| void closeNodeScope(Node n, boolean condition) { |
| if (condition) { |
| int a = nodeArity(); |
| mk = marks.pop().intValue(); |
| while (a-- > 0) { |
| Node c = popNode(); |
| c.jjtSetParent(n); |
| n.jjtAddChild(c, a); |
| } |
| n.jjtClose(); |
| pushNode(n); |
| node_created = true; |
| } else { |
| mk = marks.pop().intValue(); |
| node_created = false; |
| } |
| } |
| } |