微信服务号

微信订阅号

Home > Archive>Volume 6, Issue 9, 1995 >567-575
PDF HTML XML Export Cite reminder
AN EFFICIENT PARSING ALGORITHM ON NODE LABEL CONTEXT FREE GRAPH GRAMMAR
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    This paper discusses the property of context --free graph grammar firstly,and proves the order independence property of graph grammar derivation. An efficientgraph parsing algorithm which has a polynomial time Complexity is proposed, and the correctness of the parsing algorithm is proved.

    Reference
    Related
    Cited by
Get Citation

花全香,邢汉承,冯纯伯.一种有效的结点标号上下文无关图文法分析算法.软件学报,1995,6(9):567-575

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 14,1993
  • Revised:April 26,1994
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063