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 published on a yearly basis
Papers
More filters
••
[...]
TL;DR: A new class of grammars with derivation restrictions (similar to the matrix, conditional ones, etc.) is presented, where if a rule of a subset peculiar to P is used in a derivation then it is compulsory to use only productions of that particular subset as long as it is possible.
Abstract: In this article a new class of grammars with derivation restrictions (similar to the matrix, conditional ones, etc.) is presented. In this situation, if a rule of a subset peculiar to P is used in a derivation then it is compulsory to use only productions of that particular subset as long as it is possible. According to the Chomsky hierarchy, naturally attributed to the grammars the generative power of the modular grammars is studied (Section 2), a series of results being obtained as well as a normal form similar to Chomsky's normal one. The following two paragraphs deal with the closure properties—only for ℳ 2 and (proving that ℳ 2 is AFL) and also with decision problems connected with the modular grammars, using algorithmical proofs in general.
19 citations
••
13 Nov 1994TL;DR: A truly concurrent semantics for graph grammars, based on event structures, is proposed that generalizes to arbitrary consuminggrammars (i.e., such that each production deletes some items) the semantics presented in [4] for the subclass of safe Grammars.
Abstract: We propose a truly concurrent semantics for graph grammars, based on event structures, that generalizes to arbitrary consuming grammars (i.e., such that each production deletes some items) the semantics presented in [4] for the subclass of safe grammars. Also, parallel derivations are explicitly considered, instead of sequential ones only as in [4]. The “domain” and the “event structure” of a grammar are introduced independently, and one main result shows that they are strongly related, since the domain is the domain of finite configurations of the event structure. Another important result provides an abstract characterization of when two (parallel) graph derivations should be considered as equivalent from a true-concurrency perspective.
19 citations
••
TL;DR: The paper revises removal of left recursion in the context of grammar adaptations and demonstrates, that while removing left recursions at the same time the semantic rules can be migrated automatically, so a programmer can continue to use semantic rules on a left recursive grammar.
19 citations
•
TL;DR: A classification of context-free languages according to the minimal number of non-terminals of generalized context- free grammars is studied and the corresponding decision problems are investigated.
Abstract: 1 . Introduction. Generalized context-free grammars can be thought of as contextfree grammars all rules of which are of the form A where a is a regular expression. Generalized context-free grammars and their representation by a set of finitestate diagrams are a convenient tool to describe context-free languages. In this paper a classification of context-free languages according to the minimal number of non-terminals of generalized context-free grammars is studied and the corresponding decision problems are investigated.
19 citations
••
01 Nov 1988
TL;DR: A grammar that formally constructs the types of diagrams used in system dynamics is fully described and a method to achieve a formal program for interactive modeling upon any diagram, starting from the formal specification of the diagram, is presented.
Abstract: A grammar that formally constructs the types of diagrams used in system dynamics is fully described. It belongs to the special kinds of grammars (attributed programmed graph grammars) that are applied to the construction of graphs and geometric figures. The flow diagrams used in system dynamics have been defined by 'attributed graphs' so that the approach could be applied. The grammar manipulates the graphs according to the requirements of the methodology. Basically, a method to achieve a formal program for interactive modeling upon any diagram, starting from the formal specification of the diagram, is presented. >
19 citations