On the Semantic Approaches to Boolean Grammars

Authors Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis

Thumbnail PDF


  • Filesize: 230 kB
  • 12 pages

Document Identifiers

Author Details

Vassilis Kountouriotis
Christos Nomikos
Panos Rondogiannis

Cite AsGet BibTex

Vassilis Kountouriotis, Christos Nomikos, and Panos Rondogiannis. On the Semantic Approaches to Boolean Grammars. In Topological and Game-Theoretic Aspects of Infinite Computations. Dagstuhl Seminar Proceedings, Volume 8271, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


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.
  • Boolean Grammars
  • Negation in Formal Grammars
  • Well-Founded Semantics


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads