Date: 09 Jun 2005

Parsing in Isbes

* Final gross prices may vary according to local VAT.

Get Access

Abstract

It is shown how parsing can be described as a problem in the class isbes, Intersections of Sets and Bags of Extended Substructures, defined in an earlier paper, by viewing parsing as a generalization of pattern matching in several ways. The resulting description is shown to be a good starting point for the transformational derivation of the Cocke-Kasami-Younger tabular parsing algorithm that follows. This derivation is carried out at the level of bag comprehensions.

This research has been carried out at the University of Nijmegen, Department of Computing Science, sponsored by the Netherlands Organization for Scientific Research (NWO), under grant NF 63/62-518 (the STOP — Specification and Transformation Of Programs — project).