结论树控制文法
Conclusive Tree-Controlled Grammars
摘要:
本文提出了一种新的语法调节方法。它将文法生成的派生树分为两个部分:生成树和结论树(结论)。前者包括生成符号,直到生成派生树的最右下端,而后者表示成功生成句子所需的最后步骤。提出了一种只对结论进行调节的控制机制,并将其应用到树控制文法中,建立了结论性树控制文法。作为主要结果,它表明,生成和结论部分的深度之间的比率不影响生成功率。此外,它表明,任何递归可重写的语言是由这些语法拥有不超过7个非终结符,而调节语言是union-free的。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。