Abstract
A context-free grammar is a collection of context-free phrase structure rules. Each such rule names a constituent type and specifies a possible expansion thereof. The standard notation is:
where lhs names the constituent, and rhs1 through rhsn the expansion. Such rules are context-free rules because the expansion is unconditional — the environment of the constituent to be expanded is irrelevant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Gazdar, G. Phrase Structure Grammar. In Jacobson and Pullum (editor). The Nature of Syntactic Representations. Reidel, Dordrecht, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Context-Free Grammar. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive