Fortran implementation of the Kay context-free parser

ABSTRACT

A parsing program for context-free grammars based on an algorithm due to Martin Kay has been combined with a phrase-structure grammar preprocessor. The result is an efficient context-free parsing package. Implementation is in FORTRAN G under MTS.The paper contains first a user's guide to the programs. Then the parsing strategy as well as the functions of the major subroutines are described.

REFERENCES

• 1: Martin Kay, "A General Procedure for Rewriting Strings", presented at the summer meeting of AMTCL, Bloomington, 1964.
• 2: Alan C. Tucker, <u>The Tucker Parser</u>, Computer Science Department, Stanford University, April 1967.
• 3: Joyce Friedman , Thomas H. Bredt , Robert W. Doran , Theodore S. Martner , Bary W. Pollack, Programmers manual for a computer system for transformational grammar, Stanford University, Stanford, CA, 1968
• 4: Robert W. Doran, 360 O.S. FORTRAN IV free field input/output subroutine package, Stanford University, Stanford, CA, 1967
• 5: J. Friedman, B. C. Hall, and A. M. Zwicky, <u>The Junior Grammar</u>, Working Paper W-7287/SO10, The MITRE Corporation, 1965.
• 6: J. Friedman, T. H. Bredt, R. W. Doran, T. Martner, B. W. Pollack, <u>A Computer Model of Transformational Grammar</u>, American Elsevier (in press).