Advertisement

A bottom-up adaptation of earley's parsing algorithm

  • Frédéric Voisin
Grammars
Part of the Lecture Notes in Computer Science book series (LNCS, volume 348)

Abstract

in this paper we have described a new, bottom-up, parsing algorithm, derived from the standard Earley's algorithm. It is easier to understand and more efficient, thanks to the precomputation of some closure relations and to the minimization of the number of items that it computes, and yields an improved practical efficiency and a better error explanation capability which make it well adapted to be the parsing system of many experimental environments.

Keywords

Parse Tree Error Recovery Partial Derivation Terminal Symbol Common Prefix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. Aho & J. Ullman: The theory of Parsing, Translation and Compiling, Vol. 1: Parsing, Prentice-Hall, Englewoods Cliffs, N.J.Google Scholar
  2. [2]
    M. Bidoit, F. Capy, C. Choppy, N. Choquet, C. Gresse, S. Kaplan, F. Schlienger & F. Voisin: ASSPRO: an Interactive and Integrated Programming Environment, Technology and Science of Informatics (John Wiley and Sons), Vol. 6, N. 4, 1987, pp. 259–278.Google Scholar
  3. [3]
    M. Bidoit, M.C. Gaudel & A. Mauboussin: How to make algebraic specifications more understandable? An experiment with the PLUSS specification Language, L.R.I. Research Report 343, April 1987.Google Scholar
  4. [4]
    P. Boullier: Contribution à la construction automatique d'analyseurs lexicographiques et syntaxiques, Thèse d'Etat, Université d'Orléans, Jan. 1984.Google Scholar
  5. [5]
    F. Capy: ASSPEGIQUE: un environment d'exceptions. Une sémantique opérationnelle des E,R-algèbres, formalisme prenant en compte les exceptions., Thèse de 3ème cycle, Université de Paris-Sud, Orsay, Déc. 87.Google Scholar
  6. [6]
    J. Earley: An Efficient Context-Free Parsing Algorithm, C.A.C.M., Vol. 13, N. 2, Feb. 1970, pp. 94–102.Google Scholar
  7. [7]
    M.C. Gaudel: Towards Structured Algebraic Specifications, ESPRIT Technical Week, Bruxelles 1985, ESPRIT'85 Status Report, North-Holland, pp. 493–510.Google Scholar
  8. [8]
    S. Graham, M. Harrison & W. Ruzzo: An Improved Context-Free Recognizer, A.C.M.-T.O.P.L.A.S., Vol. 2, N. 3, Jul. 1980, pp. 415–462.Google Scholar
  9. [9]
    S.L. Peyton-Jones: Parsing Distfix Operators, Computing Practices, Vol. 29. N. 2, 1986, pp. 118–122.Google Scholar
  10. [10]
    M. Tomita: An Efficient Context-Free Parsing Algorithm for Natural Languages, Proc. 9th I.J.C.A.I., Los Angeles, Aug. 1985, pp. 756–764.Google Scholar
  11. [11]
    F. Voisin: CIGALE: a Tool for Interactive Grammar Construction and Expression Parsing, Science of Computer Programming, Vol. 7, N. 1, 1986, pp. 61–86.Google Scholar
  12. [12]
    F. Voisin: Une version ascendante de l'algorithme d'Earley, L.R.I. Research Report, to appear, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Frédéric Voisin
    • 1
  1. 1.Laboratoire de Recherche en InformatiqueUniversité Paris-SudOrsay CedexFrance

Personalised recommendations