| This SO library realizes algorithms, based on automata theory, graph theory
and author's unique methods.
It is demo version of toolkit, which may be used for very wide range
of developments like parsers, interpreters, compillers, object and event oriented libraries,
modules for operating systems, evironments, different management and control systems etc. The main purpose of this issue is to demonstrate a few author's approaches
to solving the following tasks :
1. Translation of the simple boolean descriptions of any regular objects with recursive
nature into tree based schema of structural automaton.
2. Recognition of regular(or non regular, depends on point of considering) expressions
with structural automatons. The following methods were developed :
1.Synthesis of structural automaton schema from set of elementary conjunctions or disjunctions (definitions of nodes) as tree of different type definitions - strings,
expressions, recognizable with deterministic user defined automatons, and nonterminal nodes.
2.Recognition of regular recursive expressions with generated automaton. This is the very basic development, has the following limitations :
1. Input definitions must be elementary conjunctions or disjunctions with fixed order.
2. Recursive references in definitions must be arranged last after terminal nodes
to provide condition of exit from recursive calls(but depends on concrete usage).
3. Only first successfull node is considered while processing disjunctional parent node.
Every limitation can be cancelled with additional developments. It concerns processing
any input boolean expressions by transformation them into completed disjunctional normal
form for instance, check for cycled definitions , considering all disjunctional descendants
in nodes, insert of callback points and so on. This demo version consists of librsautom1d0.so, rsautom_doc.h with commentaries
and simple example in rsautomex1.cpp with commentaries. The toolkit is still experimental. It is currently available as a
Linux shared library, which was compiled with g++2.96 under RedHat 9.0. The steps to try applied examples are:
1) to install librsautom1d0.so and libdautom1d0.so(from Deterministic Automaton SO) files;
2) to build example with :
g++296 -fPIC -c -Wall rsautomex1.cpp ;
g++296 -o rsautomex1 rsautomex1.o -lrsautom1d0. For bug reports, please
contact the valstas@onlinehome.de .
|
