From: avron2006b@yahoo.com   
      
   You probably want to identify tail recursion. If nothing is built up on   
   the stack while recursing it is possible to avoid the recursive call. If   
   you have a grammar like: a -> Ba|N then you can when implementing the   
   parser instead of writing it like:   
   sub a()   
     matchB   
     if (look == 'N') matchN else a()   
   end sub   
      
   You could write it like this:   
   sub a()   
      loop forever   
        matchB   
        if (look == 'N')   
           matchN   
           break out from loop   
      
   You can also avoid doing a procedure call for every nonterminal. The   
   grammar you wrote above you could fit into one procedure:   
      
   sub expr   
      term()   
      if (look == '+')   
        match+   
        term()   
       elseif (look == '-')   
        match-   
        term()   
      
   The above procedure cover both expr and moreterms.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)