Grammars with Exclusion

Abstract

Abstract
Formal grammars represent a practical tool for description and processing programming languages, as well as for modeling and study of natural languages. In this paper, we introduce and study a new type of formal grammars—grammars with exclusion. Procedures of language generation by grammars with exclusion are elaborated. In contrast to conventional formal grammars, one grammar with exclusion can generate several types of languages. It is
demonstrated that they have essentially higher computational power and expressive possibilities in comparison with the conventional formal grammars, as well as with grammars with prohibition or Boolean grammars. Results presented in this paper are aimed at the development of modeling natural languages, empowerment of programming languages, human–machine interaction, computer simulation, better software systems, and theory of recursion.

Keywords: Formal grammar, formal language, hierarchy, natural language, programming language

Cite this Article
Burgin M. Grammars with exclusion. Journal of Computer Technology & Applications. 2015; 6(2): 56–66p.