DOSFSG is a kind of context free grammar, DOSFSS is a kind of semantics with operation set.
其中文法部分采用了上下文无关文法，语义部分则是一个带操作集的语义系统。
If I have a context free grammar, it doesn't generate the programs. I still have to write them.
如果我有一个上下文无关的语法，它并不能自动产生程序，我还是得写程序。
The context free grammar (CFG) was applied broadly in the automatic syntactic parsing of natural language processing.
上下文无关语法(简称CFG)在自然语言的句法自动分析中已经得到广泛的应用。
This dissertation discusses the theory and realization of the Probabilistic Context Free Grammar-based syntactic parser.
本文论述了基于概率的上下文无关语法的句法分析的原理及实现过程。
Bill Venners: Is a pattern language like having a context free grammar, and from which you can make a whole bunch of programs?
BillVenners：模式语言是不是像一门上下文无关的语法，你可以用来编制相同类型的程序？
Context free grammar extended by constrained formula and an improved LR parser are adopted to formalize and recognize the special strings.
提出从组成形式和上下文语境两个方面来自动识别汉语文本中的各种特殊符号串。
Finally, you can design your own programming or domain-specific language with the help of ANTLR Studio, which lets you create context-free grammar definitions based on the ANTLR framework.
最后，您可以在ANTLRStudio的帮助下设计您自己的编程语言或特定于域的语言，ANTLR Studio允许您基于ANTLR框架创建上下文自由的语法定义。
If you work with a context-free grammar, the structure of n-gram (see Resources) might be what you require.
如果您使用一种上下文无关的文法，那么n元语法的结构(参见参考资料)可能是您所需要的。
The Sequitur compression algorithm is a linear-time online algorithm that forms a context-free grammar for a given string input.
Sequitur压缩算法是线性时间在线算法，为给定的字符串输入生成了一种与上下文无关的语法。
A probabilistic context-free grammar (or PCFG) is a context-free grammar that associates a probability with each of its productions.
probabilistic context - free grammar(或者说是PCFG)是一种上下文无关语法，它将其每一个产品关联到一个概率。
Fuzzy context-free grammar is one important kind of grammars.
模糊上下文无关文法是几种重要文法之一。
Probabilistic context-free grammar can provide a solution to this problem: select the one whose probability is maximum from the ambiguity.
概率上下文无关语法可以提供对这个问题的解决方法：从歧义中选择概率最大的解释。
First, a structural model has been put forward and constructed for general ICS ', then by utilization of formal language theory, the structural model formulated as a kind of context-free grammar.
本文走从语言文字描述至符号化再到形式化的崭新道路，首先为一般性的智能控制系统提出并建造了结构模型，然后利用形式语言理论将结构模型推导成了一种上下文无关文法。
This paper briefly introduces the classification of words and part-of-speech tagging, then introduces a computer model of syntactic processing: context-free grammar.
本文将简要介绍单词的分类与词类标注的相关内容，在此基础上介绍句法处理的一个计算机模型：上下文无关语法。
According 'to the context-free grammar model of GEP, the dissertation point out that Candida's GEP techniques cannot process context-free grammar with multiple none-terminals.
根据基因表达式编程的上下文无关文法模型，指出，基因表达式编程不能处理包含多个非终结符的上下文无关文法。
According 'to the context-free grammar model of GEP, the dissertation point out that Candida's GEP techniques cannot process context-free grammar with multiple none-terminals.
根据基因表达式编程的上下文无关文法模型，指出，基因表达式编程不能处理包含多个非终结符的上下文无关文法。
应用推荐