Convert to LL(1)

Andre <sky4walk@gmx.de>
6 Nov 1998 16:30:26 -0500

          From comp.compilers
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)
| List of all articles for this month |
From: Andre <sky4walk@gmx.de>
Newsgroups: comp.compilers
Date: 6 Nov 1998 16:30:26 -0500
Organization: Fraunhofer Gesellschaft
Keywords: parse, LL(1)

Hallo,


I have a BNF of a grammar for ANSI C, but I think it isn't in the LL(1)
form. So I want to write a program which transforms it to an LL(1)
grammar using it with a recursive-descent parser.


So, my question is, can anybody send me an algorithm for transforming
it. I don't exactly know what to do.


I know only to eliminate recursion, but what about non-immidiatly
recursion like


A -> B e
B -> A c


Thanks in advance.
Andre Betz

Post a followup to this message

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