disambiguating transformations

Matt Melchert <MATT@waikato.ac.nz>
Wed, 22 Sep 1993 21:49:00 GMT

          From comp.compilers

Related articles
disambiguating transformations MATT@waikato.ac.nz (Matt Melchert) (1993-09-22)
Re: disambiguating transformations bevan@computer-science.manchester.ac.uk (Stephen J Bevan) (1993-09-24)
Re: disambiguating transformations rad@cs.ucsb.edu (1993-09-25)
Disambiguating an arbitrary CFL (was: disambiguating transformations) markh@csd4.csd.uwm.edu (1993-09-25)
How to... (was: disambiguating transformations) markh@csd4.csd.uwm.edu (1993-09-26)
Re: disambiguating transformations bart@skinner.cs.uoregon.edu (Bart Massey) (1993-09-26)
Re: disambiguating transformations thinx!jos@relay.nluug.nl (Jos Horsmeier) (1993-09-27)
| List of all articles for this month |

Newsgroups: comp.compilers
From: Matt Melchert <MATT@waikato.ac.nz>
Keywords: parse, question, comment
Organization: Compilers Central
Date: Wed, 22 Sep 1993 21:49:00 GMT

I am looking for an algorithm which will take a (possibly) ambiguous context-
free grammar and perform transformations on it to yield an equivalent
non-ambiguous context-free grammar. Does such a thing exist? If not, do we
know why not? Any ideas or references would be appreciated.

[Is this even decidable? -John]

Post a followup to this message

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