Linear time parsers for classes of non context free languages

Deterministic parsers have been proposed for two-level control grammars. These parsers are efficient in both time and space and are simple extensions of the standard LL(1) and LR(1) parsers for deterministic context free languages. An important advantage of the parsers proposed here is that existing parser generator tools can be augmented to generate them from grammar specifications. Since there is a simple way of transforming to and from two-level control grammars and tree adjoining grammars (TAG), it appears that these techniques have potential use in a TAG parser.