České vysoké učení technické v Praze Fakulta dopravní Translation regular grammars translation regular grammar G = ( N,T,D,P, S ) where : N - a set of non-terminal symbols T - a set of terminal (input) symbols D - a set of output symbols P – a set of rules S - start symbol S  N
{}