// // Generated by JTB 1.3.2 // package piglet.visitor; import java.util.Enumeration; import piglet.syntaxtree.BinOp; import piglet.syntaxtree.CJumpStmt; import piglet.syntaxtree.Call; import piglet.syntaxtree.ErrorStmt; import piglet.syntaxtree.Exp; import piglet.syntaxtree.Goal; import piglet.syntaxtree.HAllocate; import piglet.syntaxtree.HLoadStmt; import piglet.syntaxtree.HStoreStmt; import piglet.syntaxtree.IntegerLiteral; import piglet.syntaxtree.JumpStmt; import piglet.syntaxtree.Label; import piglet.syntaxtree.MoveStmt; import piglet.syntaxtree.NoOpStmt; import piglet.syntaxtree.Node; import piglet.syntaxtree.NodeList; import piglet.syntaxtree.NodeListOptional; import piglet.syntaxtree.NodeOptional; import piglet.syntaxtree.NodeSequence; import piglet.syntaxtree.NodeToken; import piglet.syntaxtree.Operator; import piglet.syntaxtree.PrintStmt; import piglet.syntaxtree.Procedure; import piglet.syntaxtree.Stmt; import piglet.syntaxtree.StmtExp; import piglet.syntaxtree.StmtList; import piglet.syntaxtree.Temp; /** * Provides default methods which visit each node in the tree in depth-first * order. Your visitors may extend this class. */ public class DepthFirstVisitor implements Visitor { // // Auto class visitors--probably don't need to be overridden. // public void visit(NodeList n) { for ( Enumeration e = n.elements(); e.hasMoreElements(); ) e.nextElement().accept(this); } public void visit(NodeListOptional n) { if ( n.present() ) for ( Enumeration e = n.elements(); e.hasMoreElements(); ) e.nextElement().accept(this); } public void visit(NodeOptional n) { if ( n.present() ) n.node.accept(this); } public void visit(NodeSequence n) { for ( Enumeration e = n.elements(); e.hasMoreElements(); ) e.nextElement().accept(this); } public void visit(NodeToken n) { } // // User-generated visitor methods below // /** * f0 -> "MAIN" * f1 -> StmtList() * f2 -> "END" * f3 -> ( Procedure() )* * f4 -> */ public void visit(Goal n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); n.f4.accept(this); } /** * f0 -> ( ( Label() )? Stmt() )* */ public void visit(StmtList n) { n.f0.accept(this); } /** * f0 -> Label() * f1 -> "[" * f2 -> IntegerLiteral() * f3 -> "]" * f4 -> StmtExp() */ public void visit(Procedure n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); n.f4.accept(this); } /** * f0 -> NoOpStmt() * | ErrorStmt() * | CJumpStmt() * | JumpStmt() * | HStoreStmt() * | HLoadStmt() * | MoveStmt() * | PrintStmt() */ public void visit(Stmt n) { n.f0.accept(this); } /** * f0 -> "NOOP" */ public void visit(NoOpStmt n) { n.f0.accept(this); } /** * f0 -> "ERROR" */ public void visit(ErrorStmt n) { n.f0.accept(this); } /** * f0 -> "CJUMP" * f1 -> Exp() * f2 -> Label() */ public void visit(CJumpStmt n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); } /** * f0 -> "JUMP" * f1 -> Label() */ public void visit(JumpStmt n) { n.f0.accept(this); n.f1.accept(this); } /** * f0 -> "HSTORE" * f1 -> Exp() * f2 -> IntegerLiteral() * f3 -> Exp() */ public void visit(HStoreStmt n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); } /** * f0 -> "HLOAD" * f1 -> Temp() * f2 -> Exp() * f3 -> IntegerLiteral() */ public void visit(HLoadStmt n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); } /** * f0 -> "MOVE" * f1 -> Temp() * f2 -> Exp() */ public void visit(MoveStmt n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); } /** * f0 -> "PRINT" * f1 -> Exp() */ public void visit(PrintStmt n) { n.f0.accept(this); n.f1.accept(this); } /** * f0 -> StmtExp() * | Call() * | HAllocate() * | BinOp() * | Temp() * | IntegerLiteral() * | Label() */ public void visit(Exp n) { n.f0.accept(this); } /** * f0 -> "BEGIN" * f1 -> StmtList() * f2 -> "RETURN" * f3 -> Exp() * f4 -> "END" */ public void visit(StmtExp n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); n.f4.accept(this); } /** * f0 -> "CALL" * f1 -> Exp() * f2 -> "(" * f3 -> ( Exp() )* * f4 -> ")" */ public void visit(Call n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); n.f3.accept(this); n.f4.accept(this); } /** * f0 -> "HALLOCATE" * f1 -> Exp() */ public void visit(HAllocate n) { n.f0.accept(this); n.f1.accept(this); } /** * f0 -> Operator() * f1 -> Exp() * f2 -> Exp() */ public void visit(BinOp n) { n.f0.accept(this); n.f1.accept(this); n.f2.accept(this); } /** * f0 -> "LT" * | "PLUS" * | "MINUS" * | "TIMES" */ public void visit(Operator n) { n.f0.accept(this); } /** * f0 -> "TEMP" * f1 -> IntegerLiteral() */ public void visit(Temp n) { n.f0.accept(this); n.f1.accept(this); } /** * f0 -> */ public void visit(IntegerLiteral n) { n.f0.accept(this); } /** * f0 -> */ public void visit(Label n) { n.f0.accept(this); } }