Abstract
To define a context free grammar we should:
-
fix a finite set A, called an alphabet, whose elements are called symbols or letters; finite sequences of symbols are called strings or words;
-
divide all symbols in A into two classes: terminal symbols and nonterminal symbols;
-
choose a nonterminal symbol called the initial symbol, or axiom;
-
fix a finite set of productions, or production rules; each production has the form K → X, where K is some nonterminal and X is a string that may contain both terminal and nonterminal symbols.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Shen, A. (1997). Context-free grammars. In: Algorithms and Programming. Modern Birkhäuser Classics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-4761-2_13
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4761-2_13
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-4760-5
Online ISBN: 978-0-8176-4761-2
eBook Packages: Springer Book Archive