Skip Navigation

The Computer Journal 1975 18(2):150-156; doi:10.1093/comjnl/18.2.150
© 1975 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Housden, R. J. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On string concepts and their implementation

R. J. W. Housden *

School of Computing Studies, University of East Anglia, Norwich, UK

A model is described for string handling, distinguishing between fixed length vectors of characters and strings which vary in length under string operations. String processing facilities in PL/I and ALGOL 68-R are considered with particular reference to variability of length of segments of strings. Operators and procedures are defined in ALGOL 68-R for processing both fixed and variable length strings.

Received March 1974.

* School of Computing Studies, University of East Anglia, Norwich, NR4 7TJ


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.