Algorithms for transformation of arbitrary context free grammar into reduced non-circular grammar without empty rules are implemented. Implementation is organized as a preprocessor that takes arbitrary grammar as an input and produces its equivalent suitable for usage in compiler generators. Preprocessor can be used as a first step in many compiler generators, as well as in the various applications in formal language theory. Some transformation algorithms are restated and some important implementation issues are described.