Advertisement

GLR Parsing for ε-Grammers

  • Rahman Nozohoor-Farshi

Abstract

This chapter develops a modified version of Tomita’s algorithm for parsing arbitrary context-free grammars with e-productions. It also describes the parsing of cyclic grammars within the frame of this algorithm.

Keywords

Parse Tree Parse Table Input Symbol Input Sentence State Vertex 
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.V. Aho and J.D. Ullman, The Theory of Parsing, Translation, and Compiling, Volume 1, Prentice Hall, Englewood Cliffs, NJ, 1972.Google Scholar
  2. [2]
    J. Earley, An Efficient Context-free Parsing Algorithm, Ph.D. Thesis, Computer Science Department, Carnegie-Mellon University, Pittsburg, PA, 1968.Google Scholar
  3. [3]
    J. Earley, An efficient context-free parsing algorithm, CACM, vol. 13, no. 2, February 1970, pp. 94–102.MATHGoogle Scholar
  4. [4]
    S.C. Johnson, YACC: Yet Another Compiler-Compiler, Technical Report 32, Bell Laboratories, Murray Hill, NJ, 1975. Also reproduced in Unix Programmer’s Manual.Google Scholar
  5. [5]
    M.P. Marcus, A Theory of Syntactic Recognition for Natural Language, MIT Press, Cambridge, MA, 1980.MATHGoogle Scholar
  6. [6]
    R. Nozohoor-Farshi, Handling of ill-designed grammars in Tomita’s parsing algorithm, Proceedings of the International Workshop on Parsing Technologies, Camegie Mellon University, Pittsburgh, PA, August 1989, pp. 182–192.Google Scholar
  7. [7]
    R. Nozohoor-Farshi, On formalizations of Marcus’ parser, COLING’ 86, Proceedings of the 11th International Conference on Computational Linguistics, University of Bonn, West Germany, August 1986, pp. 533–535.Google Scholar
  8. [8]
    R. Nozohoor-Farshi, LRRL(k) Grammars: A Left to Right Parsing Technique with Reduced Lookaheads, Ph.D. Thesis, Department of Computing Science, University of Alberta, Edmonton, Canada, 1986.Google Scholar
  9. [9]
    M. Tomita, Efficient Parsing for Natural Language, Kluwer Academic Publishers, Boston, MA, 1986.Google Scholar
  10. [10]
    M. Tomita, An efficient augmented-context-free parsing algorithm, Computational Linguistics, vol. 13, no. 1-2, January 1987, pp. 31–46.Google Scholar

Copyright information

© Springer Science+Business Media New York 1991

Authors and Affiliations

  • Rahman Nozohoor-Farshi

There are no affiliations available

Personalised recommendations