Recursive ascent: an LR analog to recursive descent
George H. Roberts · ACM SIGPLAN Notices · 1988
Irltroduct ionThe usual implementation of a parser for an LL grammar is a recursive descent parser, a set of mutually recursive procedures, one for each production rule.This paper presents a similar implementation for the LR grammars: the recursive ascent parser.A recursive ascent parser is a set of mutually recursive procedures, one for each LR state (set of items).