Re: The Functional Treatment of Parsing

: "The new implementations, called recursive
: ascent parsers, avoid explicit manipulation of parse stacks and
: parse matrices, and are in many ways superior to conventional
: implementations. They are applicable to grammars for programming
: languages as well as natural languages."
: I'm hoping to hear more about the book in particular and recursive
: ascent parsing in general.


I'd check out the author's paper:


                author="R. Leermakers",
title="{Recursive ascent parsing: from Earley to Marcus}",
journal="Theoretical Computer Science",
volume=104,
year=1992,
pages="299--312"


I think he had another one in the same volume on that subject too. For
recursive ascent parsing in general, you can check:


                author="Kruseman Aretz, F. E. J.",
                title="{On a Recursive Ascent Parser}",
                journal="Information Processing Letters",
                volume=29,
                year=1988,
                pages="201--206"


                author="G. H. Roberts",
                title="{Recursive Ascent: An LR Analog to Recursive Descent}",
                journal="ACM SIGPLAN Notices",
                volume=23,
                number=8,
                pages="23--29",
                year=1988


                author="G. H. Roberts",
                title="{Another Note on Recursive Ascent}",
                journal="Information Processing Letters",
                volume=32,
                year=1989,
                pages="263--266"


Also (my supervisor's paper):


Recursive Ascent-Descent Parsing
R. Nigel Horspool
Journal of Computer Languages, vol. 18, no. 1, 1993, pp 1-16.
(also at http://csr.uvic.ca/~nigelh/pubs.html)


John
--

Return to the comp.compilers page.
Search the comp.compilers archives again.