Transformation of Extended Grammar Based on Super Grammars

基于超文法的扩展文法转换技术

On Adequate Testing of context-free Grammars

上下文无关文法测试充分性

Probabilistic Regular Grammars for the Evaluation of Human-Computer Interface Usability

使用概率规则文法评估人机界面可用性

||1:Many of the universals that hold up best are negative.||2:There are many sensible things languages could do, but don’t.||3:Notably, their grammars do not make use of “continuous” features, such as the length of vowels.||4:For instance, a past-tense verb could be pronounced for a longer time to indicate how long ago the action occurred—perfectly logical, but no language does this.||5:Syntax uses discrete units, not continuous ones.||6:Whether this is proof of universality is a matter of opinion.

||1:许多最能站得住脚的普遍性都是负面的。||2:语言可以做很多看起来合理的事情，但是没有做。||3:值得注意的是，他们的语法没有使用“连续的”特征，比如元音的长度。||4:例如，过去时态动词可以发音更长的时间来表示动作发生的时间——完全符合逻辑，但是没有语言能做到这一点。||5:语法使用离散单元，而不是连续单元。||6:这是否证明普遍性是一个意见问题。

OOV is a common problem in small grammars .

OOV是小文法中的一个常见问题。

Perl 6 grammars and regular expressions allow non-grouping matches, which do not save their result.

Perl6语法和正则表达式允许非分组匹配，不保存它们的结果。

P: : RD grammars can associate an action with every rule as an integral part of the parsing process. This is very important.

RD语法可以将动作（action）与每一个规则关联起来，将其作为解析过程中的一个完整部分。

Web services policies include policy description documents based on common, standardized policy grammars .

Web服务策略包括基于通用的标准化策略语法的策略描述文档。

This study proposes a model of computer-aided form development based on the concept of shape grammars .

本文以咖啡杯设计为例，提出一套以文法概念为基础的电脑辅助造形设计的方法。

Finding tokens is a bit interesting, but the real work comes with applying grammars to the token lists.

查找记号的确有一点意思，但真正有意思的是如何向记号列表应用语法。

Moreover, EBNF grammars are already familiar to many programmers, even if only in passing.

此外，即使只是顺便学会的，许多程序员也已经相当熟悉EBNF语法了。

In addition, context-free grammars allow XSeq to process queries directly over the compressed file without full or partial decompression.

此外，上下文无关的语法允许XSeq直接通过压缩文件处理查询，而不必对文件进行全部或部分解压缩。

Most of the data binding frameworks for Java language programs are focused on code generation from W3C XML Schema grammars .

大多数用于Java语言程序的数据绑定框架都注重于根据W3CXMLSchema语法生成代码。

Most formal parsers use variants on Extended Backus-Naur Form (EBNF) to describe the "grammars " of the languages they describe.

大多数正式的解析器都使用扩展巴科斯范式（ExtendedBackus-NaurForm，EBNF）上的变体来描述它们所描述的语言的“语法”。

Debugging declarative grammars is often more difficult than incrementally adjusting imperative code.

调试声明性语法通常比用增量方式来调整命令式代码更困难。

The grammars for complex languages are commonly described using BNF (Backus-Naur Form) notation or its close relative, EBNF (Extended BNF).

复杂语言的语法通常都是使用BNF（巴科斯-诺尔范式，Backus-NaurForm）表示法或者其“近亲”―EBNF（扩展的BNF）描述的。

It is possible also that in my inexperience I have designed inefficient grammars ; but if so, most users would likely do likewise.

还有可能的是，由于我经验不足，可能设计出低效的语法；不过就算是这样，大部分用户也很可能会象我一样。

The initialization, globals, and grammars sections are next.

接下来是初始化、全局变量和文法部分。

Multiple parsers can be used with different grammars and purposes in a single program.

可以在一个程序中用具有不同文法和用途的多个解析器。

Like P: : RD, those grammars use simple rules to do lexing, and then use more complex rules to parse the lexed input.

类似于P：：RD，那些语法使用简单的规则来进行词法分析，然后使用更复杂的规则来解析经过词法分析后的输入内容。

Spellings vary slightly, but the general notions of quantification, alternation, and sequencing exist in all EBNF-style language grammars .

拼写稍有不同，但是量化、交替和定序这些一般概念都存在于所有EBNF样式的语言语法中。

Second, those grammars are poorly coordinated with the dialog managers that use them.

其次，这些文法与使用它们的对话管理器不太协调。

Keep in mind the differences between XML grammars and XML message sets.

请您记住XML文法和XML消息集之间的区别。

If you want to understand Perl 6 grammars , you'll have to learn more about lexing and parsing that you probably ever wanted to.

如果您想要理解Perl6语法，就不得不去深入学习您可能曾经想过要学的lexing和parsing。

The main drawbacks to using Quick are the complexity of the various schema files and the lack of support for Schema grammars .

使用Quick的主要缺点是各种模式文件的复杂性，以及缺乏对Schema文法的支持。

In independent schools, 53. 7% of GCSEs sat were awarded an A or A*, compared with 55% in grammars and 17. 3% in comprehensives.

私立学校有53.7%的GCSE考生得到A或A+，文法学校55%，综合学校17.

Graph or table representations for formal language grammars and network protocols

形式语言语法和网络协议的图或表表示法

To make this possible restrictions are applied to both grammars , which are enforced during property validation.

要实现这一点，必须对两种语法同时应用限制，在属性验证时执行。

Generic XML structures that suit a variety of applications are XML grammars .

一般性XML结构适合于各种应用程序，它是一种XML文法。

It is important to draw a distinction between natural language processing (NLP) and specific n-gram grammars .

一定要对自然语言处理（NLP）和特定的n元语法加以区别。

Chomsky grammars

乔姆斯基文法

inferences of tree grammars

语法树推理

admissible class of grammars

容许文法类

simultaneous parallel array grammars

同时并行阵列方法

simultaneous parallel array grammars

同时并行阵列文法

extraposition grammars with slash categories

带有斜线范畴的附加位置语法