期刊文献+

联接文法PFIRST和PFOLLOW集合的并行算法设计

The design of parallel algorithm on PFIRST and PFOLLOW set of conjunctive grammars
下载PDF
导出
摘要 为了解决多处理机环境下联接文法的LL(1)分析表的构造问题,提出联接文法的PFIRST和PFOLLOW集合的并行处理方法,通过实例验证了算法的正确性和可行性。 In order to solve the problem of the structure of connection grammar LL( 1 ) analysis table in the muhiprocessor environment, a parallel processing method to PFIRST and PFOLLOW set is proposed. The correctness and feasibility of the algorithm are demonstrated by examples. It has important theoretical and practical significance.
作者 李玉萍
出处 《陕西理工学院学报(自然科学版)》 2013年第5期32-34,共3页 Journal of Shananxi University of Technology:Natural Science Edition
基金 河南省科技厅基础与前沿技术研究计划项目(122300410388)
关键词 联接文法 PFIRST集 PFOLLOW集 conjunctive grammar PFIRST sets PFOLLOW sets
  • 相关文献

参考文献5

  • 1Alexander Okhotin. A recognition and parsing algorithm for arbitrary conjunctive grammars[ J] . Theoretical Computer Sci-ence, 2003 (302) :365-399.
  • 2Alexander Okhotin. On the closure properties of linear conjunctive languages [ J]. Theoretical Computer Science,2003(299) :663-685.
  • 3Alexander Okhotin. Conjunctive grammars[ J]. Autom Languages Combin,2001,6(4) :519-535.
  • 4Alexander Okhotin. Top-down parsing of conjunctive languages[ J]. Grammars,2002,5(1) :21-40.
  • 5李玉萍.基于Earley算法的关联文法语法分析的并行处理[J].陕西理工学院学报(自然科学版),2012,28(3):27-31. 被引量:1

二级参考文献4

  • 1Alexander Okhotin. A recognition and parsing algorithm for arbitrary conjunctive grammars [ J ]. Theoretical Computer Science,2003,302(10) :365-399.
  • 2Alexander Okhotin. The hardest linear conjunctive language [ J ]. Information Processing Letters, 2003,86 ( 6 ) : 247- 253.
  • 3Alexander Okhotin. On the closure properties of linear conjunctive languages [ J ]. Theoretical Computer Science, 2003,299( 1 ) :663-685.
  • 4Gibbons A, Rytter W. Efficient parallel parsing algorithms [ M ]. Cambridge : Cambridge University Press, 1990.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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