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: It is proved that twelve nonterminals are enough for cooperating distributed grammar systems working in the terminal derivation mode with two left-forbidding components (including erasing productions) to characterize the family of recursively enumerable languages.
13 citations
TL;DR: Macro grammars and context-free tree Grammars are discussed in which a bound is put on the nesting-depth of nested calls of nonterminals on the basis of dynamic or static restrictions.
Abstract: Macro grammars and context-free tree grammars are discussed in which a bound is put (dynamically or statically) on the nesting-depth of nested calls of nonterminals. The dynamic and static restrictions are closely related (and both are related to the nested stack automaton with bounded nesting of stacks). The corresponding classes of tree languages have derivation bounded contextfree languages as path-languages. Macro languages exist which cannot be generated by nesting-depth bounded macro grammars.
13 citations
TL;DR: A semantics for building grammars from a modularised specification in which modules are able to delete productions from imported nonterminals is established, to allow a precise answer to the question: ‘what character level language does this grammar generate’ in the face of difficult issues.
13 citations
Book•
01 Jan 1997
TL;DR: The author’s research has focused on parsing of Context-Free Languages, which combines Grammar Systems, Contextual Grammars and Formal Languages, and String Editing and Longest Common Subsequences.
Abstract: of Volume 2.- 1. Complexity: A Language-Theoretic Point of View.- 2. Parsing of Context-Free Languages.- 3. Grammars with Controlled Derivations.- 4. Grammar Systems.- 5. Contextual Grammars and Natural Languages.- 6. Contextual Grammars and Formal Languages.- 7. Language Theory and Molecular Genetics.- 8. String Editing and Longest Common Subsequences.- 9. Automata for Matching Patterns.- 10. Symbolic Dynamics and Finite Automata.- 11. Cryptology: Language-Theoretic Aspects.
13 citations
01 Jan 2007
TL;DR: The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms, and parsing algorithms.
Abstract: We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms, and parsing algorithms.
13 citations