Related articles |
---|
Convert to LL(1) sky4walk@gmx.de (Andre) (1998-11-06) |
Re: Convert to LL(1) mickunas@cs.uiuc.edu (1998-11-07) |
Re: Convert to LL(1) laski@ics.uci.edu (Ziemowit Laski) (1998-11-08) |
Re: Convert to LL(1) jjan@cs.rug.nl (Beeblebrox) (1998-11-12) |
From: | Beeblebrox <jjan@cs.rug.nl> |
Newsgroups: | comp.compilers |
Date: | 12 Nov 1998 01:35:31 -0500 |
Organization: | Groningen University (NL) |
References: | 98-11-046 |
Keywords: | LL(1), parse |
Andre wrote:
>
> I know only to eliminate recursion, but what about non-immidiatly
> recursion like
>
> A -> B e
> B -> A c
>
A -> A c e
--
Jan Jongejan Dept. Comp.Sci., Univ. of Groningen, Netherlands.
email: jjan@cs.rug.nl
Return to the
comp.compilers page.
Search the
comp.compilers archives again.