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.
KeywordsParse Tree Parse Table Input Symbol Input Sentence State Vertex
Unable to display preview. Download preview PDF.
- A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation, and Compiling, Volume 1, Prentice Hall, Englewood Cliffs, NJ, 1972.Google Scholar
- J. Earley, An Efficient Context-free Parsing Algorithm, Ph.D. Thesis, Computer Science Department, Carnegie-Mellon University, Pittsburg, PA, 1968.Google Scholar
- 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
- 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
- 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
- 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
- M. Tomita, Efficient Parsing for Natural Language, Kluwer Academic Publishers, Boston, MA, 1986.Google Scholar
- M. Tomita, An efficient augmented-context-free parsing algorithm, Computational Linguistics, vol. 13, no. 1-2, January 1987, pp. 31–46.Google Scholar