In particular ,
<term>
range concatenation languages [ RCL ]
</term>
can be parsed in
<term>
polynomial time
</term>
and many
<term>
classical grammatical formalisms
</term>
can be translated into equivalent
<term>
RCGs
</term>
without increasing their
<term>
worst-case parsing time complexity
</term>
.
#1646In particular, 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.