scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
01 Feb 1992
TL;DR: Attribute pattern sets provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis, and can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system.
Abstract: Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. Attribute pattern sets provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets.

11 citations

Journal ArticleDOI
TL;DR: It is proved that one-sided forbidding Grammars are equivalent to selective substitution grammars and characterize the family of context-free languages.
Abstract: In one-sided forbidding grammars, the set of rules is divided into the set of left forbidding rules and the set of right forbidding rules. A left forbidding rule can rewrite a non-terminal if each of its forbidding symbols is absent to the left of the rewritten symbol in the current sentential form, while a right forbidding rule is applied analogically except that this absence is verified to the right. Apart from this, they work like ordinary forbidding grammars. As its main result, this paper proves that one-sided forbidding grammars are equivalent to selective substitution grammars. This equivalence is established in terms of grammars with and without erasing rules. Furthermore, this paper proves that one-sided forbidding grammars in which the set of left forbidding rules coincides with the set of right forbidding rules characterize the family of context-free languages. In the conclusion, the significance of the achieved results is discussed.

11 citations

Journal ArticleDOI
TL;DR: Four factors are shown to enter into a typology of grammars: the mode of use, the language of the user, the level of the users, and the aims of use.
Abstract: Four types of grammar are distinguished according to mode of use: reference grammars, pedagogical grammars, theoretical grammars, and teach-yourself grammars. Four factors are shown to enter into a typology of grammars: the mode of use, the language of the user, the level of the user, and the aims of use. Reference grammars and pedagogical grammars are characterized, the former with particular respect to A Comprehensive Grammar of the English Language. In general it is not desirable to attempt to combine in one book the functions of these two types of grammars.

11 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Parsing
21.5K papers, 545.4K citations
85% related
Time complexity
36K papers, 879.5K citations
84% related
Semantics
24.9K papers, 653K citations
82% related
Tree (data structure)
44.9K papers, 749.6K citations
81% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202315
202225
20217
20205
20196
201811