The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP.
range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity.