From: tk@ic.unicamp.br   
      
   > In many text books, they say that the complememt of context free   
   > language us not context free language .  But they do not say the   
   > complemet of CFL is context sensitive language or Recursively   
   > enumerable language ? So what is the language of the complement of   
   > context free language?   
      
   The complement of a CFL is obviously not only recursively enumerable but   
   also recursive. Given a CF grammar G, it is easy to imagine a Turing   
   machine which checks if a given input string belongs to L(G); if so,   
   reject reject the input, if not, accept it.   
      
   -- tk   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)