home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.compilers      Compiler construction, theory, etc. (Mod      2,753 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 1,915 of 2,753   
   Gene to All   
   Re: finding a string whether belongs to    
   28 Jun 10 17:04:30   
   
   From: gene.ressler@gmail.com   
      
   > No, context-free grammars are not closed under complement, so your   
   > claim is only true for special cases in which the complement of a   
   > context-sensitive grammar might be context-free.   
      
   I'm sorry you didn't understand what I wrote.  I only said the   
   complement of a^n b^n a^n is context free (even though the set itself   
   isn't by the pumping lemma for CFLs).  I described how to build a CFG   
   for that complement.  This grammar is a proof of CF-ness.   
      
   A small additional point is that you no doubt meant CFL's (rather than   
   CFGs) are not closed under complement.   Complement is defined on   
   sets, and a CFG is not a set.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca