检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用与软件》2006年第4期100-102,共3页Computer Applications and Software
基 金:国家自然科学基金资助(编号:60372072)。
摘 要:LR分析技术以其自身的优点在实践中有着非常广泛的应用,但是,用自底向上的策略实现属性计算对属性文法本身有着非常严格的限制,不得不将语法分析与属性计算分别进行,引入了极大的复杂性。利用属性栈及回填技术能够从根本上解决这一问题。主要讨论了基于回填技术的LR属性计算器的算法原理及实现技术。With its excellent characteristics, LR analysis technique has gained extensive use in pratical. But the applicable attributed grammars to the bottom - up attribute evaluator are strictly narrowed down for the sake of its bottom - up policy. Usually,we had to separate attributes evaluation from syntax analysis, but it introduced much of complexity in. Taking advantage of attribute stack and backfilling technique, we can solve this problem radically. In this paper, the principles and implementing techniques of the algorithm for attributed grammar evaluator based on LR analysis and backfilling technique is presented.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.64