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 Article
TL;DR: One more criterion of complexity of CFG's, namely Symb (G) = = the number of all occurrences of all symbols in the rules of G, is defined and some results concerning the criteria Prod and Symb are derived.
Abstract: In papers [2] and [3] four criteria of complexity of context-free grammars (CFG's), denoted by Var, Lev, Lev„, and Depth, have been studied. These criteria reflect the intrinsic complexity of CFG's and they induce the criteria of complexity of contextfree languages (CFL's) which reflect the intrinsic complexity of the description of CFL's by CFG's. The criterion Prod (G) = the number of rules of a CFG G, studied in [3] represents the size of CFG's. In the present paper one more criterion of complexity of CFG's, namely Symb (G) = = the number of all occurrences of all symbols in the rules of G, is defined and some results concerning the criteria Prod and Symb are derived.

15 citations

Journal ArticleDOI
TL;DR: It is demonstrated that without erasing rules, one-sided random context grammars characterize the family of context-sensitive languages, and with erasingrules, these grammARS characterize theFamily of recursively enumerable languages.
Abstract: The notion of a one-sided random context grammar is defined as a context-free-based regulated grammar, in which a set of permitting symbols and a set of forbidding symbols are attached to every rule, and its set of rules is divided into the set of left random context rules and the set of right random context rules. A left random context rule can rewrite a nonterminal if each of its permitting symbols occurs to the left of the rewritten symbol in the current sentential form while each of its forbidding symbols does not occur there. A right random context rule is applied analogically except that the symbols are examined to the right of the rewritten symbol. The paper demonstrates that without erasing rules, one-sided random context grammars characterize the family of context-sensitive languages, and with erasing rules, these grammars characterize the family of recursively enumerable languages. In fact, these characterization results hold even if the set of left random context rules coincides with the set of right random context rules. Several special cases of these grammars are considered, and their generative power is established. In its conclusion, some important open problems are suggested to study in the future.

15 citations

Journal ArticleDOI
TL;DR: For every triple (k, /, m) of nonnegaUve integers, every context-free grammar G can be transformed rote a normal form where (1) each nontermmating production is of the type A ~ wkBwtCw,~ with the property that I wl appears m the length set of L(G).
Abstract: For every triple (k, /, m) of nonnegaUve integers, every context-free grammar G can be transformed rote a normal form where (1) each nontermmating production is of the type A ~ wkBwtCw,~ with I wk [ = k, I wll --/, and I w,~ [ = m, and 00 each terminating producUon A ~ w has the property that I wl appears m the length set of L(G). Apphcations and generalizations of this result are discussed. Categories and SubJect Descriptors' F 4 2 [Mathematical Logic and Formal Languages]: Grammars and Other Rewriting Systems--grammar types, F 4 3 [Mathematical Logic and Formal Languages]: Formal Languages--classes defined by grammars or automata General Terms' Theory Addltmnal

15 citations

Proceedings ArticleDOI
10 Oct 1988
TL;DR: A model for the specification of icon systems is proposed, and a general-purpose icon interpreter is presented, based on attribute grammars, which expresses the syntactic aspects of the icon systems through conceptual tree graphs.
Abstract: A model for the specification of icon systems is proposed, and a general-purpose icon interpreter is presented, based on attribute grammars. In the model, the underlying context-free grammar is a picture grammar that expresses the syntactic aspects of the icon systems. An attribute evaluator computes the meaning of a given icon sentence by evaluating the designated s-attribute of the nonterminal on the root of the parse tree. As semantic rules are actually domain-independent rule schemata, during the attribute evaluation a domain-specific knowledge base is consulted. The meaning of the ionic sentence is expressed in terms of conceptual tree graphs, which are well-suited for later execution. The design of the model is based on the theory of generalized icons. The system diagram of the icon interpreter is presented. The icon dictionary, the domain specific knowledge base, and the attribute grammar are described. >

15 citations

Book ChapterDOI
26 Mar 2011
TL;DR: This paper proposes a point-free language of dependent grammars, which it is believed closely corresponds to existing context-free parsing algorithms, and gives a novel transformation from conventional dependent Grammars to point- free ones.
Abstract: Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify common features that cannot be handled by context-free grammars, such as length fields in data formats and significant indentation in programming languages. Few parser generators support dependent parsing, however. To address this shortcoming, we have developed a new method for implementing dependent parsers by extending existing parsing algorithms. Our method proposes a point-free language of dependent grammars, which we believe closely corresponds to existing context-free parsing algorithms, and gives a novel transformation from conventional dependent grammars to point-free ones. To validate our technique, we have specified the semantics of both source and target dependent grammar languages, and proven our transformation sound and complete with respect to those semantics. Furthermore, we have empirically validated the suitability of our point-free language by adapting four parsing engines to support it: an Earley parsing engine; a GLR parsing engine; memoizing, arrow-style parser combinators; and PEG parser combinators.

15 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