| other,13-2-P01-1007,ak | languages [ RCL ] </term> can be parsed in <term> | polynomial time | </term> and many <term> classical grammatical | #1634 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. |
