Adaptable Grammars for Non-Context-Free Languages

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

We consider, as an alternative to traditional approaches for describing non-context-free languages, the use
of grammars in which application of grammar rules themselves control the creation or modification of grammar rules.
This principle is shown to capture, in a concise way, standard example languages that are
considered as prototype representatives of non-context-free phenomena in natural languages.
We define a grammar formalism with these characteristics and show how it can be implemented in logic programming
in a surprisingly straightforward way, compared with the expressive power.
It is also shown how such adaptable grammars can be applied for describing meta-level architectures that include their own explicit meta-languages for defining new syntax

Original languageEnglish
Book seriesLecture Notes in Computer Science
Issue number5517
Pages (from-to)488-503
ISSN0302-9743
DOIs
Publication statusPublished - 2009
EventBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 - Salamanca, Spain
Duration: 10 Jun 200912 Jun 2009
Conference number: 10

Conference

ConferenceBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009
Number10
CountrySpain
CitySalamanca
Period10/06/200912/06/2009

Keywords

  • formal linguistics
  • grammars

Cite this