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: A new procedure for finding right-linear grammars for coded, observed sequences of behavioural actions, written in Fortran to facilitate grammatical analysis is reported.

13 citations

Book ChapterDOI
01 Jan 1976
TL;DR: The algebraic approach of graph grammars using homomorphisms and pushout constructions given in /Eh-Pf-Sch 73/ and /Ros 74/ is extended to graphic systems which are graphs in a suitable category K including partial graphs, multigraphs, stochastic and topological graphs as discussed by the authors.
Abstract: The algebraic approach, of graph grammars using homomorphisms and pushout constructions given in /Eh-Pf-Sch 73/ and /Ros 74/ is extended to graphic systems which are graphs in a suitable category K including partial graphs, multigraphs, stochastic and topological graphs. These are useful models in computer science, biology, chemistry, network theory and ecology.

13 citations

Proceedings Article
01 Jan 1989
TL;DR: In this article, a parallel evaluator for attribute grammars is presented, which can expose a significant degree of inherent parallelism, and thus further increase the evaluators performance.
Abstract: Examines the generation of parallel evaluators for attribute grammars, targeted to shared-memory MIMD computers. Evaluation-time overhead due to process scheduling and synchronization is reduced by detecting coarse-grain parallelism (as opposed to the naive one-process-per-node approach). As a means to more clearly expose inherent parallelism, it is shown how to automatically transform productions of the form X to Y X into list-productions of the form X to Y/sup +/. This transformation allows for many simplifications to be applied to the semantic rules, which can expose a significant degree of inherent parallelism, and thus further increase the evaluator's performance. Effectively, this constitutes an extension of the concept of attribute grammars to the level of abstract syntax. >

13 citations

Journal ArticleDOI
TL;DR: By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars.
Abstract: A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered.

13 citations

Journal ArticleDOI
TL;DR: It is shown that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.
Abstract: We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that right-linear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular sets and under homomorphisms) and union; a slight variant is, in addition, closed under concatenation and star; their power lies between that of n-parallel grammars introduced by Wood and that of matrix languages of index n, and their relation to equal matrix grammars of degree n is discussed. We show that membership for these language classes is complete for NL. In a second part of the paper, we discuss questions concerning grammatical inference of these systems. More precisely, we show that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.

13 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