Recursive ascent parser

In computer science, Non-Deterministic Recursive Ascent Parsing is an implementation technique for bottom-up parsers that uses mutually recursive functions instead of a stack automaton. This allows for a more functional, declarative implementation style.

External links

* [http://compilers.iecc.com/comparch/article/93-05-016 Parsing techniques]
* [http://www.aclweb.org/anthology-new/E/E91/E91-1012.pdf Non-Deterministic Recursive Ascent Parsing] , Renee Leermakers. 1991 conference on European chapter of the Association for Computational Linguistics.