上下文无关文法（Context-Free Grammar, CFG）是一个4元组G=(V, T, S, P)
上下文无关文法（Context-Free Grammar, CFG）是一个4元组G=(V, T, S, P)，其中，V和T是不相交的有限集，S∈V，P是一组有限的产生式规则集，形如A→α，其中A∈V，且α∈(V∪T)*。V的元素称为非终结符，T的元素称为终结符，S是一个特殊的非终结符，称为文法开始符...
Context-Free技术资料
📦 资源总数：446
💻 源代码：560572
🔥 Context-Free热门资料
查看全部446个资源 »SVMcfg: Learns a weighted context free grammar from examples. Training examples (e.g. for natural la
SVMcfg: Learns a weighted context free grammar from examples. Training examples (e.g. for natural language parsing) specify the sentence along with th...
Draak is a multi-language, macro compiler, meaning all syntax and code generation is defined in a si
Draak is a multi-language, macro compiler, meaning all syntax and code generation is defined in a single file. Draak is a single binary that is able t...
Foundations of Data Science
Computer science as an academic discipline began in the 1960’s. Emphasis was on programming languages, compilers, operating systems, and the mathemati...
free BSD
free BSD...
📂 Context-Free资料分类