Abstract
This work is part of a larger framework where the goal is a high level language to write automaton based applications. The language lets the user specify the data structures to use and designate where the application must be optimized in space or in time. In a second step, we want the language to choose automatically which structure fits best to a given algorithm. This article deals with the foundation of this application, that is, an attempt to standardize the interfaces of a set of different C++ classes implementing an automaton container : ASTL (Automaton Standard Template Library)
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho, R. Sethi, J. D. Ullman. Compilers-Principles, Techniques and Tools. Addison-Wesley, 1986.
J. E. Hopcroft, J. D. Ullman. Introduction to automata, languages and computation. Addison-Wesley, 1979.
D. R. Muser, A. Stepanov. Generic Programming. Lecture Notes in Computer Science 358, Springer-Verlag, 1989.
P. J. Plauger. Publications on STL in C++ Users Journal, 1996-97.
Standard Template Library Reference. Rensselaer Polytechnic Institute, 1994.
A. Stepanov, M. Lee. The Standard Template Library. Hewlett-Packard laboratories, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Maout, V. (1998). Tools to implement automata, a first step: ASTL. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031384
Download citation
DOI: https://doi.org/10.1007/BFb0031384
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive