The iss-baselib library implements many fundamental data structures and algorithms in the form of robust, reusable Eiffel classes.
Generic implementations make it possible to use theses classes in a wide range of applications.
The Lex classes offer a complete framework for the lexical analysis of the widest range of languages. The classes enable the specification of a lexical grammar using regular expressions, the specification being stored in a separate file, independently of the application, which makes it possible to modify application behavior without recompiling. The Parse classes offer a complete framework for the implementation of parsers based on the Recursive Descent algorithm for context-free languages. Object-oriented design enables the assignment of several different semantic actions to a centrally defined grammar and simplifies the development of several tools all relying on the same grammar. The extensive string functions enable the fully dynamic processing of strings.