Abstract
In trying to parse a string with a grammar, if one starts with the string and tries to fit it to the grammar, this is bottom-up or data-driven parsing. For instance with a context-free grammar <41>, one starts with a token in the string and works up from there on the basis of rules in the grammar which have that token on their right hand side, trying to reduce eventually to the initial symbol.
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
Reference
Winograd. T. Language as a cognitive process. Addison-Wesley, 1983.
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). Bottom-Up Parsing. 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_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive