Skip to main content
Book Chapter

Context-Free Languages and Pushdown Automata

  • Autebert J
  • Berstel J
  • Boasson L
Springer Berlin Heidelberg, (1997), 111-174
DOI: 10.1007/978-3-642-59136-5_3
N/ACitations
Citations of this article
31Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize grammatical properties of natural languages. They subsequently appeared to be well adapted to the formal description of the syntax of programming languages. This led to a considerable development of the theory.

Cite

CITATION STYLE

APA

Autebert, J.-M., Berstel, J., & Boasson, L. (1997). Context-Free Languages and Pushdown Automata. In Handbook of Formal Languages (pp. 111–174). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-59136-5_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free