Search Results for "b-tree"
Sort By:
Showing 15 open source projects for "b-tree"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
1
SWIG
A code generator for connecting C/C++ with other programming languages
...SWIG is typically used to parse C/C++ interfaces and generate the 'glue code' required for the above target languages to call into the C/C++ code. SWIG can also export its parse tree in the form of XML. -
2
GnuCOBOL
A free COBOL compiler
...The cobc compiler is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the FSF; either version 3, or (at your option) any later version. The libcob run time support source tree is licensed under the GNU LGPL. -
3
Ox: Attribute Grammar Compiling System
Ox is an attribute-grammar evaluator generator.
...From these augmented specifications, Ox generates ordinary Lex and Yacc specifications that build and decorate attributed parse trees. The user can specify parse-tree traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. -
4
Shapes
Graphical programming. Includes n-dimensional sorting.
Write programs as graphical dataflow charts instead of text. Compile them to any programming language you want. Besides this project includes the most efficient tree-based sorting algorithm that is possible. Originally developed on a CTOS Color NGEN, at first in Pascal, later ported to C, finally - 20 years later - ported to Linux. Currently it's still not really system independent. But it's intended that further releases will cure this. -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
UniCC LALR(1) Parser Generator
Parser generator, targetting C, C++, Python, JavaScript, JSON and XML
UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML. -
6
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. -
7
Front provides a compiler front end generator that can generate a parser, pretty printer, symbol table handling, and Abstract Syntax Tree data structures and traversals. It also provides a C preprocessor library, and an AST rewriter generator.
-
8
The B compiler is a tool able to parse B models, and perform syntaxic and semantic analysis. It can also be used as a library, linked to applications manipulating B models (cross referencer, code generator, documentation generator, etc.). The most recent source code is available at https://github.com/CLEARSY/BCOMPILER
-
9
Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing environments, it supports unicode, reentrancy and offers thread-safeness.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
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. -
11
XOgastan is an API that allow to write programs that takes in input the file containing the ast generated by gcc and to analyze them. Using it you can collect informations about the generic C program represented by the AST (Tree) dumped by gcc.
-
12
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.
-
13
...Bytecode architecture with separate compiler and interpreter/disassembler. Platform-independant bytecode based stackmchine, which has a fine arithmitical/raw-computing performance. B
-
14
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]
-
15
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.
- Previous
- You're on page 1
- Next
