Described in this paper is the implementation of Querido's French grammar ("Grammaire I, Description transformationelle d'un sous-ensemble du Francais," 1969) on the computer system for transformational grammar at the University of Michigan (Friedman 1969). The purpose was to demonstrate the ease of transcribing a relative formal grammar into the notation of the system. The original grammar aimed only at describing the phrase structure and transformations of a sub-set of French; it was necessary to build a lexicon containing some contextual features, redundancy rules and entries. Some phrase-structure rules and transformations seemed best represented as contextual features or redundancy rules. The grammar was modified accordingly, and bears little resemblance to the original one. This is not a criticism of the original grammar, which offered a starting point essential to this study. The method used exemplifies the tutorial value of the system for computational linguistics. Whenever a rule was modified, the repercussions on the whole grammar were tested immediately. This paper does not mention the modifications made but presents the final modified grammar and some of its shortcomings. (See ED 034 209 for Friedman's "A Computer System for Transformational Grammar.") (AMM)