From: amoebae@gmail.com   
      
   Thanks for the responses, everyone.  I was a little worried about an   
   artificial limitation on the nesting-level of sexps being imposed by   
   the use of right recursion.  Having read the docs for bison (which I'm   
   actually using), it looks like this won't come up in practice - and   
   for this project I'd rather keep it simple.   
      
   However, I'd be interested to know - can Max's solution be converted   
   to a left-recursive one that can manually allocate arbitrary hunks of   
   memory for new tokens?   How much more complicated would that solution   
   be, and what would be the general strategy?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)