The Use of Bunch Notation in Parsing Theory

René Leermakers


Abstract
Much of mathematics, and therefore much of computer science, is built on the notion of sets. In this paper it is argued that in parsing theory it is sometimes convenient to replace sets by a related notion, bunches. The replacement is not so much a matter of principle, but helps to create a more concise theory. Advantages of the bunch concept are illustrated by using it in descriptions of a formal semantics for context-free grammars and of functional parsing algorithms.
Anthology ID:
1993.iwpt-1.13
Volume:
Proceedings of the Third International Workshop on Parsing Technologies
Month:
August 10-13
Year:
1993
Address:
Tilburg, Netherlands and Durbuy, Belgium
Editors:
Harry Bunt, Robert Berwick, Ken Church, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Makoto Nagao, Anton Nijholt, Mark Steedman, Henry Thompson, Masaru Tomita, K. Vijay-Shanker, Yorick Wilks, Kent Wittenburg
Venue:
IWPT
SIG:
SIGPARSE
Publisher:
Association for Computational Linguistics
Note:
Pages:
135–144
Language:
URL:
https://aclanthology.org/1993.iwpt-1.13
DOI:
Bibkey:
Cite (ACL):
René Leermakers. 1993. The Use of Bunch Notation in Parsing Theory. In Proceedings of the Third International Workshop on Parsing Technologies, pages 135–144, Tilburg, Netherlands and Durbuy, Belgium. Association for Computational Linguistics.
Cite (Informal):
The Use of Bunch Notation in Parsing Theory (Leermakers, IWPT 1993)
Copy Citation:
PDF:
https://aclanthology.org/1993.iwpt-1.13.pdf