FEATURES & OTHER NON-BUG CHANGES
Converting Turing machine to unrestricted grammar – the user can convert TM to grammar.
Special parser for the converted unrestricted grammar generated in the TM to grammar conversion. Improve the efficiency of parser, but still the grammar is generally too big to parse. See simple TM examples in the tutorial.
New page on JFLAP Tutorial – tutorial page for converting Turing machine to unrestricted grammar feature
Users can launch JFLAP without invoking JFLAP.java main file. Useful for developers who use JFLAP in their applications.
BUG Fixes
CYK Parser bug that caused exception is now gone.
Error caused when saving building blocks
Multiple Brute Force Parser error when entering non-terminal string is fixed.
Other minor bug fixes to make JFLAP more stable.
Note: We forgot to change the About graphic, so we replaced the jar file on June 13, 08 to include the About graphics.