Bounded nesting in macro grammars
Joost Engelfriet,Giora Slutzki +1 more
Reads0
Chats0
TLDR
Macro grammars and context-free tree Grammars are discussed in which a bound is put on the nesting-depth of nested calls of nonterminals on the basis of dynamic or static restrictions.Abstract:
Macro grammars and context-free tree grammars are discussed in which a bound is put (dynamically or statically) on the nesting-depth of nested calls of nonterminals. The dynamic and static restrictions are closely related (and both are related to the nested stack automaton with bounded nesting of stacks). The corresponding classes of tree languages have derivation bounded contextfree languages as path-languages. Macro languages exist which cannot be generated by nesting-depth bounded macro grammars.read more
Citations
More filters
Journal ArticleDOI
Macro Tree Transducers
Joost Engelfriet,Heiko Vogler +1 more
TL;DR: The formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes.
Book ChapterDOI
Some open questions and recent results on tree transducers and tree languages
TL;DR: The theory of tree automata and tree grammars investigates computation on structured objects and the structure of computation as discussed by the authors, and it has been used in many areas such as program scheme theory, syntax-directed translation, and formal language theory itself.
Journal ArticleDOI
The formal power of one-visit attribute grammars
Joost Engelfriet,Gilberto Filè +1 more
TL;DR: The class of output languages of 1V (or L) attribute grammars is the image of the class of IO macro tree languages under all deterministic top-down tree transductions.
Journal ArticleDOI
Time and space complexity of inside-out macro languages
TL;DR: In this paper, it was shown that for each inside-out (or IO-) macro language $L, there is a λ-free grammar with the following property: for each $x$ in $L, there is derivation of length at most linear in the length of $x.
Journal ArticleDOI
Iterated linear control and iterated one-turn pushdowns
TL;DR: In this paper, a strong connection between iterated linear control and iterated one-turn pushdown automata is established, where the innermost pushdown is unrestricted and the language class obtained by the kth step is denoted by CTRLk(ℒ).
References
More filters
Journal ArticleDOI
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.
Journal ArticleDOI
Tree acceptors and some of their applications
TL;DR: It is shown here that the weak secondorder theory of two successors is decidable, thus settling a problem of Buchi, and this result is applied to obtain positive solutions to the decision problems for various other theories, e.g., the weaksecond-order theories of order types built up from the finite types.
Journal ArticleDOI
Mappings and grammars on trees
TL;DR: This paper studies certain sets, functions, and relations on trees using natural generalizations of ordinary automata theory using Thatcher and Wright's algebraic formalism to give succinct descriptions of linguistic constructions in the tree case.
Proceedings ArticleDOI
Grammars with macro-like productions
TL;DR: Two new classes of grammars based on programming macros are studied, one of which is IO but not OI and the other OI but not IO, showing that neither class contains the other.