Adaptable Grammars for Non-Context-Free Languages

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer 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

OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Udgave nummer5517
Sider (fra-til)488-503
ISSN0302-9743
DOI
StatusUdgivet - 2009
BegivenhedBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 - Salamanca, Spanien
Varighed: 10 jun. 200912 jun. 2009
Konferencens nummer: 10

Konference

KonferenceBio-Inspired Systems: Computational and Ambient Intelligence. 10th International Work-Conference on Artificial Neural Networks, IWANN 2009
Nummer10
LandSpanien
BySalamanca
Periode10/06/200912/06/2009

Bibliografisk note

Volumne: 5517

Emneord

  • formel lingvistik
  • grammatikker

Citer dette