René Leermakers

Also published as: Rene Leermakers


pdf bib
The Use of Bunch Notation in Parsing Theory
René Leermakers
Proceedings of the Third International Workshop on Parsing Technologies

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.


pdf bib
Non-deterministic Recursive Ascent Parsing
Rene Leermakers
Fifth Conference of the European Chapter of the Association for Computational Linguistics


pdf bib
How to cover a grammar
René Leermakers
27th Annual Meeting of the Association for Computational Linguistics