An incremental parsing system for programming tools
https://tree-sitter.github.io
679a841183
Profiling the `ts_query__analyze_patterns` function shows that it spends a lot of time copying items in its various state sets. These state sets are kept sorted, and the items are fairly large, so any time that we insert new entries near the front of the array, a lot of calls to memcpy must occur. In advance of more sophisticated rework, one easy win is to hide the large `AnalysisStateSet` objects behind pointers, so that the size of each item in the list goes from 68 to 8 bytes, and add an object pool to reuse allocations. This shows a significant performance improvement for grammars that have a lot of states in them. |
||
|---|---|---|
| .github/workflows | ||
| cli | ||
| docs | ||
| highlight | ||
| lib | ||
| script | ||
| tags | ||
| test | ||
| .appveyor.yml | ||
| .gitattributes | ||
| .gitignore | ||
| Cargo.lock | ||
| Cargo.toml | ||
| CONTRIBUTING.md | ||
| LICENSE | ||
| Makefile | ||
| README.md | ||
| tree-sitter.pc.in | ||
tree-sitter
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