Search Results for "free-xp"

...General enough to parse any programming language. Fast enough to parse on every keystroke in a text editor. Robust enough to provide useful results even in the presence of syntax errors. Dependency-free so that the runtime library (which is written in pure C) can be embedded in any application. All of Tree-sitter’s parsing functionality is exposed through C APIs. Applications written in higher-level languages can use Tree-sitter via binding libraries like node-tree-sitter or the tree-sitter rust crate, which have their own documentation. ...

GJSON is a Go library designed for extremely fast, allocation-free retrieval of values from JSON documents. It enables you to query nested JSON structures using one-liner dot-notation or array-based paths and includes wildcard and comparison operators. The library is optimized for speed and zero allocations, benchmarking significantly faster than Go’s standard encoding/json unmarshal approaches.

Instaparse is a simple yet powerful parser generator for Clojure and ClojureScript that turns grammars written in EBNF or ABNF into executable parsers, with support for left recursion, ambiguous grammars, PEG-like lookahead, and various output formats. Instaparse supports most of the common notations for context-free grammars. For example, a popular alternative to * is to surround the term with curly braces {}, and a popular alternative to ? is to surround the term with square brackets []. Rules can be specified with =, :, :=, or ::=. Rules can optionally end with ;. Instaparse is very flexible in terms of how you use whitespace (as in Clojure, , is treated as whitespace) and you can liberally use parentheses for grouping.

Nearley is a powerful and flexible parser generator for JavaScript, capable of parsing complex grammars and languages, making it suitable for building compilers, interpreters, and data processors.

This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.

Marid is a cross-platform data acquisition and visualization software intended to build complex and hierarchical data acquisition systems. The base concepts of its architecture include: * Graphical deploy configuration builders * Powerful Groovy scripting language * Embedded database ( H2 , HSQLDB) to store data * Cross-platform design (write once, run anywhere) * Embedded GUI-configurable binary/ascii device protocol parser/generator * Deploy manager to deploy firmwares to remote...

...Now I build this c# project which is based on JSqlParser project .Notably,the JSqlParser is based on javacc, but the NSqlParser is based on another semantic analyzer whoes name is 'MinosseCC'(see http://www.codeproject.com/Articles/11632/MinosseCC-a-lexer-parser-generator-for-C), For c# Grammar,I modified the file 'JSqlParserCC.jj', now his name is 'NSqlParserCC.jj', Obvious, the other code files also I have changed. And please remember this, This project is free for you, And including any commercial behavior.

qtBisonC++ is a general-purpose parser generator that converts a grammar description for an LALR(1) context-free grammar into a QT C++ program to parse that grammar. qtBisonC++ reads the given input files for a description of a scanner to generate. The description is in the form of grammar in Backus-Naur Form (BNF), called rules. qtBisonC++ generates as output a C++ source and include file, `lexyy.cpp` and `lexyy.h`, which defines a class `lexyy'.

ua-parser is a multi-language library for parsing User-Agent strings into structured data, such as browser, OS, and device information. Originally created for web analytics and user tracking, it supports a wide range of platforms and is available in JavaScript, Python, Java, and other languages. ua-parser is often used in server logs, analytics dashboards, and A/B testing systems to segment traffic.

The goal of this project is to create a simple and easy to use parser generator that will accept a textual grammar file as an input and output modularized classes representing a limited parser interface. Long term goals include a robust grammar file syntax, output suitable for multiple programming languages, and tools for better integrating compiler functionality, parse tree manipulation, and FSM based scanner generation.

upgen is a scanner and parser generator, which can generate parser programs in C++, Object Pascal, ...

Lapg is the combined lexical analyzer and parser generator, which converts a description for a context-free LALR grammar into source file to parse the grammar. Generates code for Java, Javascript, C, C++ and C#.

Parse software messages and transform them into actions. LazyBat has a command line utility which can transform input data, and also a parser generator for C/C++. LazyBat doesn't support recursive parsing, but rather focuses on common parsing jobs.

More Than Parsing is a parser generator for context free grammars defined in a BNF-like format. It generates scanners, parsers, ASTs, etc. This sf project is no longer active, development will continue in a different place.

A runtime parser generator library, generates parsers for context-free grammars. Parsing scripting languages and communication protocol messages are typical use cases. The library is written in straight C++ and requires STL. Clean, correct, efficient.

Many Tools: PHP-based context-free grammar (CFG) parser generator, simple scanner generator, and nascent object relational mapping/query language in PHP. Talks to Postgres, MySQL for now. Needs PHP5. Comes with (relies on) many convenience functions.

The VISL Phrase Structure Grammar Compiler is an implementation of a parser generator for ambiguous context-free grammars, ambiguous input, and ambiguous output.

A file parser/generator interface