Lecture Notes in Computer Science, 2001, Volume 2214/2001, 39-47, DOI: 10.1007/3-540-45526-4_4

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

Beatrix Braune, Stephan Diehl, Andreas Kerren and Reinhard Wilhelm

View Related Documents

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.

Fulltext Preview

Image of the first page of the fulltext document