eliminate left recursion

gurukiller@gmx.de (=?ISO-8859-1?Q?Herbert_Fr=F6hlich?=)
28 Jan 2002 01:14:15 -0500

          From comp.compilers

Related articles
eliminate left recursion gurukiller@gmx.de (2002-01-28)
Re: eliminate left recursion dr_feriozi@prodigy.net (SLK Parsing) (2002-01-30)
Re: eliminate left recursion jrwyatt@nortelnetworks.com (Robert Wyatt) (2002-02-06)
| List of all articles for this month |

From: gurukiller@gmx.de (=?ISO-8859-1?Q?Herbert_Fr=F6hlich?=)
Newsgroups: comp.compilers
Date: 28 Jan 2002 01:14:15 -0500
Organization: http://groups.google.com/
Keywords: parse, question
Posted-Date: 28 Jan 2002 01:14:15 EST

The following grammar G1 is left recursive:

A -> A S.
A -> S.
S -> S "*".
S -> "(" R ")".
S -> "x".

The usual way to eliminate recursions is:

A -> A a.
A -> b.


A -> b A'.
A'-> a A'.
A'-> .

How does it work with G1? There must be solution.

Thanks for every help

Post a followup to this message

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