C-Breeze Compiler Infrastructure

00001 // $Id: print_tree_visitor.h,v 1.6 2003/08/07 23:14:05 pnav Exp $
00002 // ----------------------------------------------------------------------
00003 //
00004 //  C-Breeze
00005 //  C Compiler Framework
00006 // 
00007 //  Copyright (c) 2000 University of Texas at Austin
00008 // 
00009 //  Samuel Z. Guyer
00010 //  Daniel A. Jimenez
00011 //  Calvin Lin
00012 // 
00013 //  Permission is hereby granted, free of charge, to any person
00014 //  obtaining a copy of this software and associated documentation
00015 //  files (the "Software"), to deal in the Software without
00016 //  restriction, including without limitation the rights to use, copy,
00017 //  modify, merge, publish, distribute, sublicense, and/or sell copies
00018 //  of the Software, and to permit persons to whom the Software is
00019 //  furnished to do so, subject to the following conditions:
00020 //  
00021 //  The above copyright notice and this permission notice shall be
00022 //  included in all copies or substantial portions of the Software.
00023 //  
00024 //  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025 //  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026 //  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027 //  NONINFRINGEMENT.  IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT
00028 //  AUSTIN BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
00029 //  IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
00030 //  OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
00031 //  THE SOFTWARE.
00032 //
00033 //  We acknowledge the C-to-C Translator from MIT Laboratory for
00034 //  Computer Science for inspiring parts of the C-Breeze design.
00035 //
00036 // ----------------------------------------------------------------------
00037 
00038 #ifndef CBZ_PRINT_TREE_VISITOR_H
00039 #define CBZ_PRINT_TREE_VISITOR_H
00040 
00041 
00045 class print_tree_visitor : public tree_visitor
00046 {
00047 
00048 public:
00049 
00050   // -- To display the AST, call this static function:
00051 
00052   static void print(Node * n, ostream & out);
00053 
00054 private:
00055 
00056   ostream & _out;
00057   int _indent;
00058   numbering_map * _num;
00059 
00060   void indent(Node * n) const;
00061 
00062   void in()  { ++_indent; }
00063   void out() { if (_indent > 0) --_indent; }
00064 
00065 public:
00066 
00067   print_tree_visitor(ostream & out, numbering_map * num);
00068 
00069   virtual void at_unit(unitNode * the_unit);
00070   virtual void at_decl(declNode * the_decl);
00071   virtual void at_proc(procNode * the_proc);
00072   virtual void at_prim(primNode * the_prim);
00073   virtual void at_tdef(tdefNode * the_tdef);
00074   virtual void at_ptr(ptrNode * the_ptr);
00075   virtual void at_array(arrayNode * the_array);
00076   virtual void at_func(funcNode * the_func);
00077   virtual void at_sue(sueNode * the_sue);
00078   virtual void at_struct(structNode * the_struct);
00079   virtual void at_union(unionNode * the_union);
00080   virtual void at_enum(enumNode * the_enum);
00081   virtual void at_suespec(suespecNode * the_suespec);
00082   virtual void at_const(constNode * the_const);
00083   virtual void at_id(idNode * the_id);
00084   virtual void at_binary(binaryNode * the_binary);
00085   virtual void at_unary(unaryNode * the_unary);
00086   virtual void at_cast(castNode * the_cast);
00087   virtual void at_comma(commaNode * the_comma);
00088   virtual void at_ternary(ternaryNode * the_ternary);
00089   virtual void at_call(callNode * the_call);
00090   virtual void at_initializer(initializerNode * the_initializer);
00091   virtual void at_block(blockNode * the_block);
00092   virtual void at_exprstmt(exprstmtNode * the_exprstmt);
00093   virtual void at_label(labelNode * the_label);
00094   virtual void at_case(caseNode * the_case);
00095   virtual void at_if(ifNode * the_if);
00096   virtual void at_switch(switchNode * the_switch);
00097   virtual void at_while(whileNode * the_while);
00098   virtual void at_do(doNode * the_do);
00099   virtual void at_for(forNode * the_for);
00100   virtual void at_goto(gotoNode * the_goto);
00101   virtual void at_continue(continueNode * the_continue);
00102   virtual void at_break(breakNode * the_break);
00103   virtual void at_return(returnNode * the_return);
00104   virtual void at_attrib(attribNode * the_attrib);
00105   virtual void at_text(textNode * the_text);
00106 };
00107 
00108 
00109 #endif // CBZ_PRINT_TREE_VISITOR_H