It is shown that the class of left-to-right regular languages coincides withthe class of languages that are acceptedby monotone deterministic RL-automata,in this way establishing a close correspondence between a classicalparsing algorithm and a certain restricted type of analysis by reduction.