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ˆat´e 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.

• Type: Conference
• Year: 1997
• Where: SIGCSE
• Authors: Susan H. Rodger, Anna O. Bilska, Kenneth H. Leider, Cecilia Magdalena Procopiuc, Octavian Procopiuc, Jason R. Salemme, Edwin Tsang
• Keywords: Context-free Grammar, Education, Parsing, SIGCSE 1997, Unrestricted Grammars