Skip to main content

AN EXTENSION OF EARLEY’S ALGORITHM FOR EXTENDED GRAMMARS

  • Conference paper

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-1-4020-3953-9_22
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   269.00
Price excludes VAT (USA)
  • ISBN: 978-1-4020-3953-9
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   349.99
Price excludes VAT (USA)

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.

    MATH  CrossRef  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.

    MATH  CrossRef  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.

    CrossRef  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

Authors

Editor information

Editors and Affiliations

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)