scispace - formally typeset
Search or ask a question
Topic

Context-sensitive grammar

About: Context-sensitive grammar is a research topic. Over the lifetime, 1938 publications have been published within this topic receiving 45911 citations. The topic is also known as: CSG.


Papers
More filters
Journal ArticleDOI
TL;DR: Selective substitution array grammars are introduced, which abstract the notions of rewriting rules, direct derivation steps, derivations and rewriting in a sequential or parallel way to provide a unified framework for many of the two-dimensional array Grammars in the literature.

8 citations

Journal ArticleDOI
TL;DR: An algorithm to optimally compress a finite set of terms using a vectorial totally rigid acyclic tree grammar, based on a polynomial-time reduction to the MaxSAT optimization problem.
Abstract: We present an algorithm to optimally compress a finite set of terms using a vectorial totally rigid acyclic tree grammar. This class of grammars has a tight connection to proof theory, and the grammar compression problem considered in this article has applications in automated deduction. The algorithm is based on a polynomial-time reduction to the MaxSAT optimization problem. The crucial step necessary to justify this reduction consists of applying a term rewriting relation to vectorial totally rigid acyclic tree grammars. Our implementation of this algorithm performs well on a large real-world dataset.

8 citations

Journal ArticleDOI
TL;DR: An examination of a one‐ pass grammar for the programming language Euclid shows that the present definition of one‐pass grammars is too general: the space behaviour of the produced compilers differs from that found in conventional hand‐written compilers.
Abstract: Automatic production of one-pass compilers from attribute grammars is considered. An examination of a one-pass grammar for the programming language Euclid shows that the present definition of one-pass grammars is too general: the space behaviour of the produced compilers differs from that found in conventional hand-written compilers. A new class of attribute grammars is defined. The class models naturally the use of space in a hand-written compiler. This implies that the compiler produced automatically on the basis of the grammar uses space in the same way as a practical hand-written recursive descent compiler. Furthermore, a graphical notation is introduced as a design tool for obtaining grammars in the proposed class.

8 citations

Book ChapterDOI
19 Sep 1977
TL;DR: It is shown that with a few very minor restrictions every possible production-type may be specified as a canonical type for arbitrary context free grammars, and the result does not hold for grammar forms where a certain restriction must be made.
Abstract: This paper deals with the question of canonical forms, or canonical types, for both grammar forms and context-free grammars. Certain canonical types are position restricted if they depend only upon the positions of terminals and nonterminals. We show that with a few very minor restrictions every possible production-type may be specified as a canonical type for arbitrary context free grammars. The result does not hold for grammar forms where a certain restriction must be made.

8 citations

Book ChapterDOI
01 Jan 1997
TL;DR: In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique using a uniform solution to several elementary problems on context-free languages.
Abstract: In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique. In this note we observe that the technique is also very interesting from a pedagogical point of view, since it provides a uniform solution to several elementary problems on context-free languages. We hope that Wilfried Brauer will consider these results for inclusion in the next edition of his textbook on automata theory [5].

8 citations


Network Information
Related Topics (5)
Graph (abstract data type)
69.9K papers, 1.2M citations
80% related
Time complexity
36K papers, 879.5K citations
79% related
Concurrency
13K papers, 347.1K citations
78% related
Model checking
16.9K papers, 451.6K citations
77% related
Directed graph
12.2K papers, 302.4K citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202212
20211
20204
20191
20181