助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   inner syntax 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

inner syntax
相关语句
  相似匹配句对
     1 syntax .
     1语法。
短句来源
     Inner Wild
     内敛的狂野
短句来源
     It is inner randomicity.
     这种现象是由系统完全确定的,是一种内随机性。
短句来源
     On the Syntax of Copula Be
     对系词Be的句法学研究
短句来源
查询“inner syntax”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


In this paper a kind of two level grammar is introduced. It is the theoretical basis of a parser generator XYZ/PG we have constructed. We consider that the top-down recursive descent method has the drawback of dividing modules too small, but the bottom-up parser is in one block and thus has the drawback of the other opposite. Both leads to unreadability and dismodifiability. In §2, we introduce a method to decompose a grammar naturally into a group of subgrammars which are connected together in a top-down way....

In this paper a kind of two level grammar is introduced. It is the theoretical basis of a parser generator XYZ/PG we have constructed. We consider that the top-down recursive descent method has the drawback of dividing modules too small, but the bottom-up parser is in one block and thus has the drawback of the other opposite. Both leads to unreadability and dismodifiability. In §2, we introduce a method to decompose a grammar naturally into a group of subgrammars which are connected together in a top-down way. This lattice theoretic structure constitutes the outer syntax of the two level grammar. Whereas each subgrammar in it is a bottom-up LR-like grammar which we call LBLR(K) and constitutes the inner syntax. To combine the top-down method with the bottom-up in this way can improve readability and modifia-bility of the parser immensely.In §3 we discuss LBLR(K) in detail. This is a refinement of the BLR(K) grammar introduced in [1]. To LBLR(K), the optimizing method of state-merging discussed in [1] is still completely applicable but the restrictive condition-so called bottom-up condition-proposed in [1] has been relinquished. It has been proved that instead of this condition the apparent "conflicts" possibly occuring after state merging can be avoided by locking backward only one symbol behind the leftmost merged state in the stack. Consequently LBLR(K) is a grammar as large as the one with which the merging method starts and which can be either SLR(K) or LALR(K).

本文介绍一种二级文法,它是我们构造的一个语法分解自动生成系统XYZ/PG的理论基础。我们认为,由顶向下的递归子程序方法分块太细,而由底向上的语法分解程序由一整块构成又失之分块太粗,二者均不便于阅读和修改。在第二节、,我们将介绍一种方法,将一文法自然地分划成一组用由顶向下的方式联结起来的子文法,这样组成格型结构即为这二级文法的外部语法,而每一子文法则是一由底向上的LR型文法,我们称这种文法为LBLR(K)文法,它即构成这二级文法的内部语法。将由顶向下与由底向上两种方法以这样的方式结合起来,可以大大提高语法分解程序的可阅读性和可修改性。 在第三节中我们详细地讨论了LBLR(K)。这文法是由文[1]中介绍的BLR(K)加以改进而成。对于LBLR(K),文[1]所讨论的状态合并的优化方法仍然完全可以应用,但是文[1]所加的所谓由底向上条件这样一种限制性条件则取消了。已经证明,代替这个条件,在状态合并后可能产生的表面上的“冲突”,可以用检查栈内在最左一个合并状态后面的一个符号的方法来予以避免。因此,从SLR(K)或LALR(K)出发,进行状态合并所得到的文法与原来的文法大小是一致的。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关inner syntax的内容
在知识搜索中查有关inner syntax的内容
在数字搜索中查有关inner syntax的内容
在概念知识元中查有关inner syntax的内容
在学术趋势中查有关inner syntax的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社