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

1 March 1997

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGCSE Bulletin

Vol. 29 (1) , 15-19
https://doi.org/10.1145/268085.268089

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.

Keywords

This publication has 6 references indexed in Scilit:

AACE-algorithm animation for computer science education
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
Zeus: a system for algorithm animation and multi-view editing
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
An interactive lecture approach to teaching computer science
Published by Association for Computing Machinery (ACM) ,1995
LLparse and LRparse
Published by Association for Computing Machinery (ACM) ,1994
Hypercard automata simulation
ACM SIGCSE Bulletin, 1992
Tango: a framework and system for algorithm animation
Computer, 1990