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.
Supported by a CAPES PhD grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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.
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.
J. Dassow, G. Păun and A. Salomaa. Grammars with controlled derivations. Handbook of Formal Languages. Vol 2. Srpinger-Verlag. 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bravo, C., Neto, J.J. (2003). Building Context-Sensitive Parsers from CF Grammars with Regular Control Language. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-45089-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40561-0
Online ISBN: 978-3-540-45089-4
eBook Packages: Springer Book Archive