| tech,17-4-P97-1002,ak | parsing </term> : a fast , practical <term> | CFG parser | </term> would yield a fast , practical <term> | #29049 Our result establishes one of the first limitations on general CFG parsing: a fast, practical CFG parser would yield a fast, practical BMM algorithm, which is not believed to exist. |
