20 projects for "b-tree" with 2 filters applied:

  • Gemini 3 and 200+ AI Models on One Platform Icon
    Gemini 3 and 200+ AI Models on One Platform

    Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

    Build, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
    Start Free
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 1
    Classic BCPL for the ATARI ST

    Classic BCPL for the ATARI ST

    BCPL was designed by Martin Richards at Cambridge University (1966)

    ...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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    ...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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    fiftyfifty

    fiftyfifty is a programming language and game

    ...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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4

    Dapar

    Parsing for everybody.

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Add Two Lines of Code. Get Full APM. Icon
    Add Two Lines of Code. Get Full APM.

    AppSignal installs in minutes and auto-configures dashboards, alerts, and error tracking.

    Works out of the box for Rails, Django, Express, Phoenix, and more. Monitoring exceptions and performance in no time.
    Start Free
  • 5
    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    A collection of Metasyntaxes like EBNF for .Net including a definition file parser and an expression tree.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    Initially a simple C# EBNF file parser that construct the expression tree.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • $300 in Free Credit Towards Top Cloud Services Icon
    $300 in Free Credit Towards Top Cloud Services

    Build VMs, containers, AI, databases, storage—all in one place.

    Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
    Get Started
  • 10
    Analyse and convert sources to trees of blocks. Project on FreePascal and Lazarus.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    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 ...)
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    A programming language designed for searching and manipulating tree-structured data, particularly corpora of natural languages encoded in an s-expression-like format.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    Web interface to a prolog interpreter, where you can load prolog programs, do consults, and visualize the resolution tree in SVG.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    ...Bytecode architecture with separate compiler and interpreter/disassembler. Platform-independant bytecode based stackmchine, which has a fine arithmitical/raw-computing performance. B
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    This is a C++ interface to Expat. Its aim is to manage small XML files viewed as a tree of objects.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    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]
    Downloads: 1 This Week
    Last Update:
    See Project
  • 18
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB