From: DrDiettrich1@aol.com   
      
   Lucas S. Silva wrote:   
      
   > The algorithm I am using doesn't deal very well with recursive   
   > expression such as:   
   >   
   > a = f.g.h(a , x.y.o(1,2) )   
      
   You can transform this statement (i.e. the AST) into Reverse Polish   
   Notation (RPN), like   
      
     1 2 x y . o . () a f g . h . () a =   
      
   Now the sequence of the required actions (machine code) should be quite   
   obvious.   
      
   DoDi   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)