Difference between revisions of "JFlap"
| Line 16: | Line 16: | ||
<br><br> | <br><br> | ||
| − | '''Contribution by:''' [mailto:migutass@hotmail.com| João Miguel Pires] | + | <div align="right">'''Contribution by:''' [mailto:migutass@hotmail.com| João Miguel Pires]</div> |
[[Category:Tools & Utilities]] | [[Category:Tools & Utilities]] | ||
[[Category:Tools]] | [[Category:Tools]] | ||
[[Category:Pedagogical Tools]] | [[Category:Pedagogical Tools]] | ||
Revision as of 03:42, 28 November 2012
JFLAP is software for experimenting with formal languages topics including nondeterministic finite automata, nondeterministic pushdown automata, multi-tape Turing machines, several types of grammars, parsing, and L-systems. In addition to constructing and testing examples for these, JFLAP allows one to experiment with construction proofs from one form to another, such as converting an NFA to a DFA to a minimal state DFA to a regular expression or regular grammar.
Contents |
Original Page
Examples
Files to run with Lavanda (simplified) sample:
- Lavanda.jff
- Phrase.jff (sample of a phrase to input to the grammar built in previous phase).
Other material
A movie to show the build up of the parsing tree to Lavanda sample (Lavanda.mov) and the recognition of a phrase to this DSL (automata.mov).
Report
A small report relating some details of implementation of Lavanda in JFlap and features of this tool ().
