24 Sep 2004 00:26:52 -0400

Related articles |
---|

Proof of inherent ambiguity? dave_140390@hotmail.com (2004-09-24) |

Re: Proof of inherent ambiguity? nsanders@wso.williams.edu (Nathan Sanders) (2004-09-25) |

Re: Proof of inherent ambiguity? dido@imperium.ph (Rafael 'Dido' Sevilla) (2004-09-25) |

Re: Proof of inherent ambiguity? torbenm@diku.dk (2004-09-25) |

Re: Proof of inherent ambiguity? b.scott@csuohio.edu (Brian M. Scott) (2004-09-25) |

Re: Proof of inherent ambiguity? rdecker@hamilton.edu (Rick Decker) (2004-09-25) |

Re: Proof of inherent ambiguity? Michael.J.Fromberger@Dartmouth.EDU (Michael J. Fromberger) (2004-09-25) |

[1 later articles] |

From: | dave_140390@hotmail.com (Dave Ohlsson) |

Newsgroups: | comp.compilers,comp.theory,sci.lang |

Date: | 24 Sep 2004 00:26:52 -0400 |

Organization: | http://groups.google.com |

Keywords: | parse, theory, question |

Posted-Date: | 24 Sep 2004 00:26:52 EDT |

Hi,

A context-free grammar is said to be ambiguous if at least one string

in the context-free language defined by that grammar has more than one

parse tree with that grammar.

A context-free language is said to be inherently ambiguous if all the

context-free grammars of that language are ambiguous.

Now, I wonder how one can prove inherent ambiguity.

Could anyone give an example of an inherently ambiguous context-free

language AND the proof that that language is inherently ambiguous?

-- dave

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.