ActiveTutorLite
This software developed by Jean-Pierre Fournier allows a more easy learning of basic mechanisms of object oriented
algorithms, by showing what happens during their running process.
The basic notions of this algorithmic,
which match the actual programming techniques, are the traditional algorithmic
notions (structure of programmes, data structures, iterating or recursive
programming...) together with notions bounded to object oriented
programming (encapsulation, derivation, generic programming, polymorphism,
handling of exceptional situations...)<
Our software shows
algorithms written in a particular syntax associated with a grammar. A pseudo-Pascal like grammar and a grammar
matching the formalism defined by Thomas H. Cormen, Charles E. Leiserson,
Ronald L. Rivest et Clifford Stein in their book " Introduction to
Algorithms " are given.
In its actual version, our
software doesn't allow any modification of algorithms after their
loading. The user who wishes to do so may separately use any text editor and
then load his algorithm again.
The main menu allows to:
- load a grammar from a .grammaire file (if it is syntactically correct),
- import an already parsed grammar from an xml file,
- load an algorithm
(.alg file) or a scenario (.sce file). A scenario is a set of algorithms intended
to work together,
- run an animation,
- stop an animation before the end of it,
- change the shown algorithm, choosing in the list of already loaded algorithms,
- change the language used by the software,
- change the fonts of characters used to show the algorithms.