Ambiguous Context Free Grammars (CFGs) are problematic for programming languages, as they allow inputs to be parsed in more than one way. In this paper, we introduce a simple non-deterministic search-based approach to ambiguity detection which non-exhaustively explores a grammar in breadth for ...
Since then, many approaches have been presented in the liter- ature following all classical ways to define regular languages: finite automata, grammars, logics and regular expressions. In 1991, a unifying point of view was presented in [13] where the family of tiling recognizable picture ...
There are parser generators that accept ambiguous context-free grammars, where ambiguities are resolved via disambiguation rules, with the outcome of smaller parse tables and more efficient parsers. However, the compiler writers are expected to develop compact ambiguous grammars and extract ambiguity-resol...
A troublesome feature of grammars for many programming languages, including C and C++, is a recurring problem known variously as dangling else, if-else ambiguity, or if-else conflict. We show a way to overcome this problem by syntax alone, yielding a conflict-free syntax without the need for...
grammars ha v e logarithmi and square-ro ot am biguit y , resp e tiv ely . Moreo v er it is sho wn that these am biguities are inheren t for the orresp onding languages. 2 Preliminaries Let � b e a �nite alphab et. F or a w ord w 2 � � , a sym b ol ...
On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata SIAM Journal of Computing, 14 (1979), pp. 598-611 Google Scholar [20] M. Chrobak Errata on Finite automata and unary languages Theoretical Computer S...
Languages vary with respect to word order freedom; some have a very fixed word order, like English, others allow a greater variation of word order, like Spanish, and still others allow for almost all possible combinations of phrases in a sentence, like Basque (Baker, 2001). Despite this var...
“HCRC Project: ID4S Intonation in Dialogue for Speech Recognition”, downloaded from http://www.hcrc.ed.ac.uk/Site/IDS4.html Jun. 2, 2004. Nuance Say Anything Grammars product description, downloaded from http://cafe/bevocal.com/docs/grammar/sayanthing.html Jun. 2, 2004. Liolje, ...
Design/methodology/approach - Formal grammars (FG) were proposed as the tool to deal with human and artificial languages. Fuzzy formal grammars (FFGs) are the extension of the formalism in the Theory of Fuzzy Logic and are ambiguous grammars. Here, the ambiguity of the ordered set of ...
The paper uses our context-based constraint grammars to describe the origin and resolution of ambiguities. It assumes that diagrams are available as vector graphics, not bitmaps.FutrelleR.P.Visual Languages, 1999. Proceedings. 1999 IEEE Symposium on...