Yacc is a grammar parser; it reads text and can be used to turn a sequence of words into a structured format for processing.
Yacc是一种语法分析器，它可以读取文本并用来将单词序列转换为便于处理的结构化的格式。
You can step through the emitted parser code at runtime to see what it's actually doing and adjust the grammar file accordingly.
您可以在运行时单步遍历产生的解析器代码，以便查看它到底在做什么，并相应地调整语法文件。
Parser generators take the grammar of a language and generate code to parse it.
分析器产生器的作用是接收一门语言的文法并产生代码以分析该语言。
It creates a parser object around a grammar.
它围绕着文法创建解析器对象。
Since the grammar of JSON is fairly simple, you can implement such a parser easily without any noticeable performance difference.
由于JSON的语法相当的简单，您可以轻易地实现这种解析器，而不会带来显著的性能差异。
Here, the parser tests combinations of tokens to see how they compare to the abstract elements in its grammar.
在这里，解析器检测标记间的结合同其语法中的抽象元素的匹配程度。
You'll have to write your own grammar for the file format, however, and then develop your own parser to read it.
您必须为文件格式自行编写语法，随后开发自己的解析器来阅读它。
I haven't found any grammar files for the CDT, but we can determine its abstract model elements from the methods in the Parser class and from the comments that precede these methods.
我没找到关于CDT的语法文件，但我们可以根据parser类的方法以及这些方法之前的注释确定其抽象模型元素。
These comments don't provide complete CDT grammar, but if you're trying to use or modify the Parser class, you'll them helpful.
这些注释并不提供完整的cdt语法，但如果试图使用或修改parser类，它们将会很有帮助。
Using ANTLR meant that the grammar and parser had to be created from scratch, which is different from JRuby's approach.
使用ANTLR意味着文法和分析器的创建工作必须从零开始，这不同于JRuby的方法。
The Gang advocates abandoning your core language and building an entirely new one atop it, creating your own lexer, parser, grammar, and so on.
四人组主张放弃核心语言并在其上构建全新的语言，创建您自己的lexer、解析器、语法等等。
The order of the productions in a.jj file is generally irrelevant except in this case, where the name of the topmost production in the grammar is used to invoke the parser.
jj文件中的结果顺序通常是无关的，而本案例除外，在本案例中，语法中最顶部的结果名称用于调用解析器。
In the original parser, expressions like "5 + 5 + 5" were acceptable owing to the rep combinator in the grammar definition for expressions (expr) and terms (term).
在原来的解析器中，可以接受像“5 + 5 + 5”这样的表达式，因为语法中为表达式(expr)和术语(term)定义了rep组合子。
You can specify the grammar caching parser configuration (org.apache.xerces.parsers.XMLGrammarCachingConfiguration).
指定语法缓冲解析器配置(or g . apache . xerces . parsers . XMLGrammarCachingConfiguration)。
For example, the Apache Xerces-J parser defines its own grammar caching API (see Resources).
比如，ApacheXerces - j解析器定义了自己的语法缓冲api(请参阅参考资料)。
Also note that the user doesn't need to define grammar for such trivial stuff: Spirit already has the predefined parser real_p to parse real Numbers.
注意，用户并不需要为此类琐碎的操作定义语法：Spirit已经提供了预定义的parser real _ p来解析实数。
Regardless of the way you decide to create the parser, you need to understand the syntax of the DB2 trace files and design the grammar for this syntax.
无论决定如何创建解析器，您都需要理解DB2跟踪文件的语法，并为此语法设计文法。
The parser compiles any new schema it needs for validation and gives all the compiled schemas back to the grammar pool after the parsing of your XML document is complete.
解析器对验证需要的任何新模式进行编译，并在XML文档解析完成之后将编译过的模式交给语法池。
If the expression you're passing in to the parser code can't be legally constructed according to the grammar, either a ParseException or a LexicalError is thrown.
如果正在传递给解析器代码的表达式不能根据语法合法地构造，则将抛出ParseException或LexicalError。
The parser attempts to match the input following a well-defined set of specifications known as grammar rules.
分析器尝试以一系列完整定义的规范来匹配输入，这些规范被称为语法规则。
This dissertation discusses the theory and realization of the Probabilistic Context Free Grammar-based syntactic parser.
本文论述了基于概率的上下文无关语法的句法分析的原理及实现过程。
I don't even need the language to have a parser or an implementation associated, all I need is the description of the language itself, either as a BNF grammar or even informally.
我甚至都不需要的语言有一个解析器或实施相关的，我需要的是语言本身的描述，无论是作为BNF语法甚至是非正式的。
Context free grammar extended by constrained formula and an improved LR parser are adopted to formalize and recognize the special strings.
提出从组成形式和上下文语境两个方面来自动识别汉语文本中的各种特殊符号串。
Context free grammar extended by constrained formula and an improved LR parser are adopted to formalize and recognize the special strings.
提出从组成形式和上下文语境两个方面来自动识别汉语文本中的各种特殊符号串。
应用推荐