382 Open source projects that are alternatives of or similar to Concrete-Syntax-Tree

Tools and libraries to glue C/C++ APIs to high-level languages

Library for lexing and parsing D source code

A parser for nondeterministic context free languages

BNF wrangling and railroad diagrams

An blazing fast 100% spec compliant, incremental javascript parser written in Typescript

JSON Parsing + Archiving & Unarchiving in User Defaults

parser combinator and AST generator in c++17

CVparser is software for parsing or extracting data out of CV/resumes.

Golang bindings for tree-sitter https://github.com/tree-sitter/tree-sitter

The Greynir NLP parser for Icelandic, packaged for PyPI

A library for working with abstract syntax trees.

logstash-config provides a parser and abstract syntax tree (AST) for the Logstash config format, written in Go

Convert your Amazon Kindle highlights and notes into markdown (or any format).

Astview is a graphical viewer for abstract syntax trees

htmlparsing.com, a website devoted to helping people parse HTML correctly

🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin

😈 A library for parsing TLDs from urls in Elixir

Idea behind the StatementParser is, that it would be nice to be able to process financial data from different kind of statements in automatized way. This is often pretty hard as brokers are giving these data only in form of xls/xlst/pdf or other format which is not directly processable and here comes StatmentParser.

A tiny but fast java event-style markup parser.

An 802.11 Frame Generation and Parsing Library in C

Named Entity Recognition as Dependency Parsing

🔨 📶 WiFi-Jammer/DoS toolset

Fast SAX XML parser for PHP.

A Python package for parsing FISPACT-II output

No description or website provided.

A customizable markdown parser in Elixir: pure pattern matching.

A suite of language tools

Fastest general-purpose parsing library for Python with a familiar API

Curated list of all NLP Resources

SIEM Logstash parsing for more than hundred technologies

Swift wrappers for the tree-sitter incremental parsing system

A compiler that accepts any valid program written in C. It is made using Lex and Yacc. Returns a symbol table, parse tree, annotated syntax tree and intermediate code.

TAB-delimited text parser for ABAP

utility to create a new trees with a nice syntax

An 100% spec compliant ES2022 JavaScript toolchain

Wallhaven API for Java

A light-weight, extendable, high level, universal code parser built on top of tree-sitter

Yet another PDF Kit for parsing and modifying PDF's. For OS X and iOS.

Simple slash command parsing.

Handle infinite scroll on websites by puppeteer

Open-source code analysis platform for C/C++/Java/Binary/Javascript/Python/Kotlin based on code property graphs

Configurable lexer for PHP featuring a fluid API.

Reliable cross-platform strongly-typed file/directory path manipulation and file system access in .NET.

A customizable Android and iPhone WhatsApp database parser that will give you the history of your WhatsApp conversations in HTML and JSON. Android Backup Crypt12, Crypt14 and Crypt15 supported.

Core Foundation, libyajl based JSON support.

A library for parsing FIX (Financial Information eXchange) protocol messages.

C language compiler from scratch for a custom architecture, with virtual machine and all

Arborist is a PEG parser that supports left-associative left recursion

Rust refactoring templates for comby, the structural find-and-replace tool.

A parser combinator library with declarative superpowers

C++ library for MP4 file parsing.

Extract emails from a given website

Neural network transition-based dependency parser (in Rust)

Site for unified

A R parser based on combinatory parsers.

⚙️ Lite, typed, pythonic utilities for git, svn, mercurial, etc.

Extracts tables from .docx files and saves them as .csv or .xls files

Simple python script to parse twitter feed to generate a rss feed.

Library for extracting text and timestamps from multiple subtitle files (.ass, .ssa, .srt, .sub, .txt).

Quick explanation of eliminating left recursion in Haskell parsers