From: johann@myrkraverk.com   
      
   Hi all,   
      
   Is it possible to parse implicit operators, like the regular   
   expression concatenation operator, with a recursive descent parser?   
      
   Both of the RE recursive descent parsers I've come across on the 'net   
   preprocess the input to insert a token for concat, one with postfix,   
   the other infix.   
      
   That is, to be explicit, is it possible to make a recursive descent   
   parser that produces (*) the following parse tree on this input "aab":   
      
                                     @   
                                    / \   
                                   @   b   
                                  / \   
                                 a   a   
      
   Where @ is the implicit concatenation operator?   
      
   Johann   
      
   (*) For some value of `produce'.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)