There are several
efficient parsing techniques used for analysis of context-free languages. Nevertheless, context bindings must be
recognized and verified by some other (less formal) means, e.g. symbol tables,
semantic actions, attributed grammars, etc.
The paper presents a restricted variant of scattered context grammars and
a deterministic version of regulated pushdown automata. These formal means
together represent an efficient formal system for parsing of context languages.
Moreover, construction of a deterministic regulated pushdown automaton from the
restricted scattered context grammar is also possible.