Parsing in ISBES

Boiten, Eerke Albert (1993) Parsing in ISBES. In: International Conference on Formal Methods in Programming and Their Applications, 1993, Novosibirsk. (Full text available)

PDF - Author's Accepted Manuscript
Download (196kB) Preview


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: Conference or workshop item (Paper)
Uncontrolled keywords: bags, substructures, transformational programming, parsing, Cocke-Kasami-Younger
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: E.A. Boiten
Date Deposited: 11 Aug 2009 17:21 UTC
Last Modified: 28 Jun 2017 01:05 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):


Downloads per month over past year