XPost: comp.theory   
      
   On Apr 11, 11:15 am, Hans-Peter Diettrich    
   wrote:   
   > Tegiri Nenashi wrote:   
   > > String tokenizer is the simplest parser of all. In java, arguably, it   
   > > is much more frequently used than regular expressions. Yet I fail to   
   > > see any parsing theory book ever mentioning it.   
      
      
   Isn't this a case of simple Mealy machine?   
   Q = {q0, q1}   
   Q0 = q0   
   S = {1, b, c}   
   O = {"b", "c", "bb", "bc", "cc", "cb".... }   
   D =   
             q0            q1   
      +------------------------   
   a  |      q0            q0   
   b  |      q1            q1   
   c  |      q1            q1   
      
      
   G =   
             q0            q1   
       +------------------------   
   q0  |      print()       print()   
   q0  |      append()      append()   
   q0  |      append()      append()   
      
      
   => Class-3, RegEx?   
      
   -sip   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)