Advertisement

Animation of the Generation and Computation of Finite Automata for Learning Software

  • Beatrix Braune
  • Stephan Diehl
  • Andreas Kerren
  • Reinhard Wilhelm
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2214)

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.

Keywords

Regular Expression Regular Language Finite Automaton Authoring System Abstract Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Alteneder. Visualize with the Help of Computers: Computergraphics and Computer Animations. Siemens, VCH (in German), 1993.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    M. H. Brown. Algorithm Animation. MIT Press, 1987.Google Scholar
  4. 4.
    M. H. Brown. Zeus: A System for Algorithm Animation and Multi-View Editing. SRC Research Report 75, DEC, 1992.Google Scholar
  5. 5.
    M. H. Brown. The 1992 SRC Algorithm Animation Festival. In IEEE Symp. on Visual Languages, pp. 116–123, 1993.Google Scholar
  6. 6.
    M. H. Brown, R. Sedgewick. A System for Algorithm Animation. In SIGGRAPH’ 84, Computer Graphics 18(3), pp. 177–186, 1984.CrossRefGoogle Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    A. Hausner, D. P. Dobkin. Making Geometry Visible: an Introduction to the Animation of Geometric Algorithms. Computer Science Department, Princeton University, 1996.Google Scholar
  10. 10.
    A. Kerren. Animation of the Semantical Analysis. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1997.Google Scholar
  11. 11.
    A. Kerren. Animation of the Semantical Analysis. In Proceedings of “8. GIFachtagung Informatikund Schule INFOS99” (in German), pp. 108–120, Informatikak tuell, Springer, 1999.Google Scholar
  12. 12.
    G. Kohlmann. Visualization of the abstract P-Machine. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1995.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    I. Lemke, G. Sander. Visualization of Compiler Graphs. User Documentation, 1994.Google Scholar
  15. 15.
    G. Sander. Visualization of Compiler Graphs. Technical Report, University of Saarland, Saarbrucken (Germany), 1995.Google Scholar
  16. 16.
    G. Sander. Visualization Techniques for Compiler Construction. Dissertation (in German), University of Saarland, Saarbrucken (Germany), 1996.Google Scholar
  17. 17.
    B. Shneiderman. Designing the User Interface: Strategies for Effective Human-Computer Interaction. 3rd Edition, Addison-Wesley, 1997.Google Scholar
  18. 18.
    J. T. Stasko. A Framework and System for Algorithm Animation. Computer, 18(2), pp. 258–264, 1990.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    J. T. Stasko. Using Student-Built Algorithm Animations as Learning Aids. Technical Report GIT-GVU-96-19, Georgia Institute of Technology, Atlanta, 1996.Google Scholar
  21. 21.
    B. Steiner. Visualization of the abstract Machine MaMa. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1992.Google Scholar
  22. 22.
    S. Wirtz. Visualization of the abstract Machine WiM. Master’s Thesis (in German), University of Saarland, Saarbrucken (Germany), 1995.Google Scholar
  23. 23.
    R. Wilhelm, D. Maurer. Compiler Design: Theory, Construction, Generation. Addison-Wesley, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Beatrix Braune
    • 1
  • Stephan Diehl
    • 1
  • Andreas Kerren
    • 1
  • Reinhard Wilhelm
    • 1
  1. 1.University of SaarlandPO Box 15 11 50SaarbrückenGermany

Personalised recommendations