Orbits in different dispersive billiards systems, for example the three-disk system, are mapped into a topological well-ordered symbolic plane and it is showed that forbidden and allowed orbits are separated by a monotone pruning front. The pruning front can be approximated by a sequence of finite symbolic dynamics grammars.