Parsing in Isbes
- First Online:
- Cite this paper as:
- 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
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.