This Thesis is brought to you for free and open access by the Thesis/Dissertation Collections at RIT Scholar Works. It has been accepted for inclusion in Theses by an authorized administrator of RIT Scholar Works. For more information, please contact rits

A tool for compiler testing is implemented. The tool is driven by a BNF grammar extended by a device called control flags to incorporate those parts of a language that are not controlled by context-free rules (for instance, use of declared names). The tool produces two sets of program strings such that each production in the grammar is used at least once. One set is produced by Purdom's algorithm. The other is produced by a new algorithm designed by the author which builds a tree and then produces a set of strings from it for compiler testing. The program strings produced from the new algorithm differ less in length than those from Purdom'