Skip to main content
SpringerLink
Log in

AN EXTENSION OF EARLEY’S ALGORITHM FOR EXTENDED GRAMMARS

  • Conference paper
Computational Methods

Abstract

Most programming languages use some variants of EBNF (Extended Backus-Naur Form) to define the grammars of these languages since EBNF can make grammars more compact. Usually, these language parsers can be generated automatically by parser generators such as YACC. However, these parser generators can only work indirectly on EBNF by translating EBNF grammars into equivalent sets of BNF productions. This paper presents an extension of Earley’s algorithm which can work on any EBNF grammar directly without grammar conversion. Finally, the time bounds and space bounds are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

REFERENCES

  1. J. Earley (1970), An efficient context-free parsing algorithm. Communications of the ACM, 13, pp. 94–102.

    Article  MATH  Google Scholar 

  2. F.W. Schröer (2000), The ACCENT Compiler Compiler, Introduction and Reference. GMD Report 101, German National Research Center for Information Technology.

    Google Scholar 

  3. P. McLean and N. Horspool (1996), A faster Earley parser. In: Proc. 6th Int. Conf. on Compiler Construction, April 24–26. Lecture Notes in Computer Science, vol. 1060, pp. 281–293.

    Google Scholar 

  4. J. Aycock and R.N. Horspool (2002), Practical Earley parsing. The Computer Journal, 45, 6, pp. 620–630.

    Article  MATH  Google Scholar 

  5. N. Wirth (1977), What can we do about the unnecessary diversity of notation for syntactic definitions? Communications of the ACM, 20, 11, pp. 822–823.

    Article  Google Scholar 

  6. M. Howard Williams (1982), A flexible notation for syntactic definitions. ACM, 4, 1, pp. 113–119.

    MATH  Google Scholar 

  7. 716 C/ATLAS Subcommittee of IEEE Standards Coordinating Committee 20 (1995), Standard Test Language for All Systems—Common/Abbreviated Test Language for All Systems (C/ATLAS).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science & Technology, Jilin University, Changchun, 130012, P.R. China

    Sheng-Jun Wang & Cheng-Zhi Jin

Authors
  1. Sheng-Jun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng-Zhi Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National University of Singapore, Singapore

    G.R. LIU

  2. National University of Singapore, Singapore

    V.B.C. TAN

  3. Hunan University, P.R. China

    X. HAN

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Wang, SJ., Jin, CZ. (2006). AN EXTENSION OF EARLEY’S ALGORITHM FOR EXTENDED GRAMMARS. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-3953-9_22

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-3952-2

  • Online ISBN: 978-1-4020-3953-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation