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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho and J.D. Ullman. The Theory of Parsing, Translation and Compiling, Vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, New Jersey, 1972.
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.
E.A. Boiten. Can bag comprehension be used at all? Technical Report 91-21, Dept. of Informatics, K.U. Nijmegen, September 1991.
E.A. Boiten. Intersections of bags and sets of extended substructures — a class of problems. In [Möl91], pages 33–48.
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.
B. Möller, editor. Proceedings of the IFIP TC2 Working Conference on Constructing Programs from Specifications North-Holland Publishing Company, Amsterdam, 1991.
H. Partsch. Specification and Transformation of Programs — a Formal Approach to Software Development. Springer-Verlag, Berlin, 1990.
H.A. Partsch and E.A. Boiten. A note on similarity of specifications and reusability of transformational developments. In [Möl91], pages 71–89.
D.R. Smith and M.R. Lowry. Algorithm theories and design tactics. Science of Computer Programming, 14:305–321, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boiten, E.A. (1993). Parsing in Isbes. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Formal Methods in Programming and Their Applications. Lecture Notes in Computer Science, vol 735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039724
Download citation
DOI: https://doi.org/10.1007/BFb0039724
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57316-6
Online ISBN: 978-3-540-48056-3
eBook Packages: Springer Book Archive