2026-07-22T06:28:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1652 2024-03-06T11:08:11Z ddc:004 open_access

On the Semantic Approaches to Boolean Grammars Kountouriotis, Vassilis Nomikos, Christos Rondogiannis, Panos Boolean Grammars Negation in Formal Grammars Well-Founded Semantics Boolean grammars extend context-free grammars by allowing conjunction and negation in rule bodies. This new formalism appears to be quite expressive and still efficient from a parsing point of view. Therefore, it seems reasonable to hope that boolean grammars can lead to more expressive tools that can facilitate the compilation process of modern programming languages. One important aspect concerning the theory of boolean grammars is their semantics. More specifically, the existence of negation makes it difficult to define a simple derivation-style semantics (such as for example in the case of context-free grammars). There have already been proposed a number of different semantic approaches in the literature. The purpose of this paper is to present the basic ideas behind each method and identify certain interesting problems that can be the object of further study in this area. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vassilis Kountouriotis and Christos Nomikos and Panos Rondogiannis 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8271, Topological and Game-Theoretic Aspects of Infinite Computations (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08271.6 urn:nbn:de:0030-drops-16527 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08271.6 eng https://creativecommons.org/licenses/by/4.0/legalcode