Abstract
The evaluation of expressions plays an important part in the compilers for programming languages. An expression may be represented by an ordered binary tree provided that it consists of brackets, binary operators, and operands; the operators correspond to the interior nodes and the operands to the leaves. For example, the arithmetical expression E = x 1/((x 2 − x 3) ↑ ((x 4 + x 5) * x 6)) corresponds to the binary tree (syntax tree) drawn in Figure 23.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Kemp, R. (1984). Applications. In: Fundamentals of the Average Case Analysis of Particular Algorithms. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-12191-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-663-12191-6_5
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-519-02100-1
Online ISBN: 978-3-663-12191-6
eBook Packages: Springer Book Archive