Ambiguity in context-free grammars
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Detection of Generative Ambiguities in Context-Free Mechanical Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Disambiguation Filters for Scannerless Generalized LR Parsers
CC '02 Proceedings of the 11th International Conference on Compiler Construction
A discipline of dynamic programming over sequence data
Science of Computer Programming - Methods of software design: Techniques and applications
A graphical programming system for molecular motif search
Proceedings of the 5th international conference on Generative programming and component engineering
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Conservative ambiguity detection in context-free grammars
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
An Experimental Ambiguity Detection Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Systems
Analyzing Context-Free Grammars Using an Incremental SAT Solver
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Type-based specialization of xml transformations
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
The Usability of Ambiguity Detection Methods for Context-Free Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
An experimental ambiguity detection tool
Science of Computer Programming
Typed and unambiguous pattern matching on strings using regular expressions
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Syntactic Language Extension via an Algebra of Languages and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Faster ambiguity detection by grammar filtering
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Semantics and Ambiguity of Stochastic RNA Family Models
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
XML graphs in program analysis
Science of Computer Programming
| Hi-index | 0.00 |
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. 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.