Analyzing Ambiguity of Context-Free Grammars

Abstract

<p>It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. However, the fact that the problem is undecidable does not mean that there are no useful <em>approximations</em> to the problem.<br /> <br />We observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this to conservatively approximate the problem based on local regular approximations and grammar unfoldings. As an application, we consider grammars that occur in RNA analysis in bioinformatics, and we demonstrate that our static analysis of context-free grammars is sufficiently precise and efficient to be practically useful.</p><p> </p><p>Full text: <a href="http://dx.doi.org/10.1016/j.scico.2009.11.002" target="_self">http://dx.doi.org/10.1016/j.scico.2009.11.002</a></p>