论文标题
最终的树木控制语法
Conclusive Tree-Controlled Grammars
论文作者
论文摘要
本文提出了一种新的语法调节方法。它将语法产生的衍生树分为两个部分基础和结论性（结论）。前者涵盖了符号的生成，直到生成衍生树的最低终端的那一刻，而后者则代表成功生成句子所需的最后一步。仅提出了基于调节的控制机制，并随后应用于树木控制的语法，从而产生了结论性的树木控制语法。作为主要结果，结果表明，生成和结论段的深度之间的比率不会影响生成力。此外，证明，这些语法均具有不超过七个非末端的语法产生的任何递归枚举的语言，而调节语言是没有工会的。
This paper presents a new approach to regulation of grammars. It divides the derivation trees generated by grammars into two sections-generative and conclusive (the conclusion). The former encompasses generation of symbols up till the moment when the lowest rightmost terminal of the derivation tree is generated, whereas the latter represents the final steps needed to successfully generate a sentence. A control mechanism based on regulating only the conclusion is presented and subsequently applied to tree-controlled grammars, creating conclusive tree-controlled grammars. As the main result, it is shown that the ratio between depths of generative and conclusive sections does not influence the generative power. In addition, it is demonstrated that any recursively enumerable language is generated by these grammars possessing no more than seven nonterminals while the regulating language is union-free.
