Construction of recognition devices for regular languages from their Backus Normal Form definition

AbstractA description is given of a program that with certain restrictions on the defining grammar transforms a description of a regular language given by a set of production-rules written in Backus Normal Form to a description of a recognizing algorithm based on a finite number of internal states.