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
2 citations
11 Sep 1989
TL;DR: The main idea behind the approach is to represent diagrams by (formal) graphs whose nodes are enriched with attributes as mentioned in this paper, and any manipulation of a diagram (typically the insertion of an arrow, a box, text, coloring, etc.) can be expressed in terms of the manipulation of its underlying attributed representation graph.
Abstract: This paper is a report on an ongoing work which started in 1981 and is aiming at a general method which would help to considerably reduce the time necessary to develop a syntax-directed editor for any given diagram technique. The main idea behind the approach is to represent diagrams by (formal) graphs whose nodes are enriched with attributes. Then, any manipulation of a diagram (typically the insertion of an arrow, a box, text, coloring, etc.) can be expressed in terms of the manipulation of its underlying attributed representation graph. The formal description of the manipulation is done by programmed attributed graph grammars.
2 citations
01 Jun 2008
TL;DR: New grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata by studying several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure Grammars.
Abstract: We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.
2 citations
10 Sep 2018
TL;DR: Considering appropriate automata families, the authors get boolean algebras of context-free languages, indexed languages, Petri net languages, higher order indexed languages and context-sensitive languages.
Abstract: We present a new approach to define boolean algebras of various language families: given a family \(\mathcal {F}\) of infinite automata, an automaton H recognizes the set of languages accepted by all automata of \(\mathcal {F}\) that can be mapped by morphism into H. Considering appropriate automata families, we get boolean algebras of context-free languages, indexed languages, Petri net languages, higher order indexed languages and context-sensitive languages.
2 citations
TL;DR: A generalization of the context-free LR(k)-notion is presented, which characterizes for each language class in the hierarchy generated by coupled-context-free grammars — and therefore for TAGs, too — a subclass, which can be parsed in linear time.
2 citations