Search Results for "non-free"

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

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

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

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.

A simple way to create a syntax highlighting editor for a custom language/grammar and/or create custom grammar parsers. This is a .NET project written in C#. See details here: http://acct001.com/wordpress/?p=190

CSP Canonical LR(1) Parser Generator. Includes lexer and parser generator. Supports all OS. Produces code as standard ANSI C++ w/ minimal STL and usable in commercial or non-commercial purposes.

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.