| 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. | |
| tech,6-5-P01-1007,ak | non-deterministic parsing choices </term> of the <term> | main parser | </term> for a <term> language L </term> are | #1706 The non-deterministic parsing choices of the main parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L . |
