A synthetic programming language , or , for example could be considered a special case of a tabula rasa, as it is designed to accept any of a possibly infinite set of source language programs, within a single programming language, and to output either a good parse of the program, or a good machine language translation of the program, either of which represents a success, or, alternately, a failure, and nothing else.