From: | "Aaron Gray" <ang.usenet@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Sat, 28 Jun 2008 23:32:11 +0100 |
Organization: | Compilers Central |
References: | 08-06-053 08-06-056 08-06-064 08-06-067 08-06-069 |
Keywords: | parse |
Posted-Date: | 29 Jun 2008 11:04:58 EDT |
"Torben "Fgidius" Mogensen" <torbenm@pc-003.diku.dk> wrote
> "Aaron Gray" <ang.usenet@gmail.com> writes:
>>> there is a less-known, elegant recursive formulation for LR parsers
>>> as well. Google "recursive LR parser" for a few papers.
>>
>> Is this what is refered to as Recursive Ascent ?
>
> It is indeed.
Hi Torben,
Two things :-
1) How does it work as I cannot remember, it was used in Philip's Elegant
Compiler compiler infrastructure, which I looked at some eight years ago.
Would you please give a description of how it works for those who don't
know.
2) Is it limited to LR(1) lookahead wise ?
Aaron
Return to the
comp.compilers page.
Search the
comp.compilers archives again.