Parsing in Isbes

  • Eerke A. Boiten
Conference paper

DOI: 10.1007/BFb0039724

Part of the Lecture Notes in Computer Science book series (LNCS, volume 735)
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

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.

Keywords

transformational programming formal specification substructures bags parsing Cocke-Kasami-Younger 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Eerke A. Boiten
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands

Personalised recommendations