The Forlan Project consists of a toolset (called Forlan) for experimenting with formal languages, a graphical editor for Forlan automata and trees called JForlan, and a draft textbook entitled Formal Language Theory: Integrating Experimentation and Proof. The toolset, graphical editor and book are released under free software/documentation licenses.
The Forlan toolset is a library on top of the Standard ML of New Jersey (SML/NJ) implementation of Standard ML (SML). It's used interactively, and users are able to extend Forlan by defining SML functions.
Forlan-Announce is a low-volume announcements mailing list for the Forlan Project.
Feedback concerning the Forlan Project is very welcome. Email: email@example.com.
The Forlan toolset has been developed together with an introductory textbook entitled Formal Language Theory: Integrating Experimentation and Proof. An attempt has been made to keep the conceptual and notational distance between the textbook and toolset as small as possible. The book treats most concepts and algorithms both theoretically, especially using proof, and through experimentation, using Forlan. In contrast to some books on formal language theory, the book emphasizes the concrete over the abstract, providing numerous, fully worked-out examples of how regular expressions, finite automata, grammars and programs (its substitute for Turing machines) can be designed and proved correct.
The textbook is still a work-in-progress, but a draft is available, and the LaTeX source for the draft is part of Forlan's distribution. It is released under the GNU Free Documentation License.
Very little knowledge of Standard ML is required in order to use Forlan in simple ways. But users who are more familiar with ML will be able to use Forlan in more sophisticated ways. The book assumes no previous knowledge of Standard ML. In order to understand and extend the implementation of Forlan, though, one must have a good working knowledge of Standard ML.
More information about SML can be obtained from Robert Harper's draft book Programming in Standard ML. Alternatively, one can read one of the following books:
People who are already familiar with Objective Caml (OCaml), can consult a comparison of Objective Caml and Standard ML.
Before installing Forlan, one must first install the Standard ML of New Jersey (SML/NJ) compiler, which can be obtained from www.smlnj.org. Click on "Downloading SML/NJ Software for Unix or Windows", and then on "Working Versions". Install Version 110.65 or greater of the compiler. (The current "release" (110.0.7) is seriously out-of-date, and Forlan won't compile under it.)
The Standard ML Basis Library is included as part of the SML/NJ distribution and contains many useful functions.
The best way to run ML is as a sub-process of the Emacs text editor, using the SML mode for Emacs.
A manual for Version 4.5 of Forlan is available. The manual is also available as a compressed tarball, and as a zip archive. The root HTML file is index.html
Here are instructions for downloading and installing Forlan Version 4.5 on a machine running Linux, Mac OS X or Windows.
The instructions that follow assume that SML/NJ (version 110.65 or greater) has been installed in the directory/folder:
|Linux/Mac OS X||/usr/local/smlnj|
If you install SML/NJ somewhere else, you'll have to modify the instructions accordingly. But you'll also have to make appropriate edits to the script forlan (under Linux/Mac OS X) or forlan.bat (under Windows).
Transfer the compressed tarball forlan-min-src-4.5.tgz to a temporary directory. (This tarball contains the minimum source needed to compile Forlan. If you plan to make changes to Forlan, you should get the full source. See below.) Then, run the following commands, after changing directory to the temporary directory:
gunzip forlan-min-src-4.5.tgz tar xf forlan-min-src-4.5.tar cd forlan-min-src-4.5 ./build-heap-image
This will cause an SML/NJ heap image for Forlan to be written to the file forlan-heap.x86-linux (Linux), forlan-heap.ppc-darwin (Mac OS X PowerPC) or forlan-heap.x86-darwin (Mac OS X Intel).
Then move the bash shell script forlan to /usr/local/bin, and move the heap image to /usr/local/smlnj/bin/.heap.
Transfer the zip archive forlan-min-src-4.5.zip to a temporary directory (folder). (This zip archive contains the minimum source needed to compile Forlan. If you plan to make changes to Forlan, you should get the full source. See below.) Extract the directory forlan-min-src-4.5 from this archive.
Then, run the following commands, after changing directory to the temporary directory:
cd forlan-min-src-4.5 sml Control.trackExn := false; CM.make "forlan.cm"; open TopLevel; Export.export();
This will cause an SML/NJ heap image for Forlan to be written to the file forlan-heap.x86-win32.
Then move the shell script forlan.bat to the directory C:\Program Files\SMLNJ\bin, and move the heap image to the directory C:\Program Files\SMLNJ\bin\.heap.
Create a desktop and/or startup menu shortcut to the command
Set the working directory for the shortcut to the one where your personal SML and Forlan files will reside.
JForlan is a Java program for creating and editing Forlan automata and trees: finite automata, regular expression finite automata, parse trees, regular expression trees, and program trees. JForlan automatically maintains the connections between the components of automata and trees, as those components are repositioned using the mouse. And it handles the conversion of diagrams from and to Forlan's concrete syntax. JForlan can be invoked directly (as a standalone applications) or from Forlan.
Version 4.5 of the Forlan Project distribution is available as a compressed tarball. The distribution contains:
The Forlan toolset and JForlan are released under the GNU General Public License, and the textbook is released under the GNU Free Documentation License.
Alley Stoughton created the Forlan project, designed, implemented and documented its modules, and wrote the textbook.
Leonard Lee and Jessica Sherrill designed and implemented graphical editors for Forlan finite automata (JFA), and regular expression and parse trees (JTR), respectively. Their work was unified and enhanced (of particular note was the addition of support for program trees) by Srinivasa Aditya Uppu, resulting in an initial version of JForlan. Subsequently, Kenton Born carried out a major redevelopment of JForlan, resulting in JForlan Version 1.0. Further revisions, by Alley Stoughton, led to JForlan Versions 2.0 and 2.1.