An incremental parsing system for programming tools
- incremental
- parsing
- c
- tree-sitter
47,133 repositories indexed
1–24 of 26 · Most stars
An incremental parsing system for programming tools
Python SQL Parser and Transpiler
Python library for creating PEG parsers
A tiny, friendly, C# parser construction library
Parsing Expression Grammar Template Library
Spoon is a metaprogramming library to analyze and transform Java source code. :spoon: is made with :heart:, :beers: and :sparkles:. It parses source files to build a well-designed AST with powerful analysis and transformation API.
uniVocity-parsers is a suite of extremely fast and reliable parsers for Java. It provides a consistent interface for handling different file formats, and a solid framework for the development of new parsers.
Build fast, composable, and type-safe grammars and parsers in Dart.
ECMAScript parsing infrastructure for multipurpose analysis
C++ regular expressions made easy
CSS parser with support of preprocessors
A parser combinator library written in the Swift programming language.
Typed Regular Expressions
Javascript Generalized Parser Combinators
A portable Common Lisp reader that is highly customizable, can recover from errors and can return concrete syntax trees
Pure-Go SQL parser, formatter, linter and security scanner for 8 dialects. Zero-copy, race-free, with an LSP and MCP server.
Write parsers for arbitrary text inputs, entirely in Java, with no preprocessing phase
Golang source code parsing, usage like reflect package
dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.
Max’s Parser Combinators: a simple and pragmatic library for writing parsers and lexers based on combinatory parsing.
An Earley parser written in Ruby
Parseq is a library for Common Lisp used for parsing sequences such as strings and lists using parsing expression grammars.
Build parsers easily
An experimental implementation of parsing expression grammars (a la Janet) in Common Lisp