Adaptable Grammars for Non-Context-Free Languages

Authors:
Henning Christiansen
Affiliations:
Research group PLIS: Programming, Logic and Intelligent Systems Department of Communication, Business and Information Technologies, Roskilde University, Roskilde, Denmark DK-4000
Venue:
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Year:
2009

Citing 7
Cited 1

A survey of adaptable grammars

ACM SIGPLAN Notices
Some remarks on the syntax of symbolic programming languages

Communications of the ACM
On the modification of the formal grammar at parse time

ACM SIGPLAN Notices
Contextual grammars as generative models of natural languages

Computational Linguistics
HYPROLOG: a new logic programming language with assumptions and abduction

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Meaning in context

CONTEXT'05 Proceedings of the 5th international conference on Modeling and Using Context
Christiansen Grammar Evolution: Grammatical Evolution With Semantics

IEEE Transactions on Evolutionary Computation

Adaptable parsing expression grammars

SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages

Quantified Score

Hi-index	0.00

Visualization

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.