Search Results for "b-tree"

...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.

...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

...The read-write head itself is a state engine, which is affected by the input from the track, and which decides what to write on the track, and where to read the next input, by "moving" the head back or forth. In 5050, the part of the track left of the head is represented not by a line or stack of information, but by a binary tree. The part right of the head is represented by a binary tree, too. The head itself sort of sits between the two trees, but will often change its state according to information from the right side of the left side. In 5050, the state of the head itself is again represented as a tree of commands, although for simple programs, a linear representation can be sufficient.

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.

The fast, flexible, extensible, and easy to use C++ template class for creating your own customized math expression parser for both built-in and user-defined numerical data types. The parsed tree perform fast and can be used in multi-threaded OpenMP apps

A collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.

CITkit (Compiler and Interpreter ToolKIT) is a collection of Java libraries that implement the more mundane aspects of a compiler or interpreter: symbol tables, tree intermediate representations, linear intermediate representations.

Initially a simple C# EBNF file parser that construct the expression tree.

Expression4J (Math Expression Parser) is a java framework used to manage mathematic expression stored in String object like "f(x,b)=2*x-cos(b)" or "g(x,y)=f(y,x)*-2". Expression gramar can be define by user (add new operator or type ...)

A programming language designed for searching and manipulating tree-structured data, particularly corpora of natural languages encoded in an s-expression-like format.

Web interface to a prolog interpreter, where you can load prolog programs, do consults, and visualize the resolution tree in SVG.

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]

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.

This is a cross-platform C++ library that provides an intuitive and quick way to deal with tree structured configuration text files. It is also very small, making it easy and comfortable to include in any project.