Recursive ascent parser

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, recursive ascent parsing is a technique for implementing an <a href="/facts/LR_parser/bpMod8K0">LR parser</a> which uses mutually-recursive functions rather than tables. Thus, the parser is directly encoded in the host language similar to <a href="/facts/Recursive_descent/ARhcuAv1">recursive descent</a>. Direct encoding usually yields a parser which is faster than its table-driven equivalent for the same reason that compilation is faster than interpretation. It is also (nominally) possible to hand edit a recursive ascent parser, whereas a tabular implementation is nigh unreadable to the average human.
Recursive ascent was first described by Thomas Pennello in his article Pennello, Thomas J. (1986). <a href="http://portal.acm.org/citation.cfm?id=13310.13326">"Very fast LR parsing"</a>. Proceedings of the 1986 SIGPLAN symposium on Compiler construction - SIGPLAN '86. pp. 145–151. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1145%2F12276.13326">10.1145/12276.13326</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0897911970. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:17214407">17214407</a>. in 1986. He was not intending to create a hand-editable implementation of an LR parser, but rather a maintainable and efficient parser implemented in <a href="/facts/Assembly_language/7XuV0cla">assembly language</a>. The technique was later expounded upon by G.H. Roberts in 1988 as well as in an article by Leermakers, Augusteijn, Kruseman Aretz in 1992 in the journal Theoretical Computer Science. An extremely readable description of the technique was written by Morell and Middleton in 2003. A good exposition can also be found in a TOPLAS article by Sperber and Thiemann.
Recursive ascent has also been merged with recursive descent, yielding a technique known as recursive ascent/descent. This implementation technique is arguably easier to hand-edit due to the reduction in states and fact that some of these states are more intuitively top-down rather than bottom up. It can also yield some minimal performance improvements over conventional recursive ascent.

Recursive ascent parser open-in-new

Recursive ascent parser