|Recursive Ascent firstname.lastname@example.org (joel de guzman) (2002-03-21)|
|Re: Recursive Ascent email@example.com (Mikael 'Zayenz' Lagerkvist) (2002-03-22)|
|From:||"Mikael 'Zayenz' Lagerkvist" <firstname.lastname@example.org>|
|Date:||22 Mar 2002 21:02:17 -0500|
|Posted-Date:||22 Mar 2002 21:02:17 EST|
Grune and Jacobs briefly discusses recursive ascent in their book
"Parsing techinques, a practical guide". They also give som pointers
in their excellent bibliography to the relevant research papers. They
* George H. Roberts, "Recursive ascent: an LR analog to recursive
descent" , ACM SIGPLAN Notices, vol. 23, no. 8, p. 23-29, Aug 1988.
* F.E.J. Kruseman Aretz, "On a recursive ascent parser" , Inform.
Process. Lett., vol. 29, no. 4, p. 201-206, Nov 1988.
* George H. Roberts, "Another note on recursive ascent" , Inform.
Process. Lett., vol. 32, no. 5, p. 263-266, 1989.
* George H. Roberts, "From recursive ascent to recursive descent:
via compiler optimizations" , ACM SIGPLAN Notices, vol. 25, no. 4,
p. 83-89, April 1990.
The first is the original paper, and the second modifies the
technique to avoid the explicit return-stack modifications that
Roberts used. Those are hte most appropriate. You should be able to
get these from your library, or if you have access to ACM's Digital
Library, you can download it from them.
On 21 Mar 2002, joel de guzman wrote:
> I'm searching all over for more information on a parsing technique
> called "recursive ascent" I have collected very scant information so
> far. Can anyone lead me to the right direction?
Mikael 'Zayenz' Lagerkvist
Royal Institute of Technology (KTH)
Return to the
Search the comp.compilers archives again.