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