Parsing in Isbes
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.
Keywordstransformational programming formal specification substructures bags parsing Cocke-Kasami-Younger
Unable to display preview. Download preview PDF.
- [AU72]A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, New Jersey, 1972.Google Scholar
- [Bir87]R.S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design. NATO ASI Series Vol. F36, pages 5–42. Springer-Verlag, Berlin, 1987.Google Scholar
- [Boi91a]E.A. Boiten. Can bag comprehension be used at all? Technical Report 91-21, Dept. of Informatics, K.U. Nijmegen, September 1991.Google Scholar
- [Boi91b]E.A. Boiten. Intersections of bags and sets of extended substructures — a class of problems. In [Möl91], pages 33–48.Google Scholar
- [Mee89]L.G.L.T. Meertens. Lecture notes on the generic theory of binary structures. In STOP International Summer School on Constructive Algorithmics, Ameland. September 1989.Google Scholar
- [Möl91]B. Möller, editor. Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications North-Holland Publishing Company, Amsterdam, 1991.Google Scholar
- [Par90]H. Partsch. Specification and Transformation of Programs — a Formal Approach to Software Development. Springer-Verlag, Berlin, 1990.Google Scholar
- [PB91]H.A. Partsch and E.A. Boiten. A note on similarity of specifications and reusability of transformational developments. In [Möl91], pages 71–89.Google Scholar
- [SL90]D.R. Smith and M.R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14:305–321, 1990.Google Scholar