context-sensitive grammar


Also found in: Wikipedia.

context-sensitive grammar

[′kän‚tekst ‚sen·səd·iv ′gram·ər]
(computer science)
A grammar in which the rules are applicable only when a metavariable occurs in a specified context.
References in periodicals archive ?
Lemma 1 ([4]) For every context-sensitive grammar there exists an equivalent grammar in the Kuroda normal form.
Virkkunen proved that propagating scattered context grammars which use leftmost derivations are as powerful as context-sensitive grammars.
In theory, semantic aspects of PASCAL could be specified using a context-sensitive grammar (type 1 in Chomsky hierarchy), but such approach would be excessively cumbersome in practice.
After a quick overview of necessary prerequisites such as set and graph theory and the study of relations and general logic, the author follows a path that narrows its themes from chapter to chapter: from regular to context-free languages and their models, to Turing machines and specific computation issues, including computability and decidability and general and context-sensitive grammars.
Full browser ?