Abstract
A context-free grammar can be interpreted formally in a number of ways. This chapter prepares the ground for discussing such interpretations. It gives a variant of set notation, called bunch notation. There are two major differences between sets and bunches. One difference is that a bunch with one element is identified with that one element (the singleton property). Moreover, a function or operator that is defined on some domain may be applied to a bunch of elements that belong to that domain. Such an application, say f(x), causes the function / to be applied to each separate element of the bunch x, after which the results are combined in a bunch, which is the result of f(x). This is called the distributivity property of bunches.
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
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Leermakers, R. (1993). Bunch Notation. In: The Functional Treatment of Parsing. The Springer International Series in Engineering and Computer Science, vol 242. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3186-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3186-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6397-2
Online ISBN: 978-1-4615-3186-9
eBook Packages: Springer Book Archive