CIAA 2000: Implementation and Application of Automata pp 195-207 | Cite as
Cursors
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.
Keywords
Regular Expression Editing Distance Deterministic Finite Automaton Complex Data Structure Algorithm StagePreview
Unable to display preview. Download preview PDF.
References
- [ASU86]A.V. Aho, R. Sethi, J.D. Ullman. Compilers-Principles, Techniques and Tools. Addison-Wesley, 1986, pp 157–165.Google Scholar
- [DR92]D. Revuz. Dictionnaires et Lexiques-Méthodes et Algorithmes. PhD. Thesis, universityé Paris VII, 1992, pp. 66–70.Google Scholar
- [HU79]J.E. Hopcroft, J.D. Ullman. Introduction to automata, languages and computation. Addison-Wesley, 1979.Google Scholar
- [MS89]D.R. Musser, A. Stepanov. Generic Programming. Lecture Notes in Computer Science 358, Springer-Verlag, 1989.Google Scholar
- [SGI99]Standard Template Library Programmer’s Guide Silicon Graphics Computer Systems, http://www.sgi.com/Technology/STL/, 1999
- [SL95]A. Stepanov, M. Lee. The Standard Template Library. Hewlett-Packard laboratories, 1995.Google Scholar
- [VLM98]Vincent Le Maout. Tools to Implement Automata, a first step: ASTL. Lecture Note in Computer Science 1436, Springer-Verlag, 1998, pp 104–108.Google Scholar