From: sgillespie@bisonofborg.com   
      
   I'm trying to figure out a way to implement symbol tables in a   
   functional style, but I can't figure out a way to do that.  The only   
   way I can think to do it is to keep track of names during parsing for   
   each scope and upon entering a scope add these bindings to the   
   existing table.   
      
   I read somewhere that you can pass around your ST through arguments.   
   My thought about that is that if you are using recursion, you will   
   lose all of your mappings once that call is returns.  Does anyone have   
   any thoughts on this?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)