JFLAP: An Interactive Formal Languages and Automata PackageJFLAP: 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. |
Common terms and phrases
A-productions aabbb algorithm appears automata automaton axiom brute-force parser Click on Step column configuration context-free grammar context-sensitive grammar Convert Help Editor corresponding create defined derivation steps derivation string element empty encoded enter equivalent example Export expression transition File Input Convert final finite FIRST(A FOLLOW sets FOLLOW(B initial Input Convert Help input string JFLAP Kleene star L-system label leaf node left side load the file lookahead move multitape nondeterministic Note NPDA number of a's original grammar parameter parse table parse the string parse tree parsing method polygon popped Pushdown Automaton pushed q₁ regular expression regular grammars remove rendering replaced represents rewriting rules right side right-linear grammar Section Select Input sentential form shown in Figure simulator single stack subelement T₁ tape head tape symbol Turing machine turtle commands unit-productions unrestricted grammar variable window X-transitions