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
Journal Article•
25 citations
15 Aug 1991
TL;DR: It is shown that the class of very simple grammars is polynomial-time identifiable in the limit from positive data in the sense of Pitt.
Abstract: This paper concerns a subclass of simple deterministic grammars, called very simple grammars , and studies the problem of identifying the subclass in the limit from positive data The class of very simple languages forms a proper subclass of simple deterministic languages and is incomparable to the class of regular languages After providing some characterization results for very simple languages, we show that the class of very simple grammars is polynomial-time identifiable in the limit from positive data in the sense of Pitt That is, there is an algorithm that, given the targeted very simple grammar G * , identifies a very simple grammar G equivalent to G * in the limit from positive data, satisfying the property that the time for updating a conjecture is bounded by a polynomial in m , and the total number of prediction errors made by the algorithm is bounded by the cardinality k of the terminal alphabet involved in G * , where m is the maximum of k and the total lengths of all positive data provided
25 citations
TL;DR: The ideas used to develop original shape grammars are then extended to developed original color grammARS to create new and original designs.
Abstract: Shape grammars have been used with much success to study and represent past and contemporary architectural and other designs. Recently, they have begun to be used to create new and original designs...
25 citations
TL;DR: It is shown here that the equivalence problem for nondeterministic e-free generalized machines can be reduced to the equality problem of the sentential forms of a particular type of linear context-free grammars with a center-marker.
25 citations
IBM1
TL;DR: An effective method for the execution of recursive attribute grammars has been defined and applied and generated Prolog code stands in direct relation to its attribute grammar.
Abstract: This paper describes an algorithm for compiling attribute grammars into Prolog. The attribute grammars may include inherited and synthesized attributes and contain recursive (circular) definitions. The semantics of the recursive definitions is defined in terms of a fixed-point finding function. The generated Prolog code stands in direct relation to its attribute grammar, where logical variables play the role of synthesized or inherited attributes. Thus an effective method for the execution of recursive attribute grammars has been defined and applied.
25 citations