网站首页  词典首页

请输入您要查询的计算机术语:

 

术语 tree grammar
释义 tree grammar
树文法
A set of four elements, Gt=(V,R,P,S), in which(a) V is a set of the identifiers of nodes;(b) R={r(x)
|v(x)∈V};(c) P is a set of production Ti to Tj, in which, Ti and Tj are trees, their nodes x meet the conditions: v(x)∈V, r(x)∈R;(d) S represents a group of start trees with finite amount.When deducting, starts from the start tree and substitutes successively the subtrees in the nodes (that is, uses the right part of the production to replace the left part). Until the substitution can not be executed any more, a terminal tree is reached. The set of all terminal trees deducted by a tree grammar is called the tree language which is produced by the tree grammar.
一种四元组Gt=(V,R,P,S),其中(1) V是节点标符的集合;(2) R={r(x)
|v(x)∈V}; (3) P是产生式Ti-Tj的集合,其中Ti和Tj都是树,它们的节点x满足:v(x)∈V,r(x)∈R;(4) S表 示一组有限棵出发树。进行推导时,由出发树开始,不断地在各节点处进行子树替换(用产生式的右部代替左部)。 到了不能再进行置换时,就得到一棵终结树。由一个树文法推出的全体终结树的集合称为由这 个树文法生成的树语言。
随便看

 

计算机英汉双解词典包含21137条计算机术语英汉翻译词条,基本涵盖了全部常用计算机术语的翻译及用法,是计算机学习及翻译工作的有利工具。

 

Copyright © 2004-2023 Winrtm.com All Rights Reserved
京ICP备2021023879号-40 更新时间:2025/1/8 10:47:50