Formal Methods in Programming and Their Applications

Volume 735 of the series Lecture Notes in Computer Science pp 423-433


Parsing in Isbes

  • Eerke A. BoitenAffiliated withDepartment of Mathematics and Computing Science, Eindhoven University of Technology

* Final gross prices may vary according to local VAT.

Get Access


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.


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