Search Results for "b-tree"

...https://sourceforge.net/p/clipsrules/ The misclns4.tst is a good example for it because HyperCLIPS performs 200% - 400% faster than the original version of CLIPS. The CLIPS test suite(including misclns4.tst) are available from here. https://sourceforge.net/p/clipsrules/code/HEAD/tree/branches/63x/test_suite

...Source credits include: Martin Richards - BCPL Kit http://www.cl.cam.ac.uk/~mr10/ Robert Nordier (Translated interp to C) http://www.nordier.com/ Serge Vakulenko (Translated cg/syn/trn to C) https://github.com/sergev/b I'm sure there are other names, but those are the ones on the source files. The code now compiles clean for the Atari ST, so it should work for anything else.

...The Cicada language is in some sense as simple as possible: variables, sets, functions, function arguments and classes are all the same thing. This gives it some unique capabilities in function calling, etc. Cicada script has been moved to: https://github.com/heltilda/cicada/tree/master

...Variables, functions, sets, structures, etc. are all the same thing in Yazoo -- this gives it simplicity and significant flexibility. Yazoo is obsolete! Its much-improved successor is Cicada script, which can be found at: https://github.com/heltilda/cicada/tree/master

Dapar is a universal parsing library written in C. It will interpret any grammar you give it in a BNF-like format, and constructs a matching expression tree for any given input. This makes developing a new parser for any language simple and reliable. Includes an ABNF parser, EBNF parser, XML parser and algebraic math parser.

EuLib is a C library implementing the embeddable language "Calc" and some abstract data types like lists, trees, b-trees and date/time management functions. Initially developed by Eurosoft Informatica Medica for it's own internal use, it's now LGPL.

...Bytecode architecture with separate compiler and interpreter/disassembler. Platform-independant bytecode based stackmchine, which has a fine arithmitical/raw-computing performance. B

Object Tree, Virtual Machine and Compiler for Concatenative Languages, in a shared library - [This project is obsolete, and has been superseeded by the XCL suit, available at http://www.varkhan.net/software/xcl]

A simple XML taglib processor. It reads in an XML document and, based on XML namespaces, chooses a library to handle the part of the XML tree within that namespace. The result is a new XML document.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.