Range concatenation grammar

Range concatenation grammar (RCG) is a grammar formalism developed by Pierre Boullier in 1998 as an attempt to characterize a number of phenomena of natural language, such as Chinese numbers and German <a href="/facts/Scrambling_(linguistics)/nYToXvHF">word order scrambling</a>, which are outside the bounds of the <a href="/facts/Mildly_context-sensitive_language/sxVcwqAp">mildly context-sensitive languages</a>.
From a theoretical point of view, any language that can be parsed in <a href="/facts/PTIME/2TYvck4k">polynomial time</a> belongs to the subset of RCG called positive range concatenation grammars, and reciprocally.
Though intended as a variant on Groenink's <a href="/facts/Literal_movement_grammar/bS7k8VwW">literal movement grammars</a> (LMGs), RCGs treat the grammatical process more as a proof than as a production. Whereas LMGs produce a terminal string from a start predicate, RCGs aim to reduce a start predicate (which predicates of a terminal string) to the empty string, which constitutes a proof of the terminal strings membership in the language.

Range concatenation grammar open-in-new

Range concatenation grammar