| other,17-2-P01-1007,ak | <term> polynomial time </term> and many <term> | classical grammatical formalisms | </term> can be translated into equivalent | #1638 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. |
