This paper discusses a sequence of deductive parsers, called PAD1 - PAD5, that utilize an a x i o m a t i z a t i o n of the p r i n c i p l e s a n d parameters of GB theory, including a restricted transformational component (Move-a). PAD2 uses an inference control strategy based on the "freeze" predicate of Prolog-II, while PAD3 - 5 utilize the Unfold-Fold transformation to transform the original axiomatization into a form that functions as a recursive descent Prolog parser for the fragment. INTRODUCTION In this paper I.
