void clearNodeScope(Node n) { while (sp > mk) { popNode(); } mk = ((Integer)marks.pop()).intValue(); }
public void clearNodeScope(@SuppressWarnings("unused") final Node n) { while (sp > mk) { popNode(); } mk = marks.remove(marks.size()-1).intValue(); }
public SimpleNode popNode() { if ( jjtree.nodeArity() > 0) // number of child nodes return (SimpleNode)jjtree.popNode(); else return null; }
public SimpleNode popNode() { if ( jjtree.nodeArity() > 0) // number of child nodes return (SimpleNode)jjtree.popNode(); else return null; }
public void closeNodeScope(final Node n, final int numIn) { mk = marks.remove(marks.size()-1).intValue(); int num = numIn; while (num-- > 0) { Node c = popNode(); c.jjtSetParent(n); n.jjtAddChild(c, num); } n.jjtClose(); pushNode(n); node_created = true; }
void closeNodeScope(Node n, int num) { mk = ((Integer)marks.pop()).intValue(); while (num-- > 0) { Node c = popNode(); c.jjtSetParent(n); n.jjtAddChild(c, num); } n.jjtClose(); pushNode(n); node_created = true; }
public void closeNodeScope(final Node n, final boolean condition) { if (condition) { int a = nodeArity(); mk = marks.remove(marks.size()-1).intValue(); while (a-- > 0) { final Node c = popNode(); c.jjtSetParent(n); n.jjtAddChild(c, a); } n.jjtClose(); pushNode(n); node_created = true; } else { mk = marks.remove(marks.size()-1).intValue(); node_created = false; } } }
void closeNodeScope(Node n, boolean condition) { if (condition) { int a = nodeArity(); mk = ((Integer)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 = ((Integer)marks.pop()).intValue(); node_created = false; } } }
final public void PackageDeclaration() throws ParseException { /*@bgen(jjtree) PackageDeclaration */ BSHPackageDeclaration jjtn000 = new BSHPackageDeclaration(JJTPACKAGEDECLARATION); boolean jjtc000 = true; jjtree.openNodeScope(jjtn000); jjtreeOpenNodeScope(jjtn000); try { jj_consume_token(PACKAGE); AmbiguousName(); } catch (Throwable jjte000) { if (jjtc000) { jjtree.clearNodeScope(jjtn000); jjtc000 = false; } else { jjtree.popNode(); } if (jjte000 instanceof RuntimeException) { {if (true) throw (RuntimeException)jjte000;} } if (jjte000 instanceof ParseException) { {if (true) throw (ParseException)jjte000;} } {if (true) throw (Error)jjte000;} } finally { if (jjtc000) { jjtree.closeNodeScope(jjtn000, true); jjtreeCloseNodeScope(jjtn000); } } }
final public void MethodInvocation() throws ParseException { /*@bgen(jjtree) MethodInvocation */ BSHMethodInvocation jjtn000 = new BSHMethodInvocation(JJTMETHODINVOCATION); boolean jjtc000 = true; jjtree.openNodeScope(jjtn000); jjtreeOpenNodeScope(jjtn000); try { AmbiguousName(); Arguments(); } catch (Throwable jjte000) { if (jjtc000) { jjtree.clearNodeScope(jjtn000); jjtc000 = false; } else { jjtree.popNode(); } if (jjte000 instanceof RuntimeException) { {if (true) throw (RuntimeException)jjte000;} } if (jjte000 instanceof ParseException) { {if (true) throw (ParseException)jjte000;} } {if (true) throw (Error)jjte000;} } finally { if (jjtc000) { jjtree.closeNodeScope(jjtn000, true); jjtreeCloseNodeScope(jjtn000); } } }
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();
jjtc000 = false; } else { jjtree.popNode();