From: aaronngray@gmail.com   
      
   I am after a good explanation of Recursive Ascent Parsing as I wish to   
   implement a parser generator to generate recursive ascent C/C++ code from an   
   LR1 grammar.   
      
   Regards,   
      
   Aaron   
   [The Wikipedia article isn't bad and has several promising references,   
   but I wonder if it's worth the effort. RA parsing does what yacc or   
   bison does, but by turning each state into a function. It's supposed   
   to be faster than a table driven parser, but LALR parsers are already   
   so fast, how much faster will it be? Maybe it'll even be slower since   
   there is a lot more code so it's less likely to fit in a CPU cache.   
   -John]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)