Need help with tree-sitter?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

tree-sitter
5.1K Stars 295 Forks MIT License 3.5K Commits 170 Opened issues

Description

An incremental parsing system for programming tools

Services available

!
?

Need anything else?

Contributors list

# 420
JavaScr...
Atom
tree-si...
Less
2745 commits
# 79,460
Haskell
Shell
tree-si...
increme...
69 commits
# 30,033
tree-si...
Swift
Haskell
Git
43 commits
# 148,389
Rust
Shell
tree-si...
increme...
42 commits
# 33,638
tree-si...
Haskell
WPF
C#
36 commits
# 15,635
Swift
algebra...
Haskell
Shell
18 commits
# 91,689
Clojure
Shell
tree-si...
increme...
9 commits
# 1,181
Markdow...
Vue.js
ESLint
GraphQL
9 commits
# 183,711
aws-lam...
Terrafo...
C
tree-si...
9 commits
# 51,016
Rails
tree-si...
Bootstr...
increme...
8 commits
# 3,276
C
nvim
Neovim
Electro...
6 commits
# 49,736
yarn
npm
ecmascr...
geotool...
5 commits
# 193,138
cpp11
data-or...
ecs-fra...
Shell
5 commits
# 10,054
C
mariadb
Racket
Git
4 commits
# 147,937
Shell
chromiu...
tree-si...
increme...
4 commits
# 124,038
F#
Atom
tree-si...
Kotlin
4 commits
# 379,732
C
Shell
C++
tree-si...
3 commits
# 68,564
Shell
avro
cpluspl...
.NET
3 commits
# 156,819
openapi
swagger
visual-...
q
3 commits
# 8,789
Neovim
viml
Sass
sphinx
3 commits

tree-sitter

Build Status Build status DOI

Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited. Tree-sitter aims to be:

  • 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

Links

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.