作者: C. Chirathamjaree , Martin H. Ackroyd
DOI: 10.1016/S0020-7373(80)80022-8
关键词: Context-sensitive grammar 、 Tree-adjoining grammar 、 Computer science 、 Mildly context-sensitive grammar formalism 、 Grammar 、 Recursion 、 Stochastic context-free grammar 、 Extended Affix Grammar 、 Grammar-based code 、 Affix grammar 、 Context-free grammar 、 Algorithm
摘要: A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from set strings that cfg required to be capable producing. The efficient in computing time by comparison with enumerative methods.