title: How do recursive ascent parsers work?
body: <p>How do recursive ascent parsers work? I have written a recursive <em>descent</em> parser myself but I don't understand LR parsers all that well. What I <a href="http://en.wikipedia.org/wiki/Recursive_ascent_parser" rel="noreferrer">found on Wikipedia</a> has only added to my confusion.</p>
  
  <p>Another question is why recursive ascent parsers aren't used more than their table-based counterparts. It seems that recursive ascent parsers have greater performance overall.</p>