Susan H. Rodger
Anna O. Bilska
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.
- 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.Google Scholar
- 2.J. Barwise andJ. Etchemedy, Turing's World, Stanford: CSLI Publications, New York: Cambridge University Press, 1993.Google Scholar
- 3.S. Blythe, M. James, S. Rodger, LLparse and LRparse: Visual and Interactive Tools for Parsing, Twenty-fifth SIGCSE Technical Symposium on Computer Science Education, p. 208-212, 1994. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 5.P. Gloor, AACE - Algorithm Animation for Computer Science Education, IEEE Workshop on Visual Languages, p. 25-31, 1992.Google ScholarCross Ref
- 6.D. Hannay, Hypercard Automata Simulation: Finite State, Pushdown and Turing Machines, SIGCSE Bulletin, 24, 2, p. 55-58, June 1992. Google ScholarDigital Library
- 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.Google Scholar
- 8.S. Rodger, An Interactive Lecture Approach to Teaching Computer Science, Proceedings of the Twenty-sixth SIGCSE Technical Symposium on Computer Science Education, p.278-282, 1995. Google ScholarDigital Library
- 9.S. Rodger, Integrating Hands-On Work into the Formal Languages Course via Tools and Programming, First International Workshop on Implementing Automata, London, Ontario, 1996, (to appear). Google ScholarDigital Library
- 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). Google ScholarDigital Library
- 11.J. Stasko, Tango: A Framework and System for Algorithm Animation, IEEE Computer, p.27-39, September 1990. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- A collection of tools for making automata theory and formal languages come alive
Recommendations
A collection of tools for making automata theory and formal languages come alive
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&...
Learning automata and formal languages interactively with JFLAP
ITICSE '06: Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Comments