| other,25-2-P01-1007,ak | can be translated into equivalent <term> | RCGs | </term> without increasing their <term> worst-case | #1646 In 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. |
