From: lee.benfield@gmail.com   
      
   On May 6, 10:14 pm, Chris F Clark  wrote:   
   >   
   > If we extend that to include "or" operators, but no recursion or   
   > closures ("plus" or "star" operators).  You can describe bounded   
   > length expressions which we call "terms".  Note one can include   
   > "question mark" operators and "character sets" in this class, without   
   > increasing its expressive power.  It's this concept, the "term"   
   > concept I am most interested in feedback on.  I believe we got this   
   > word from looking at a regular expression grammar.   
      
   * is "Kleene Closure".  + is often just called Kleene+.  A regular   
   expression without Kleene closure is a "Network Expression".   
      
   Rgds,   
      
   Lee.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)