Abstract
In computer science methods to aid learning are very important, because abstract models are used frequently. For this conventional teaching methods do not suffice. We have developed a learning software, that helps the learner to better understand principles of compiler construction, in particular lexical analysis. The software offers on the one hand an interactive introduction to the problems of lexical analysis, in which the most important definitions and algorithms are presented in graphically appealing form. Animations show how finite automata are created from regular expressions, as well as, how finite automata work. We discuss principles used throughout the design of the software and give some preliminary results of evaluations of the software and discuss related work.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Alteneder. Visualize with the Help of Computers: Computergraphics and Computer Animations. Siemens, VCH (in German), 1993.
M. H. Brown, M. A. Najork. Collaborative Active Textbooks: A Web-based Algorithm Animation System for an Electronic Classroom. SRC Research Report 142, DEC, 1996.
M. H. Brown. Algorithm Animation. MIT Press, 1987.
M. H. Brown. Zeus: A System for Algorithm Animation and Multi-View Editing. SRC Research Report 75, DEC, 1992.
M. H. Brown. The 1992 SRC Algorithm Animation Festival. In IEEE Symp. on Visual Languages, pp. 116–123, 1993.
M. H. Brown, R. Sedgewick. A System for Algorithm Animation. In SIGGRAPH’ 84, Computer Graphics 18(3), pp. 177–186, 1984.
S. Diehl, T. Kunze, A. Placzek. GANIMAM: Generation of Interactive Animations of Abstract Maschines. In Proceedings of “Smalltalkund Java in Industrie und Ausbildung STJA’97” (in German), pp. 185–190, Erfurt (Germany), 1997.
S. Diehl, T. Kunze. Visualizing Principles of Abstract Machines by Generating Interactive Animations. In Proceedings of Workshop on Principles of Abstract Machines, Pisa (Italy), 1998.
A. Hausner, D. P. Dobkin. Making Geometry Visible: an Introduction to the Animation of Geometric Algorithms. Computer Science Department, Princeton University, 1996.
A. Kerren. Animation of the Semantical Analysis. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1997.
A. Kerren. Animation of the Semantical Analysis. In Proceedings of “8. GIFachtagung Informatikund Schule INFOS99” (in German), pp. 108–120, Informatikak tuell, Springer, 1999.
G. Kohlmann. Visualization of the abstract P-Machine. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1995.
I. Lemke. Development and Implementation of a Visualization Toolkit for Applications in Compiler Construction. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1994.
I. Lemke, G. Sander. Visualization of Compiler Graphs. User Documentation, 1994.
G. Sander. Visualization of Compiler Graphs. Technical Report, University of Saarland, Saarbrucken (Germany), 1995.
G. Sander. Visualization Techniques for Compiler Construction. Dissertation (in German), University of Saarland, Saarbrucken (Germany), 1996.
B. Shneiderman. Designing the User Interface: Strategies for Effective Human-Computer Interaction. 3rd Edition, Addison-Wesley, 1997.
J. T. Stasko. A Framework and System for Algorithm Animation. Computer, 18(2), pp. 258–264, 1990.
J. T. Stasko. The Path-Transition Paradigm: A Practical Methodology for Adding Animation to Program Interfaces. Journal of Visual Languages and Computing (1), pp. 213–236, 1990.
J. T. Stasko. Using Student-Built Algorithm Animations as Learning Aids. Technical Report GIT-GVU-96-19, Georgia Institute of Technology, Atlanta, 1996.
B. Steiner. Visualization of the abstract Machine MaMa. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1992.
S. Wirtz. Visualization of the abstract Machine WiM. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1995.
R. Wilhelm, D. Maurer. Compiler Design: Theory, Construction, Generation. Addison-Wesley, 1995.
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
Braune, B., Diehl, S., Kerren, A., Wilhelm, R. (2001). Animation of the Generation and Computation of Finite Automata for Learning Software. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-45526-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42812-1
Online ISBN: 978-3-540-45526-4
eBook Packages: Springer Book Archive