- based on a classical compiler construction
- dynamic load of the algebra in the the lexical analysis stage
- dynamic target description load in the code production: the compiler could produce a wide variety of code, according to the loaded target
- optimized to produce parallel code
- programmed with C for DOS/WINDOWS and Unix
- uses a garbage collector: efficient memory management in the compiler
- uses a regular expression library to parse the data
The Lambda-Flow compiler
The Lambda-Flow compiler is based on a classical structure. Therefore is it dynamically extendable and it is uses advanced programming concepts.
FEATURES
The Lambda-Flow compiler uses a classical compiler construction. Therefore, it is dynamically extendable with algebra and target definitions. The target definition can contain interpreted programs.
It is programmed in a portable C and compilable for DOS and Unix. It uses advanced programmation technics, such as a garbage collector.
Structure
of the produced code
