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 |
|
Download this file (PDF/310kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/BFb0039724 |
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: | 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: | 05 Nov 2024 09:58 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21112 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):