The C programming language
Parsing techniques: a practical guide
Parsing techniques: a practical guide
On The Ambiguity Problem of Backus Systems
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deterministic parsing of ambiguous grammars
Communications of the ACM
An efficient context-free parsing algorithm
Communications of the ACM
On ambiguity in phrase structure languages
Communications of the ACM
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Reference Manual for the ADA Programming Language
Reference Manual for the ADA Programming Language
The Definition of Standard ML
The Java Language Specification
The Java Language Specification
Semi-automatic grammar recovery
Software—Practice & Experience
Disambiguation Filters for Scannerless Generalized LR Parsers
CC '02 Proceedings of the 11th International Conference on Compiler Construction
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Toward an engineering discipline for grammarware
ACM Transactions on Software Engineering and Methodology (TOSEM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Definitive ANTLR Reference: Building Domain-Specific Languages
The Definitive ANTLR Reference: Building Domain-Specific Languages
Operations on sparse relations and efficient algorithms for grammar problems
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
The Usability of Ambiguity Detection Methods for Context-Free Grammars
Electronic Notes in Theoretical Computer Science (ENTCS)
LR-regular grammars-an extension of LR(k) grammars
Journal of Computer and System Sciences
Analyzing ambiguity of context-free grammars
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Conservative ambiguity detection in context-free grammars
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Tracking down the origins of ambiguity in context-free grammars
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
On LR parsing with selective delays
CC'13 Proceedings of the 22nd international conference on Compiler Construction
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these rules achieve the removal of all the ambiguities while preserving the original intended language can be difficult to ensure. We present an experimental ambiguity detection tool for GNU Bison, and illustrate how it can assist a grammatical development for a subset of Standard ML.