#include "UNKNOWN.h"



int Cd_graph::check_cycle_free(  )
{
  DEM_TRACE("Cd_graph","int Cd_graph::check_cycle_free()");
  int return_val =  1 ;

  this->check_cycle_free_( return_val );
  return return_val;
}
//  Cd_graph  = <adjacencies > Adjacency_Nlist 
//            [ <terminal_sets > Vertex_Comma_list  ] .
void Cd_graph::check_cycle_free_( int& return_val )
{
  DEM_TRACE("Cd_graph","void Cd_graph::check_cycle_free_(int& return_val)");
  // variables for carrying in and out
  Cd_graph*  graph =  this ;

  // assignments for carrying in

  // prefix class wrappers
 cout << endl << "Checking inheritance cycles ..." << endl;
              

  // outgoing calls
  // construction edge prefix wrappers
  this->get_adjacencies()->check_cycle_free_( return_val, graph  );
  // construction edge suffix wrappers

  // suffix class wrappers

  // assignments for carrying out
}

//  Adjacency  = <source > Vertex 
//             [ <parameters > Vertex_Comma_list  ] 
//            <ns > Neighbors 
//            "." 
//            *l.
void Adjacency::check_cycle_free_( int& return_val, Cd_graph*  graph )
{
  DEM_TRACE("Adjacency","void Adjacency::check_cycle_free_(int& return_val,Cd_graph*  graph)");
  // variables for carrying in and out
  Vertex*  src =  this->get_source() ;

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  // construction edge prefix wrappers
  this->get_ns()->check_cycle_free_( return_val, src ,  graph  );
  // construction edge suffix wrappers

  // suffix class wrappers

  // assignments for carrying out
}

//  Neighbors  : Neighbors_wc   |
//            Repetit_n 
//           *common* .
void Neighbors::check_cycle_free_( int& return_val, Vertex*  src,Cd_graph*  graph )
{
  DEM_TRACE("Neighbors","void Neighbors::check_cycle_free_(int& return_val,Vertex*  src,Cd_graph*  graph)");
#ifndef NOTRACE
   DemTrace demTraceEmptyMethod(__FILE__,__LINE__,"Neighbors",form(" at %s , ***  PREMATURELY TERMINATED *** ", this->get_type()));
#endif

}

//  Neighbors_wc  : Construct_ns   |
//               Alternat_ns 
//           *common* +
//                    <construct_ns > Any_vertex_List 
//                    -.
void Neighbors_wc::check_cycle_free_( int& return_val, Vertex*  src,Cd_graph*  graph )
{
  DEM_TRACE("Neighbors_wc","void Neighbors_wc::check_cycle_free_(int& return_val,Vertex*  src,Cd_graph*  graph)");
#ifndef NOTRACE
   DemTrace demTraceEmptyMethod(__FILE__,__LINE__,"Neighbors_wc",form(" at %s , ***  PREMATURELY TERMINATED *** ", this->get_type()));
#endif

}

//  Alternat_ns  = ":" 
//              +
//              <alternat_ns > Term_Bar_list 
//              -
//               [ <common > Common  ] .
void Alternat_ns::check_cycle_free_( int& return_val, Vertex*  src,Cd_graph*  graph )
{
  DEM_TRACE("Alternat_ns","void Alternat_ns::check_cycle_free_(int& return_val,Vertex*  src,Cd_graph*  graph)");
  // variables for carrying in and out

  // assignments for carrying in



  // prefix class wrappers

  // outgoing calls
  // construction edge prefix wrappers
  this->get_alternat_ns()->check_cycle_free_( return_val, src ,  graph  );
  // construction edge suffix wrappers

  // suffix class wrappers

  // assignments for carrying out


}

//  Term  : Normal   |
//       CppTerm 
//           *common* <vertex > Vertex 
//                    <moduleRef > TermRef 
//                     [ <actual_parameters > Term_Comma_list  ] .
void Term::check_cycle_free_( int& return_val, Vertex*  src,Cd_graph*  graph )
{
  DEM_TRACE("Term","void Term::check_cycle_free_(int& return_val,Vertex*  src,Cd_graph*  graph)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers
 Adjacency* adjclass = graph->find_adjacency(this->get_vertex());
                if (adjclass != NULL) {
                  if ((return_val) &&
                      (adjclass->check_cycle1(graph, src))) {
                    if (!src->g_equal(this->get_vertex())) {
                      cout << "\tto   ";
                      this->get_vertex()->g_print();
                      cout << endl;
                    }
                    cout << "\tto   ";
                    src->g_print();
                    cout << endl;
                    return_val = 0;
                  } 
                }
              


  // suffix class wrappers

  // assignments for carrying out
}

//  Adjacency_Nlist  ~ Adjacency  { Adjacency  }. .
void Adjacency_Nlist::check_cycle_free_( int& return_val, Cd_graph*  graph )
{
  DEM_TRACE("Adjacency_Nlist","void Adjacency_Nlist::check_cycle_free_(int& return_val,Cd_graph*  graph)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  Adjacency_list_iterator	next_Adjacency(*this);
  Adjacency*		each_Adjacency;

  while ( each_Adjacency = next_Adjacency() )
  {
  // repetition edge prefix wrappers
    each_Adjacency->check_cycle_free_( return_val, graph  );
  // repetition edge suffix wrappers
  }

  // suffix class wrappers

  // assignments for carrying out
}

//  Term_Bar_list  ~ Term  { Term  }. .
void Term_Bar_list::check_cycle_free_( int& return_val, Vertex*  src,Cd_graph*  graph )
{
  DEM_TRACE("Term_Bar_list","void Term_Bar_list::check_cycle_free_(int& return_val,Vertex*  src,Cd_graph*  graph)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  Term_list_iterator	next_Term(*this);
  Term*		each_Term;

  while ( each_Term = next_Term() )
  {
  // repetition edge prefix wrappers
    each_Term->check_cycle_free_( return_val, src ,  graph  );
  // repetition edge suffix wrappers
  }

  // suffix class wrappers

  // assignments for carrying out
}

int Adjacency::check_cycle1( Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Adjacency","int Adjacency::check_cycle1(Cd_graph*  graph,Vertex*  src)");
  int return_val =  0 ;

  this->check_cycle1_( return_val, graph ,  src  );
  return return_val;
}
//  Adjacency  = <source > Vertex 
//             [ <parameters > Vertex_Comma_list  ] 
//            <ns > Neighbors 
//            "." 
//            *l.
void Adjacency::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Adjacency","void Adjacency::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  // construction edge prefix wrappers
  this->get_ns()->check_cycle1_( return_val, graph ,  src  );
  // construction edge suffix wrappers

  // suffix class wrappers

  // assignments for carrying out
}

//  Neighbors  : Neighbors_wc   |
//            Repetit_n 
//           *common* .
void Neighbors::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Neighbors","void Neighbors::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
#ifndef NOTRACE
   DemTrace demTraceEmptyMethod(__FILE__,__LINE__,"Neighbors",form(" at %s , ***  PREMATURELY TERMINATED *** ", this->get_type()));
#endif

}

//  Neighbors_wc  : Construct_ns   |
//               Alternat_ns 
//           *common* +
//                    <construct_ns > Any_vertex_List 
//                    -.
void Neighbors_wc::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Neighbors_wc","void Neighbors_wc::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
#ifndef NOTRACE
   DemTrace demTraceEmptyMethod(__FILE__,__LINE__,"Neighbors_wc",form(" at %s , ***  PREMATURELY TERMINATED *** ", this->get_type()));
#endif

}

//  Alternat_ns  = ":" 
//              +
//              <alternat_ns > Term_Bar_list 
//              -
//               [ <common > Common  ] .
void Alternat_ns::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Alternat_ns","void Alternat_ns::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
  // variables for carrying in and out

  // assignments for carrying in



  // prefix class wrappers

  // outgoing calls
  // construction edge prefix wrappers
  this->get_alternat_ns()->check_cycle1_( return_val, graph ,  src  );
  // construction edge suffix wrappers

  // suffix class wrappers

  // assignments for carrying out


}

//  Term  : Normal   |
//       CppTerm 
//           *common* <vertex > Vertex 
//                    <moduleRef > TermRef 
//                     [ <actual_parameters > Term_Comma_list  ] .
void Term::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Term","void Term::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers
 if (this->get_vertex()->g_equal(src)) {
                  cout << "sem-check: error: on line "
                       << this->find_line_number()
                       << " find inheritance cycle 1 :" << endl;
                  cout << endl << endl << "\tfrom ";
                  src->g_print();
                  cout << endl;
                  return_val = 1;
                }
                else {
                  Adjacency* adjclass = graph->find_adjacency(this->get_vertex());
                  if (adjclass != NULL) 
                    if (adjclass->check_cycle1(graph, src)) {
                      cout << "\tto   ";
                      this->g_print();
                      cout << endl;
                      return_val = 1;
                    }
                }
              


  // suffix class wrappers

  // assignments for carrying out
}

//  Term_Bar_list  ~ Term  { Term  }. .
void Term_Bar_list::check_cycle1_( int& return_val, Cd_graph*  graph,Vertex*  src )
{
  DEM_TRACE("Term_Bar_list","void Term_Bar_list::check_cycle1_(int& return_val,Cd_graph*  graph,Vertex*  src)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  Term_list_iterator	next_Term(*this);
  Term*		each_Term;

  while ( each_Term = next_Term() )
  {
  // repetition edge prefix wrappers
    each_Term->check_cycle1_( return_val, graph ,  src  );
  // repetition edge suffix wrappers
  }

  // suffix class wrappers

  // assignments for carrying out
}