Search Results for "b-tree"

Vincent Radio {Adrix.NT} Sources Library & Applications : Delphi C++ Java VRCalc++ C# VRCalc++ Object Oriented Scripting Language - Engine Source Pascal Code - Delphi Packages Build Prjs - VRCalc++ Scripted System Std RT Library - Guides & Docs (CHM, PDF, DOCX) - VCL & FMX (FireMonkey) Support - Script Test Code (Lang RTL VCL FMX) - Visual Stage Project : VCL & FMX Paged Lists & Iterators : Delphi C++ Java C# Multi-Dim Arrays & Direct Graph Classes : Delphi C++ Java VRCalc++...

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

Student Programming Language (SPL) compiles and executes programs written in a subset of PL/I. SPL was created by David B. Wortman in 1969 at Stanford University as a teaching tool for beginning programmers. In 1970 the compiler was modified by Robin A. Vowels at Royal Melbourne Institute of Technology to be more compatible with the PL/I language. The compiler is written in XPL using an MSP parser. XPL is described in the book "A Compiler Generator" by McKeeman, Horning and Wortman.

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

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

Two projects; new one is "Alan" a programming language. The other is "jjLibrary" a C++ library which provides 1) jjPattern : Pattern-based container class (Hash, Tree, List, Graph), 2) jjErrno : error handling, and 3) jjCGI : CGI library.

The Hecl Programming Language is a high-level scripting language implemented in Java. It is aimed at resource constrained environments like mobile phones. *Now hosted here* http://github.com/davidw/hecl/tree/master

Little b is a Lisp-based language which allows scientists to build shareable, reusable mathematical models of complex systems based on shared parts. The initial focus is molecular and multicellular networks. Project web page: http://www.littleb.org

Analyse and convert sources to trees of blocks. Project on FreePascal and Lazarus.

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.

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.

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

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

This is a C++ interface to Expat. Its aim is to manage small XML files viewed as a tree of objects.

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.