JFLAP: An Interactive Formal Languages and Automata Package
JFLAP: An Interactive Formal Languages and Automata Package is a hands-on supplemental guide through formal languages and automata theory. JFLAP guides students interactively through many of the concepts in an automata theory course or the early topics in a compiler course, including the descriptions of algorithms JFLAP has implemented. Students can experiment with the concepts in the text and receive immediate feedback when applying these concepts with the accompanying software. The text describes each area of JFLAP and reinforces concepts with end-of-chapter exercises. In addition to JFLAP, this guide incorporates two other automata theory tools into JFLAP: JellRap and Pate.
What people are saying - Write a review
We haven't found any reviews in the usual places.
NFA to DFA to Minimal DFA
and SLR Parsing
Other Grammars in the Hierarchy
Appendix A LSystem Quick Reference
Appendix B JFLAP jff File Format
aabbb accepting configuration algorithm alphabet appear automata brute-force parser Chapter Click on Step column context-free grammar context-sensitive grammar corresponding create define derivation steps derivation string display element empty encoded enter equivalent example expression transition File input Convert final FIRST(A FOLLOW sets FOLLOW(A highlighted initial input string JFLAP Kleene star L-system label leaf node left side load the file lookahead loop transition menu item move multitape Nondeterminism nondeterministic Note NPDA number of a's original grammar parameter parse table parse the string parse tree parsing method polygon popped Pushdown Automaton pushed qi to q regular expression regular grammars remove rendering replaced represents rewriting rules right side right-linear grammar Section Select Input sentential form shown in Figure single stack subelement tape head tape symbol transition from qi Turing machine turtle commands unit-productions unrestricted grammar variable window X-production X-transitions