Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422109 | Electronic Notes in Theoretical Computer Science | 2008 | 16 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics