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: The main result is that pre-NTS grammars have a decidable equivalence problem.
Abstract: Pre-NTS languages have been introduced together with NTS languages by Boasson and Senizergues. In this paper we study the pre-NTS grammars. Our main result is that pre-NTS grammars have a decidable equivalence problem.

7 citations

Journal Article
TL;DR: The basic idea of this method is that the learning problem of semantic functions is transformed to a propositional form and the hypothesis induced by a propositionally learner is transformed back into semantic functions.
Abstract: Attribute grammars can be considered as an extension of context-free grammars, where the attributes are associated with grammar symbols, and the semantic rules define the values of the attributes. This formalism is widely applied for the specification and implementation of the compilation-oriented languages. The paper presents a method for learning semantic functions of attribute grammars which is a hard problem because semantic functions can also represent relations. The method uses background knowledge in learning semantic functions of S-attributed and L-attributed grammars. The given context-free grammar and the background knowledge allow one to restrict the space of relations and give a smaller representation of data. The basic idea of this method is that the learning problem of semantic functions is transformed to a propositional form and the hypothesis induced by a propositional learner is transformed back into semantic functions.

7 citations

Journal ArticleDOI
TL;DR: A normal form is established for formal grammars equipped with operators for specifying the form of the context of a substring, in which extended left contexts are never used, whereas left contexts may be applied only to individual symbols, so that all rules are of the form A ?

7 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