Building context-sensitive parsers from CF grammars with regular control language

Abstract

In this work we propose a method to derive Stack Automata [1] from context-free grammars with regular control languages [3]; by slightly restricting the operation of the machine we obtain a bottom-up parser which operates by reducing instances of the right-hand side of productions in a sentencial form to the corresponding left-hand side; since context-free grammars with regular control languages are Turing powerful and Stack Automata accept, at least, context-sensitive languages [2], the resulting devices are indeed context-sensitive parsers. © Springer-Verlag Berlin Heidelberg 2003.