Related articles |
---|
How to prove LL(1) grammar is also LR(1) win666888@126.com (2004-11-14) |
Re: How to prove LL(1) grammar is also LR(1) blackshark3@hotmail.com (black shark) (2004-11-17) |
From: | "black shark" <blackshark3@hotmail.com> |
Newsgroups: | comp.compilers |
Date: | 17 Nov 2004 11:42:42 -0500 |
Organization: | [Infostrada] |
References: | 04-11-041 |
Keywords: | parse, theory |
Posted-Date: | 17 Nov 2004 11:42:42 EST |
"Shuang" <win666888@126.com> ha scritto nel messaggio
> The fact is obvious, but I wonder how to prove this?
Any LL(k) grammar is also LR(k), the proof, that use the abstract
definition of LR(k) and LL(k) grammar is in the book "Parsing theory,
vol 2 LR(k9) and LL(k) parsing" (Sippu, Soisalon-Soininen.)
Return to the
comp.compilers page.
Search the
comp.compilers archives again.