The design and implementation of high level programming language features for pattern matching in real-time.
| dc.contributor.advisor | Griswold, Ralph E. | en_US |
| dc.contributor.author | Nilsen, Kelvin Don. | |
| dc.creator | Nilsen, Kelvin Don. | en_US |
| dc.date.accessioned | 2011-10-31T17:08:57Z | |
| dc.date.available | 2011-10-31T17:08:57Z | |
| dc.date.issued | 1988 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/184461 | |
| dc.description.abstract | High-level programming language features simplify software development by eliminating many low-level programming concerns and by providing programmers with useful abstractions to simplify description and analysis of their programs. This dissertation discusses briefly some of the special needs of structural pattern-matching programs that must execute in real time and suggests language features to support these needs. These language features are implemented in an experimental version of the Icon programming language and examples of how these language features can be used are presented. This dissertation also presents and discusses the implementation of these language mechanisms, including the implementation of a new algorithm for garbage collecting linked data structures and strings in real time. One of the new language features is a stream data type, which allows programmers to perform pattern matching directly on sequences of data values produced by external sources, without requiring explicit read operations to bring the data into memory before analyzing it. Other new language features provide the ability to create and manipulate concurrent Icon processes, between which the stream data type serves as the principal mechanism for interprocess communication. Stream and concurrent process manipulation mechanisms integrate naturally with each other and with the existing mechanisms of the Icon programming language. Sequential Icon programs are, for the most part, unaffected by the new language capabilities. | |
| dc.language.iso | en | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Icon (Computer program language) | en_US |
| dc.subject | Real-time data processing. | en_US |
| dc.title | The design and implementation of high level programming language features for pattern matching in real-time. | en_US |
| dc.type | text | en_US |
| dc.type | Dissertation-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 701330648 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | doctoral | en_US |
| dc.contributor.committeemember | Debray, Saumya | en_US |
| dc.contributor.committeemember | Downey, Peter J. | en_US |
| dc.identifier.proquest | 8822431 | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.name | Ph.D. | en_US |
| dc.description.note | This item was digitized from a paper original and/or a microfilm copy. If you need higher-resolution images for any content in this item, please contact us at repository@u.library.arizona.edu. | |
| dc.description.admin-note | Original file replaced with corrected file July 2023. | |
| refterms.dateFOA | 2018-08-22T18:41:45Z | |
| html.description.abstract | High-level programming language features simplify software development by eliminating many low-level programming concerns and by providing programmers with useful abstractions to simplify description and analysis of their programs. This dissertation discusses briefly some of the special needs of structural pattern-matching programs that must execute in real time and suggests language features to support these needs. These language features are implemented in an experimental version of the Icon programming language and examples of how these language features can be used are presented. This dissertation also presents and discusses the implementation of these language mechanisms, including the implementation of a new algorithm for garbage collecting linked data structures and strings in real time. One of the new language features is a stream data type, which allows programmers to perform pattern matching directly on sequences of data values produced by external sources, without requiring explicit read operations to bring the data into memory before analyzing it. Other new language features provide the ability to create and manipulate concurrent Icon processes, between which the stream data type serves as the principal mechanism for interprocess communication. Stream and concurrent process manipulation mechanisms integrate naturally with each other and with the existing mechanisms of the Icon programming language. Sequential Icon programs are, for the most part, unaffected by the new language capabilities. |
