期刊文献+

基于边的图文法产生式选择无关条件的判断

Selection-free judgment for productions based on edge-based context-sensitive graph grammar
下载PDF
导出
摘要 为了降低归约算法的时间复杂度,在基于边的上下文相关图文法(EGG)形式化的基础上,通过对产生式形式的适当约束,提出了EGG的产生式选择无关条件的判断方法。通过此方法可有效判断EGG产生式的选择无关性。对于选择无关的产生式,由于归约过程中产生式的使用顺序不会影响归约的结果,从而避免了回溯,能够有效地降低归约算法的时间复杂度。 In order to reduce the time complexity of parsing algorithm, based on the Edge-based context-sensitive Graph Grammar( EGG), a selection-free judgment method was proposed for the productions of EGG with appropriate constraints.This method can effectively judge the selection independence of the productions of EGG. For the selection-free productions,using the order of the productions will not affect the result of the parsing, thus the parsing process can avoid backtracking and the time complexity of the parsing algorithm can be effectively reduced.
作者 王毅 丁函
出处 《计算机应用》 CSCD 北大核心 2014年第11期3180-3183,共4页 journal of Computer Applications
基金 湖北省教育厅科学研究计划项目(Q20142607)
关键词 选择无关 归约算法 时间复杂度 基于边的上下文相关图文法 selection-free parsing algorithm time-complexity Edge-based context-sensitive Graph Grammar(EGG)
  • 相关文献

参考文献15

  • 1PFALTZ J, ROSENFELD A. Web grammars[EB/OL]. [2010-10-10]. http://ijcai.org/Past%20Proceedings/IJCAI-69/PDF/054.pdf.
  • 2ECONOMAKOS G, PAPAKONSTANTINOU G, TSANAKAS P. An attribute grammar approach to high-level automated hardware synthesis[J]. Information and Software Technology, 1995, 37(9): 493-502.
  • 3COURCELLE B. An axiomatic definition of context-free rewriting and its application to NLC graph grammars[J]. Theoretical Computer Science, 1987, 55(2/3): 141-181.
  • 4ADACHI Y, KOBAYASHI S, TSUCHIDA K, et al. An NCE context-sensitive graph grammar for visual design languages[C] // Proceedings of the 1999 IEEE Symposium on Visual Languages. Piscataway: IEEE Press, 1999: 228-235.
  • 5JANSSENS D, ROZENBERG G. Graph grammars with neighbourhood-controlled embedding[J]. Theoretical Computer Science, 1982, 21(1): 55-74.
  • 6Le METAYER D Describing software architecture styles using graph grammars[J]. IEEE Transactions on Software Engineering, 1997, 24(7): 521-533.
  • 7ZHAO C, KONG J, DONG J, et al. Pattern based design evolution using graph transformation[J]. Journal of Visual Languages and Computing, 2007, 18(4): 378-398.
  • 8DONG J, YANG S, ZHANG K. Visualizing design patterns in their applications and compositions[J]. IEEE Transactions on Software Engineering, 2007, 33(7):433-453.
  • 9FLASINSKI M. Power properties of NLC graph grammars with a polynomial membership problem[J]. Theoretical Computer Science, 1998, 201(1/2): 189-231.
  • 10MARRIOTT K. Constraint multiset grammar[C] // Proceedings of the 1994 IEEE Symposium on Visual Languages. Piscataway: IEEE Press, 1994: 118-125.

二级参考文献4

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部