# ambiguity

## Stefan Kauer <kauer@paxp01.mipool.uni-jena.de>

22 May 1997 22:41:09 -0400

*From comp.compilers*

Related articles |

**ambiguity ***kauer@paxp01.mipool.uni-jena.de (Stefan Kauer)* (1997-05-22) |

Re: ambiguity *mickunas@mickunas.cs.uiuc.edu* (1997-05-25) |

| List of all articles for this month |

**From: ** | Stefan Kauer <kauer@paxp01.mipool.uni-jena.de> |

**Newsgroups: ** | comp.compilers |

**Date: ** | 22 May 1997 22:41:09 -0400 |

**Organization: ** | FSU |

**Keywords: ** | parse, theory, question |

Hello,

I have a rather theoretical question, for which I found no answer in

several standard books on compiler writing.

I have a context free, unambigious grammar, which contains left

recursion. When the left recursion is removed (by any well known

standard algorithm), is always the case, that the new grammar is also

unambigious?

If not, I'd like to see an example. If yes, I'd like to see the proof

(or a reference to a book or paper).

Stefan Kauer

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.