Graphical programming. Includes n-dimensional sorting.
Write programs as graphical dataflow charts instead of text. Compile them to any programminglanguage you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible.
Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this.
The software resents an executable specification language based on deterministic finite automata, this allows the user to perform tests of word recognition in the state machines that are defined by it. Moreover, it’s possible for the user to assign snippets of code to be executed every transition automaton, these snippets can be described in Lua or PHP programminglanguage. To test that were conducted in the language, was developed a compiler that recognizes words and generates object code.