Abstract
The iterator concept is becoming the fundamental abstraction of reusable software and the key to modularity and clean code especially in object-oriented languages like C++ and Java. They serve as accessors to a sequence hiding the implementation details from the algorithm and their encapsulation power allows true generic programming. The Standard Template Library defines clearly their behavior on simple sequences like linked lists or vectors. In this paper, we define the concept of cursor which can be seen as a generalization of the iterator concept to more complex data structures than sequences, in this case acyclic automata. We show how elegant and efficient they can be on applications written in C++ and based on the Automaton Standard Template Library.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A.V. Aho, R. Sethi, J.D. Ullman. Compilers-Principles, Techniques and Tools. Addison-Wesley, 1986, pp 157–165.
D. Revuz. Dictionnaires et Lexiques-Méthodes et Algorithmes. PhD. Thesis, universityé Paris VII, 1992, pp. 66–70.
J.E. Hopcroft, J.D. Ullman. Introduction to automata, languages and computation. Addison-Wesley, 1979.
D.R. Musser, A. Stepanov. Generic Programming. Lecture Notes in Computer Science 358, Springer-Verlag, 1989.
Standard Template Library Programmer’s Guide Silicon Graphics Computer Systems, http://www.sgi.com/Technology/STL/, 1999
A. Stepanov, M. Lee. The Standard Template Library. Hewlett-Packard laboratories, 1995.
Vincent Le Maout. Tools to Implement Automata, a first step: ASTL. Lecture Note in Computer Science 1436, Springer-Verlag, 1998, pp 104–108.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Maout, V. (2001). Cursors. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_16
Download citation
DOI: https://doi.org/10.1007/3-540-44674-5_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42491-8
Online ISBN: 978-3-540-44674-3
eBook Packages: Springer Book Archive