Topic
Indexed language
About: Indexed language is a research topic. Over the lifetime, 334 publications have been published within this topic receiving 11000 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The delta of a language L consists of the yields of trees of which all paths are in L, which are the deltas of the regular languages and the context-free languages.
Abstract: The delta of a language L consists of the yields of trees of which all paths are in L. The context-free languages are the deltas of the regular languages. The indexed languages are the deltas of the deterministic context-free languages. In general, the nondeterministic (n + 1)-iterated pushdown languages are the deltas of the deterministic n- iterated pushdown languages. The recursively enumerable languages are the deltas of the context-free languages. The delta of a string relation R consists of the yields of trees of which all paths are in the R-image of one string. The ET0L languages are the deltas of the relations recognized by deterministic two-tape finite automata. The recursively enumerable languages are the deltas of the finite state transductions.
2 citations
Book Chapter•
01 Jan 1989
2 citations
06 Jan 2003
TL;DR: This paper presents techniques for the design and implementation of domain specific languages based on higher-order attribute grammars and presents a domain specific language for pretty-printing and shows how such language can be easily embedded in the specification of a powerful spreadsheet-like tool.
Abstract: This paper presents techniques for the design and implementation of domain specific languages. Our techniques are based on higher-order attribute grammars. Formal languages are specified in the classical attribute formalism and domain specific languages are embedded in the specification via higher-order attributes. We present a domain specific language for pretty-printing and we show how such language can be easily embedded in the specification of a powerful spreadsheet-like tool. From such specification an incremental implementation is automatically derived and the first results are presented.
2 citations
TL;DR: Detailed constructions are provided demonstrating that the class of indexed Grammars introduced as a simple extension of context-free grammars has essentially the same expressive power as theclass of logic programs with unary predicates and functions and exactly one variable symbol.
Abstract: This article provides detailed constructions demonstrating that the class of indexed grammars introduced as a simple extension of context-free grammars has essentially the same expressive power as the class of logic programs with unary predicates and functions and exactly one variable symbol. Some additional considerations are concerned with parsing procedures.
2 citations
TL;DR: Using the scheduling theory approach as introduced by Gonczarowski and Warmuth (1985), this work proves a pumping property of 2- context-free languages and shows that the hierarchy of k-context- free languages is strict up to level three.
2 citations