Building Context-Sensitive Parsers from CF Grammars with Regular Control Language
In this work we propose a method to derive Stack Automata  from context-free grammars with regular control languages ; 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 , the resulting devices are indeed context-sensitive parsers.
KeywordsFormal Language Regular Expression Target Language Input String Applied Production
Unable to display preview. Download preview PDF.
- J. Dassow, G. Păun and A. Salomaa. Grammars with controlled derivations. Handbook of Formal Languages. Vol 2. Srpinger-Verlag. 1997.Google Scholar