A collection of tools for making automata theory and formal languages come alive

ABSTRACT

We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating and simulating finite automata, pushdown automata and Turing machines; Pâté for parsing restricted and unrestricted grammars and transforming context-free grammars to Chomsky Normal Form; and PumpLemma for proving specific languages are not regular. Enhancements to previous tools LLparse and LRparse, instructional tools for parsing LL(1) and LR(1) grammars, include parsing LL(2) grammars, displaying parse trees, and parsing any context-free grammar with conflict resolution.

REFERENCES

• 1: A. Badre, C. Lewis, and J. Stasko, Empirically Evaluating the Use of Animations to Teach Algorithms, Proceedings of the 1994 IEEE Symposium on Visual Languages, p. 48-54, 1994.
• 2: J. Barwise andJ. Etchemedy, Turing's World, Stanford: CSLI Publications, New York: Cambridge University Press, 1993.
• 3: Stephen A. Blythe , Michael C. James , Susan H. Rodger, LLparse and LRparse: visual and interactive tools for parsing, Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, p.208-212, March 10-12, 1994, Phoenix, Arizona, United States
• 4: M. Brown, ZEUS: A System for algorithm animation and multi-view editing. Proceedings of the IEEE 1991 Workshop on Visual Languages, p. 4-9, Kobe, Japan, Oct. 1991.
• 5: P. Gloor, AACE - Algorithm Animation for Computer Science Education, IEEE Workshop on Visual Languages, p. 25-31, 1992.
• 6: David G. Hannay, Hypercard automata simulation: finite-state, pushdown and Turing machines, ACM SIGCSE Bulletin, v.24 n.2, p.55-58, June 1992 [doi>10.1145/130962.130971]
• 7: M. LoSacco, and S. Rodger, FLAP: A Tool for Drawing and Simulating Automata, ED-MEDIA 93, World Conference on Educational Multimedia and Hypermedia, p. 310-317, June 1993.
• 8: Susan H. Rodger, An interactive lecture approach to teaching computer science, Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, p.278-282, March 02-04, 1995, Nashville, Tennessee, United States
• 9: Susan H. Rodger, Integrating Hands-on Work into the Formal Languages Course via Tools and Programming, Revised Papers from the First International Workshop on Implementing Automata, p.132-148, August 29-31, 1996
• 10: M. Proeopiue, O. Procopiue, and S. Rodger, "Visualization and Interaction in the Computer Science Forreal Languages Course with JFLAP" 1996 Frontiers in Education Conference, Salt Lake City, Utah, 1996, (to appear).
• 11: John T. Stasko, Tango: A Framework and System for Algorithm Animation, Computer, v.23 n.9, p.27-39, September 1990 [doi>10.1109/2.58216]
• 12: K. Sutner, Implementing Finite State Machines, in Computational Support for Discrete Mathematics, D1- MACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15, N. Dean and G. E. Shannon (ed.), American Mathematical Society, p. 347-363, 1992.

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Curriculum

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Automata (e.g., finite, push-down, resource-bounded)
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES

General Terms:
Design, Human Factors, Languages, Management, Performance, Theory