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: This paper mainly study the relation between scattered context grammars, which are an example for regulated context-free rewriting devices, and context-sensitive grammar, and an argument in how far scattered context Grammars are stronger, with respect to generative capacity than unordered scattered contextgrammars.
Abstract: In this paper, we mainly study the relation between scattered context grammars, which are an example for regulated context-free rewriting devices, and context-sensitive grammars. Emphasis is laid upon both normal form characterizations of context-sensitive grammars and an argument in how far scattered context grammars are stronger, with respect to generative capacity than unordered scattered context grammars.
14 citations
14 citations
TL;DR: Some specific aspects of language structure are examined in detail in the context of pattern analysis, and the characteristics of the transformational grammars of linguists show up even in this simple example.
14 citations
TL;DR: It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms.
Abstract: This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation. It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, but also to a lambda term representing its semantics.
14 citations
21 Jun 2010
TL;DR: This article presents a framework for grammars and grammar transformations using Agda, and implements the left-corner transformation for left-recursion removal and proves a language-inclusion property as use cases.
Abstract: Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an intermediate step, it becomes easier to perform analyses and transformations that can improve the behaviour of the resulting parser. Grammar transformations must satisfy a number of invariants. In particular, they have to preserve the semantics associated with the grammar. Using conventional type systems, these constraints cannot be expressed satisfactorily, but as we show in this article, dependent types are a natural fit. We present a framework for grammars and grammar transformations using Agda. We implement the left-corner transformation for left-recursion removal and prove a language-inclusion property as use cases.
14 citations