An incremental parsing system for programming tools
https://tree-sitter.github.io
0dd41f0d74
Removing this restriction created problems for the Rust grammar, and possibly others. The proper fix would be to ensure that the 'word token' matches *every* possible string that a 'keyword token' matches, as opposed to just matching *some* of the same strings. This would require us to gather a little more information about how tokens conflict. For now, I'm just going to put back the hard-coded logic that we had. |
||
|---|---|---|
| docs | ||
| externals | ||
| include/tree_sitter | ||
| script | ||
| src | ||
| test | ||
| .clang-format | ||
| .clang_complete | ||
| .gitignore | ||
| .gitmodules | ||
| .travis.yml | ||
| appveyor.yml | ||
| LICENSE | ||
| project.gyp | ||
| README.md | ||
| tests.gyp | ||
tree-sitter
Tree-sitter is 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 (and written in pure C) so that it can be embedded in any application