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)
Deterministic parsing of ambiguous grammars
Communications of the ACM
An efficient context-free parsing algorithm
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
The Definition of Standard ML
Semi-automatic grammar recovery
Software—Practice & Experience
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
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
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
Shift-Resolve parsing: simple, unbounded lookahead, linear time
CIAA'06 Proceedings of the 11th 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
Conservative ambiguity detection in context-free grammars
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| 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 to remove 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.