A context-sensitive grammar (CSG) is a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a...

\alpha } on the right hand side. This distinguishes it from a context-sensitive grammar, which can have production rules in the form α A β → α γ β {\displaystyle...

context-sensitive language is a language that can be defined by a context-sensitive grammar (and equivalently by a noncontracting grammar). Context-sensitive...

It may refer to: Context-sensitive meaning, where meaning depends on context (language use) Context-sensitive grammar, a formal grammar in which the left-hand...

computational linguistics, the term mildly context-sensitive grammar formalisms refers to several grammar formalisms that have been developed in an effort...

sophisticated grammar, like a Chomsky Type 1 grammar, also termed a context-sensitive grammar. However, parser generators for context-free grammars often support...

noncontracting grammars do not occur. Chomsky (1963) calls a noncontracting grammar a "type 1 grammar", and a context-sensitive grammar a "type 2 grammar", and...

specified by a context-free grammar. If a rule depends not only on a single symbol but also on its neighbours, it is termed a context-sensitive L-system. If...

Révész transforms a grammar in Kuroda normal form to a context-sensitive grammar: AB → CD is replaced by four context-sensitive rules AB → AZ, AZ → WZ...

In formal language theory, a growing context-sensitive grammar is a context-sensitive grammar in which the productions increase the length of the sentences...

are not context-sensitive, context-sensitive languages that are not context-free and context-free languages that are not regular. Type-3 grammars generate...

restricted grammars in the Chomsky hierarchy: context-sensitive grammars or context-free grammars. In a broader sense, phrase structure grammars are also...

resolved by adding precedence rules or other context-sensitive parsing rules, so the overall phrase grammar is unambiguous.[citation needed] Some parsing...

Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi. Tree-adjoining grammars are somewhat similar to context-free grammars, but the...

only express context-free grammars; there is only one argument on the left side of the production. However, context-sensitive grammars can also be expressed...

Generalized context-free grammar (GCFG) is a grammar formalism that expands on context-free grammars by adding potentially non-context-free composition...

computer programming, the lexer hack is a solution to parsing context-sensitive grammars such as C, where classifying a sequence of characters as a variable...

only parse grammars whose production rules are constrained. In principle, contextual structure can be described by a context-sensitive grammar, and automatically...

generative capacity between context-free and context-sensitive grammars, or a subset of mildly context-sensitive grammars. Embedded pushdown automata...

Constructible strategy game, type of tabletop strategy game Context-sensitive grammar, a formal grammar Crystalline silicon on glass, see Polycrystalline silicon...

Backus-Naur form Categorial grammar Chomsky hierarchy Concatenation Context-free grammar Context-sensitive grammar Context-sensitive language Decidable language...

PSPACE-complete include determining properties of regular expressions and context-sensitive grammars, determining the truth of quantified Boolean formulas, step-by-step...

emitter-coupled logic in electronics Context-sensitive language, a language generated from a context-sensitive grammar CSL Group Ltd, a British machine to...

situation of parsing a grammar, a context model defines the surrounding text of a lexical element. This enables a context sensitive grammar that can have deterministic...

arithmetic expressions are generated by context-free grammars. Different context-free grammars can generate the same context-free language. Intrinsic properties...

context-sensitive grammars, a fact that follows from the undecidability of the halting problem. It is, however, decidable for context-free grammars....

Controlled grammars are a class of grammars that extend, usually, the context-free grammars with additional controls on the derivations of a sentence in...

a consensus seems to have been reached that Wikicode requires context-sensitive grammar rules. The following side-by-side comparison illustrates the differences...

generative grammars: Regular Grammars, Context-Free Grammars, Context-Sensitive Grammars as well as Unrestricted Grammars. Users can create these grammars using...

of it, such as a finite-state automaton. It is undecidable for context-sensitive grammars. The mortal matrix problem. Determining whether a finite set of...