XPost: comp.lang.forth, comp.lang.scheme   
   From: earlcox@earlcoxreports.com   
      
   "anonymous@netscape.net"  wrote in message   
   news:1127581933.561654.135490@g47g2000cwa.googlegroups.com...   
   > The Penultimate Universal Language Translator Solution   
   > And The Dynamic Unbound Universal Turing Machine   
   >   
   > ( start of article )   
   >   
   > . . .   
   >   
   > ... In summation, Fully extended ANSI FORTH, as defined, is a simple   
   > interpretive parser and merely suggests a ( native) bytecode   
   > compilation.   
   >   
   > As for language translation for supervisory control, the most accurate   
   > technique available is a hybrid architecture of Consequentiality (   
   > current state of events) and Neccessity ( desired events).  All objects   
   > MUST be bound with NIL ( traditional /nothingness/) by some fuzzy   
   > duality equation ( Consequentiality and Necessity) , All Class Objects   
   > Are ( Mostly) Not Nil.  All non-NIL Objects, other than *address-zero*   
   > equate, use memory. Any Object equated with NIL is immediately marked   
   > as free memory.   
   >   
   > ---   
   >   
   > Copyright 2005,   
   > Washburn,   
   > ALL RIGHTS RESERVED.   
   >   
   > ---   
   >   
   > 'Unbounded' is not a word in my dictionary.   
   >   
      
   Why is this the second to the last universal language translator solution??   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)