This paper describes a novel method of compiling ordered tagging rules into a deterministic finite-state device. The device is composed of two deterministic machines: a left-to-right one and a right-to-left one, in a way similar to a bimachine. The actual compilation is based on algorithms for finite-state acceptors rather than transducers, which ensures the determinizability of the finite-state machines and the efficiency of compilation. The compiler has been used in a number of applications within a speech synthesis system.