A project containing data structures for different kinds of automata (DFAs/NFAs), a simple custom language defining operations on them, as well as a fully functional and customizable GUI editor.
Includes high-level implemenation of DFAs and NFAs but supports easy extensions for other similar theoretical machines, such as PushDownAutomata or even Turing Machines. Automata are represented as a set of connected nodes (graphs), as in most diagrams showcasing them.
Includes a basic language defining operations to build, debug, execute and save automata to a file. The language is interpreted with a custom interpreter that can read and execute code either from the console, or from a file. The interpreter handles all syntax and execution errors, printing helpful error messages to the user and preventing the program from crashing at any point.
The interpreter comes with a preprocessor that extends the language to include if-statements, comments and name definitions in order to give the user more control over his program.
A windowed application whose main purpose is to enhance user experience while writing and executing code for the interpreter.
Features:
- A text area the user can use to write his program, as well as a console to print any output/error messages, distinguished by color.
- Syntax highlighting.
- Customization options including different look and feel options, output colors and text color/size/font/style.
- Standard user services including redo/undo commands, save options and hotkeys.
- Background real-time error checking.
- Help tabs providing information about the way the language works.
The application is multithreaded and can handle large workloads.
Special thanks to Rob Camick. The editor is implemented with the (now mostly defunct) Java swing library which leaves a lot to be desired in many usual GUI problems. Camick has openly provided tested, easy to understand classes that solve many of these problems, some of which are present in this project.