Parsing in ISBES

Boiten, Eerke (1993) Parsing in ISBES. In: UNSPECIFIED. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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 /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 (UNSPECIFIED)
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 > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 11 Aug 2009 17:21
Last Modified: 13 May 2014 08:35
Resource URI: http://kar.kent.ac.uk/id/eprint/21112 (The current URI for this page, for reference purposes)
  • Depositors only (login required):