A GENERAL SYNTAX ANALYSIS ALGORITHM BASED ON EXTENDED BNF GRAMMAR
Affiliation:

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

    In this paper, we show how to represent an EBNF (Extended BNF) grammar in form of a syntax graph. We then give an algorithm to translate an EBNF grammar into its syntax graph form. We proceed to present a general parsing algorithm applicable to various procedural high level language and make considerations of error recovery and the insertion of semantic routines.

    Reference
    Related
    Cited by
Get Citation

杨明辉,郭肇德.基于扩展的BNF文法的通用语法分析算法.软件学报,1992,3(3):24-32

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Revised:September 24,1990
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