Search Results for "parser"
Sort By:
Showing 125 open source projects for "parser"
View related business solutions-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
1
parcel/css
A CSS parser, transformer, and minifier written in Rust
A CSS parser, transformer, and minifier written in Rust. Parsing and minifying large files are completed in milliseconds, often with significantly smaller output than other tools. Many other CSS parsers treat property values as an untyped series of tokens. This means that each transformer that wants to do something with these values must interpret them itself, leading to duplicate work and inconsistencies. -
2
Opal
Opal is a Ruby to JavaScript source-to-source compiler
Opal is a Ruby to JavaScript source-to-source compiler. It comes packed with the Ruby corelib you know and love. It is both fast as a runtime and small in its footprint. The lib directory holds the Opal parser/compiler used to compile Ruby into JavaScript. It is also built ready for the browser into opal-parser.js to allow compilation in any JavaScript environment. This directory holds the Opal runtime and corelib implemented in Ruby and JavaScript. opal-parser allows you to eval Ruby code directly from your HTML (and from Opal) files without needing any other building process. ... -
3
Gherkin
A parser and compiler for the Gherkin language
Gherkin is a domain-specific language used in behavior-driven development (BDD) to describe software behaviors in a human-readable format. It allows stakeholders to write test cases in plain language, bridging the gap between technical and non-technical team members. -
4
Marked
A markdown parser and compiler. Built for speed
A low-level markdown compiler for parsing markdown without caching or blocking for long periods of time. Light-weight while implementing all markdown features from the supported flavors & specifications. Available as a command-line interface (CLI) and running in client- or server-side JavaScript projects. The only completely secure system is the one that doesn't exist in the first place. Having said that, we take the security of Marked very seriously. To prevent ReDoS attacks you can run... -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
CCC
Claude Opus 4.6 wrote a dependency-free C compiler in Rust
Claude’s C Compiler is a remarkable experiment in automated software generation: a full C compiler written from scratch in Rust entirely by an AI model (Claude Opus 4.6) with minimal human intervention, capable of targeting multiple architectures like x86-64, i686, ARM, and RISC-V. The project implements every part of a traditional compiler — the lexer, parser, intermediate representation, optimizer, code generator, assembler, linker, and debug info emitter — without relying on any external toolchain, producing standalone executables in the ELF format. While still early and not fully validated for correctness, it demonstrates the frontier of what sophisticated AI can build in complex, systems-level software domains, including the potential to compile real operating systems and large software projects. -
6
FlatCC FlatBuffers in C for C
FlatBuffers Compiler and Library in C for C
...With concurrent Ninja builds, a small client project can build flatcc with libraries, generate schema code, link the project and execute a test case in a few seconds, produce binaries between 15K and 60K, read small buffers in 30ns, build FlatBuffers in about 600ns, and with a larger executable also handle optional json parsing or printing in less than 2 us for a 10 field mixed type message. The JSON parser may change the interface for parsing union vectors in a future release which requires code generation to match library versions. This project builds flatcc, a compiler that generates FlatBuffers code for C given a FlatBuffer schema file. This introduction also creates a separate test project with the traditional monster example, here in a C version. ... -
7
Transcrypt
Python 3.7 to JavaScript compiler
Python in the browser, precompiled for speed. Transcrypt started out as a personal repo, owned by Jacques de Hooge. As the project caught on and the number of people contributing issues, ideas and code grew, the repo was transferred to the QQuick organization, to be able to form a developer team on GitHub. There's a simple parallel between the Python and the JavaScript code. In combination with the use of source maps, this enables efficient debugging. Also, code can be tested from the... -
8
mtail
Extract internal monitoring data from application logs
Extract internal monitoring data from application logs for collection in a time-series database. mtail is a tool for extracting metrics from application logs to be exported into a timeseries database or timeseries calculator for alerting and dashboarding. It fills a monitoring niche by being the glue between applications that do not export their own internal state (other than via logs) and existing monitoring systems, such that system operators do not need to patch those applications to... -
9
MLton
A whole-program optimizing compiler for Standard ML
...In addition, MLton provides a feature rich Standard ML programming environment, with full support for SML97 as given in The Definition of Standard ML (Revised), a number of useful language extensions, a complete implementation of the Standard ML Basis Library, various useful libraries, a simple and fast C foreign function interface, the ML Basis system for programming with source libraries, and tools such as a lexer generator, a parser generator, and a profiler. -
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
10
ARTCOMParser
Parser library that uses an EBNF like grammar to generate a parse tree
Parser library that uses an EBNF like grammar to generate a parse tree You can use it to create a quick parser It uses backtracking so it may be slow for some grammar rules -
11
Ox: Attribute Grammar Compiling System
Ox is an attribute-grammar evaluator generator.
Ox is an attribute grammar compiling system that augments Lex and Yacc specifications with definitions of synthesized and inherited attributes written in a combination of Ox and C/C++ syntax. 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... -
12
Simple components for Ada
A software components library
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix... -
13
Foreval
Foreval is parser , compiler , evaluator of mathematical expressions
...Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex) -
14
ULS
A lexical analyzer generator that makes the class source code.
ULS is a class library for creating lexical analyzer from language specification file. It's provided as C/C++/C# and Java (class) libraries with a few of tools on Linux/Windows platform. -
15
CpDB
Relational database schema and tools for bacterial genome annotation
This software allows us to create a relational database in PostgreSQL hosting full bacterial genomes. Besides the database, there is software, like a parser, to convert EMBL or GBK files to the CpDB relational schema. Once in the CpDB, one can extract unlimited reports from bacterial genomes using SQL. This software is part of the Ph.D. in Bioinformatics from Anderson Santos (https://orcid.org/0000-0003-3418-0823) developed under the Corynebacterium pseudotuberculosis (Cp) pangenome project. ... -
16
forevalz
ForevalZ - compiler of mathematical expressions with complex numbers
...Examples for Delphi (2009), FPC , C++(Builder(2009), MSVC(2010), GCC (Codeblock)), VB.NET, VB6, FreeBasic. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring . (math parser, math expression parser, evaluate formula, evaluator, calculate) (v.1.3.5.231) The project IS CLOSED. Project development of NEXT VERSION see "Foreval" project. Last version v9 support all propertues of ForevalZ. -
17
Parser Generator
It is an LL(1) recursive descent parser generator in VB.NET
It is an LL(1) recursive descent parser generator written in VB.NET which can generate a scanner, parser, and parsetree file in either C# , Java or VB code. The original code and documentation can be found in the article 'A Tiny Parser Generator v1.2' on CodeProject. Requires dotNet2.0 -
18
From PEG to a practical parser
Transcribe Parsing Expression Grammar into a parser written in Java.
Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent recursive procedures. ... -
19
8cc C Compiler
Compiler for the C programming language
...It was created as a hobby project with the goal of demonstrating how a compiler works internally, making it a valuable resource for learning compiler design. The project includes core components such as a lexer, parser, and preprocessor, allowing users to explore each stage of the compilation process. One of its notable features is its ability to compile itself, showcasing its completeness and serving as a practical example of bootstrapping in compiler development. The code is intentionally written to be concise and readable, making it accessible to developers who want to study compiler internals. ... -
20
lr1
A small, didactic LR(1) parser generator.
-
21
9cc C compiler
A Small C Compiler
9cc is a small and educational C compiler designed to demonstrate the internal workings of a compiler while still being capable of compiling meaningful programs. It serves as a continuation of Rui Ueyama’s series of compiler projects, focusing on clarity and incremental development rather than production-level optimization. The compiler implements essential stages such as lexical analysis, parsing, semantic analysis, and code generation, providing a complete pipeline from source code to... -
22
Monkey is a scanner and a LR(1) parser generator for object oriented languages. The platform on wich it runs is Java.
-
23
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. -
24
SableCC is a parser generator which generates object-oriented frameworks for building compilers, interpreters and other text parsers. SableCC keeps a clean separation between machine and user code which leads to a shorter development cycle.
-
25
DParser
Scannerless GLR parser generator
This project has moved to https://github.com/jplevyak/dparser The master on github is the stable. Please pull that for the very latest code. DParser is a scannerless GLR parser generator based on the Tomita algorithm. It is self-hosted and very easy to use. Grammars are written in a natural style of EBNF and regular expressions and support both speculative and final actions.
