A SERIES OF SUBROUTINES (READRULE, ANNOTATE, CHOOSE, STORERULE, ADD-ONE AND SUB-ONE, DOMINATE, SUBTREE, TERMINAL, AND EQUAL) WRITTEN UP IN THE "COMIT" PROGRAMING LANGUAGE TO PROVIDE A CONVENIENT WAY FOR LINGUISTS TO TEST ANY SET OF GRAMMAR RULES AND TO GENERATE SENTENCES, ARE GIVEN WITH EXPLANATIONS FOR EACH. THIS IS FOLLOWED BY COMPLETE…

REPORTED IN THIS DOCUMENT IS AN EXPERIMENT TO DETERMINE THE DEGREE OF DIFFICULTY IN LEARNING AND USING "ENGLISH GRAMMAR II," A TRANSFORMATIONALLY GENERATED SUBSET OF ENGLISH (SEE AL 001 306). THE AUTHOR PRESENTS A GENERAL, NON-TECHNICAL EXPLANATION OF THE PRINCIPLES OF TRANSFORMATIONAL GRAMMAR AND A DESCRIPTION OF THE EXPERIMENT IN LEARNING TO USE…

Student projects that involve writing generative grammars in the computer language, "LOGO," are described in this paper, which presents a grammar-running control structure that allows students to modify and improve the grammar interpreter itself while learning how a simple kind of computer parser works. Included are procedures for…

This discussion of the use of computer programming in syntactic analysis covers three major points: (1) a review of basic notions in automatic grammars; (2) a description of the grammar used in a pilot project which analysed the linguistic content of methods of teaching foreign languages; and (3) proposals on the application of the same techniques…