One way of verifying a grammar is the detection of ambiguities. Ambiguities are not always unwanted, but they can only be controlled if their sources are known. Unfortunately, the ambiguity problem for context-free grammars is undecidable in the general case. Various ambiguity detection methods (ADMs) exist, but they can never be perfect. In this paper we explore three ADMs to test whether they still can be of any practical value: the derivation generator AMBER, the LR(k) test and the Noncanonical Unambiguity test. We benchmarked their implementations on a collection of ambiguous and unambiguous grammars of different sizes and compared their practical usability. We measured the accuracy, termination and performance of the methods, and analyzed how their accuracy could be traded for performance.
机构:
United Arab Emirates Univ, Coll Informat Technol, Dept Comp Sci & Software Engn, Al Ain 15551, U Arab EmiratesUnited Arab Emirates Univ, Coll Informat Technol, Dept Comp Sci & Software Engn, Al Ain 15551, U Arab Emirates
Turaev, Sherzod
论文数: 引用数:
h-index:
机构:
Abdulghafor, Rawad
论文数: 引用数:
h-index:
机构:
Alwan, Ali Amer
Abd Almisreb, Ali
论文数: 0引用数: 0
h-index: 0
机构:
Int Univ Sarajevo, Fac Engn & Nat Sci, Sarajevo 71210, Bosnia & HercegUnited Arab Emirates Univ, Coll Informat Technol, Dept Comp Sci & Software Engn, Al Ain 15551, U Arab Emirates