Fri, 29 Jul 1994 03:13:24 GMT

Related articles |
---|

Unambiguity proofs for CFG's matt@waikato.ac.nz (1994-07-29) |

Re: Unambiguity proofs for CFG's bromage@mundil.cs.mu.OZ.AU (1994-08-01) |

Newsgroups: | comp.compilers |

From: | matt@waikato.ac.nz (Matt Melchert) |

Keywords: | theory, question |

Organization: | University of Waikato, Hamilton, New Zealand |

Date: | Fri, 29 Jul 1994 03:13:24 GMT |

Last year I posted a query as to whether it was possible to determine if a

grammar is unambiguous. The answer is that it is not, the proof being the

Post Correspondence Problem. But further reflection has yielded the

intuition that if "ambiguity" is equivalent to "can produce more than one

parse tree for some input", then wouldn't it be enough to show that for a

given grammar any input could still only produce one parse tree? Can you

do that, perhaps by induction?

Matt

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.