ijaguar's home page

What is the iJaguar?
Where do I get iJaguar?
System requirements
Compiling the sources & running
Running the binary distribution
Using the Jaguar
Author
News
Snapshoots

What is the iJaguar?

Jaguar is a Free Software tool written in Java (tm) for people in the Computer Theory area. Jaguar provides an infrastructure of libraries, engines and graphical applications that support most of the models and algorithms reviewed in a regular undergraduate computer theory (automata and formal languages) course. All the models of abstract machines covered by Jaguar have: (1) an engine that reads an input string and answer whether the string is accepted or not, (2) a GUI that provides a graphical representation, (3) a set of controls that allows interactive manipulation of the machine and the input strings. The abstract machines covered are:

DFA -- deterministic finite automaton
NFA -- no deterministic finite automaton
PDA -- pushdown automaton (or SFA stack finite automaton)
Turing -- Turin machine

Jaguar also includes an implementation of grammars. All grammars share a common GUI, and there are three specializations:

Type 3 grammar. This type of grammars receive an input string an and, if this string is generated by the grammar, then the GUI shows the derivation tree for that particular input.
Type 2 grammar, this type of grammars are used to work with well defined standardizer algorithms. Type 2 lazy grammars are also supported, only these are less restrictive on their production forms and also are used with the standardizer algorithms.

Jaguar provides the following algorithms (which use the above defined structures):

DFA minimization, minimize a given DFA into another equivalent, engine & GUI
NFA to DFA conversion, transformation of a given NFA into an equivalent DFA
Type 3 grammar into NFA conversion, transforms a given type 3 grammar into an equivalent NFA.
DFA to Type 3 grammar conversion, transforms a given NFA into an equivalent type 3 grammar.
Type 2 grammar standardization. Given a Free Context Grammar (a type 2 lazy grammar) we get his standardized version applying the algorithms to eliminate unreachable symbols, unary productions, epsilon productions, and finally Chomsky and Greibach Normal Form.

All the structures used are specified using xml-like syntax. See test directory for examples.

Return to the TOC

Where do I get Jaguar?

You can get the Jaguar package and found more about it from: http://sourceforge.net/projects/ijaguar/

Return to the TOC

System requirements

In principle, you only need a Java2(TM) virtual machine (JVM) >=v1.4.0 with the Java Foundation Classes (JFC) -- usually the JFC are included in the standard distribution of the major vendors. You can get your favorite JVM, from the next sources:

If you just want to run Jaguar it's enough to have any Java 2 Runtime Environment (JRE). To compile the sources you will also need a java compiler, also readily available. This project was developed and tested using the Java 2 v1.4.0-rc from java.sun.com. In the other hand the minimium hardware requirements are the specified by the vendor of the JVM of your choice.

Return to the TOC

Compiling the sources & running

Usually the sources will be delivered on a package such as:

jaguar.x-yz.src.tbz2

you need follow the next steps.

Extract the sources.: tar yxvf jaguar.x-yz.src.tbz2
the previos command will generate the directory jaguar.x-yz/
Change to the jaguar.x-yz/jaguar/ directory.
Type make and wait a few moments. (Note: the Makefile assumes that the java compiler javac is on your PATH)
Now you can execute Jaguar from the directory jaguar.x-yz/ as in:
java jaguar.JCenter