Skip to main content

Parsing in ISBES

Boiten, Eerke Albert (1993) Parsing in ISBES. In: Bjorner, D. and Broy, M. and Pottosin, I.V., eds. Formal Methods in Programming and Their Applications International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 423-433. ISBN 978-3-540-57316-6. E-ISBN 978-3-540-48056-3. (doi:10.1007/BFb0039724) (KAR id:21112)

PDF Author's Accepted Manuscript
Language: English
Click to download this file (310kB) Preview
[thumbnail of parsLNCS.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL:


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 /pubs/1991/161/, 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.

Item Type: Book section
DOI/Identification number: 10.1007/BFb0039724
Uncontrolled keywords: bags, substructures, transformational programming, parsing, Cocke-Kasami-Younger
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Eerke Boiten
Date Deposited: 11 Aug 2009 17:21 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.