Building Context-Sensitive Parsers from CF Grammars with Regular Control Language

  • César Bravo
  • João José Neto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)


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.


Formal Language Regular Expression Target Language Input String Applied Production 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Ginsburg, S. Greibach and M.A. Harrison. One-Way Stack Automata. Journal of the ACM Vol.14, No. 2, January, p.389–418, 1967.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    J. E. Hopcroft and J.D. Ullman. Sets Accepted by One-Way Stack Automata are Context Sensitive. Information and Control 13,2, August. p 113–133, 1968.CrossRefMathSciNetGoogle Scholar
  3. [3]
    J. Dassow, G. Păun and A. Salomaa. Grammars with controlled derivations. Handbook of Formal Languages. Vol 2. Srpinger-Verlag. 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • César Bravo
    • 1
  • João José Neto
    • 1
  1. 1.Laboratório de Linguagens e Tecnologias AdaptativasEscola Politécnica da Universidade de Sãao PauloSão Paulo, SPBrasil

Personalised recommendations