In the paper are studied possibilities of localisaton of syntactic errors of certain subclasses of deterministic context-free languages. The reduction automata are studied for this purpose.