//
// Generated by JTB 1.3.2
//

package jay.visitor;
import jay.syntaxtree.*;
import java.util.*;

import jay.*;

/**
 * Provides default methods which visit each node in the tree in depth-first
 * order.  Your visitors may extend this class.
 */
public class ToASTVisitor extends DepthFirstVisitor {


    private jay.abssyntree.Program progResult;
    public jay.abssyntree.Program getResul() { return progResult; }

    private Vector<jay.abssyntree.Declaration> declsResult;
    private jay.abssyntree.Block blockResult;

   /**
    * f0 -> <VOID>
    * f1 -> <MAIN>
    * f2 -> <LPAREN>
    * f3 -> <RPAREN>
    * f4 -> <LBRACE>
    * f5 -> Declarations()
    * f6 -> Statements()
    * f7 -> <RBRACE>
    * f8 -> <EOF>
    */
   public void visit(Program n) {

       n.f5.accept(this);
       Vector<jay.abssyntree.Declaration> decls = declsResult;     
       n.f6.accept(this);
      jay.abssyntree.Block block = blockResult;
      
      progResult = new jay.abssyntree.Program(decls, block);
   }


    private jay.abssyntree.Operator opResult;

   /**
    * f0 -> <STAR>
    *       | <SLASH>
    */
   public void visit(MultiplicationOperator n) {
       opResult = new jay.abssyntree.Operator(n.f0.choice.toString());
   }


    private jay.abssyntree.Expression exprResult;

   /**
    * f0 -> [ <BANG> ]
    * f1 -> Factor()
    */
   public void visit(Negation n) { 
       n.f1.accept(this);
       jay.abssyntree.Expression ex = exprResult;
       if (n.f0.present())
           exprResult = new jay.abssyntree.UnaryExpr(new jay.abssyntree.Operator("!"), ex);
       else
           exprResult = ex;
   }

}