| other,29-2-P01-1007,ak | RCGs </term> without increasing their <term> | worst-case parsing time complexity | </term> . For example , after <term> translation | #1650 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 . |
