Topic
Tree-adjoining grammar
About: Tree-adjoining grammar is a research topic. Over the lifetime, 2491 publications have been published within this topic receiving 57813 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Their equivalence implies the equivalence of several other formal systems, including a certain restricted class of Turing machines and a certain type of language equations, thus giving further evidence for the importance of the language family they all generate.
Abstract: This paper establishes computational equivalence of two seemingly unrelated concepts: linear conjunctive grammars and trellis automata. Trellis automata, also studied under the name of one-way real-time cellular automata, have been known since early 1980s as a purely abstract model of parallel computers, while linear conjunctive grammars, introduced a few years ago, are linear context-free grammars extended with an explicit intersection operation. Their equivalence implies the equivalence of several other formal systems, including a certain restricted class of Turing machines and a certain type of language equations, thus giving further evidence for the importance of the language family they all generate.
71 citations
TL;DR: It is shown that determining circularity of remote attribute grammars is undecidable and a family of conservative tests of noncircularity are described and shown how they can be used to “schedule” a remote attribute grammar using standard techniques.
Abstract: Describing the static semantics of programming languages with attribute grammars is eased when the formalism allows direct dependencies to be induced between rules for nodes arbitrarily far away in the tree. Such direct non-local dependencies cannot be analyzed using classical methods, which enable efficient evaluation.This article defines an attribute grammar extension (“remote attribute grammars”) to permit references to objects with fields to be passed through the attribute system. Fields may be read and written through these references. The extension has a declarative semantics in the spirit of classical attribute grammars. It is shown that determining circularity of remote attribute grammars is undecidable.The article then describes a family of conservative tests of noncircularity and shows how they can be used to “schedule” a remote attribute grammar using standard techniques. The article discusses practical batch and incremental evaluation of remote attribute grammars.
71 citations
04 Oct 1982
TL;DR: This paper presents a formalization of the notion graphic, which is considered to consist of an ordinary graph describing the overall structure and a set of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph.
Abstract: This paper presents a formalization of the notion graphic. A graphic is considered to consist of an ordinary graph describing the overall structure and a set of attributes describing the shape, placement, etc. of the nodes and edges of the underlying graph. The formal handling of graphics is done by attributing the rules of graph grammars and by passing the attributes up and down the derivation tree of the graphic.
70 citations
01 Jan 1975
TL;DR: In this article, a membership test is given which determines whether a given attribute grammar satisfies the required restrictions, and the membership test can be embedded in a compiler writing system which accepts an attribute grammar as input and outputs a compiler for the associated language provided the grammar meets the restrictions.
Abstract: In order to make the use of attribute grammars practical in (automatic) compiler generation, restricted attribute grammars are introduced. A membership test is given which determines whether a given attribute grammar satisfies the required restrictions. The major advantage of the restricted attribute grammars is that they are non-circular. The given membership test can be embedded in a compiler writing system which accepts an attribute grammar as input and outputs a compiler for the associated language provided the grammar meets the restrictions. The technique is also applicable to translation grammars of [15]. It is assumed that the reader is familiar with context free grammars but not necessarily with attribute grammars.
70 citations
01 Jan 2001
TL;DR: A possible implication of the lexicalization of grammatical structures and the localization of dependencies (especially the predicate- argument relationships) that are central features of LTAG is considered.
Abstract: Let us consider a possible implication of the lexicalization of grammatical structures and the localization of dependencies (especially the predicate- argument relationships) that are central features of LTAG. Consider the elementary trees in the LTAG in Figure 1.. The tree corresponding to John likes peanuts passionately is derived by starting with the elementary tree for likes and then substituting the trees for John and peanuts at the respective nodes of the tree α1 and adjoining the tree for passionately at the VP node of the tree α1. The derivation tree in Figure 1. shows this derivation. If both substitution and adjoining are described as attachment of one tree to another tree, then the entire derivation consists of a set of attachments.
70 citations