An incremental parsing system for programming tools https://tree-sitter.github.io
Find a file
Max Brunsfeld e4be585c43 Handle ubiquitous tokens at the beginning of programs
As a final step before returning the finished parse tree, check if
there are still multiple nodes on the stack. If so, make the inner
nodes children of the top node.
2014-05-09 12:46:36 -07:00
examples Represent state ids as unsigned shorts 2014-05-08 13:23:46 -07:00
externals Add cpplint, lint script 2014-03-09 21:37:03 -07:00
include/tree_sitter Handle ubiquitous tokens at the beginning of programs 2014-05-09 12:46:36 -07:00
script cpplint 2014-04-28 21:46:43 -07:00
spec Handle ubiquitous tokens at the beginning of programs 2014-05-09 12:46:36 -07:00
src Handle ubiquitous tokens at the beginning of programs 2014-05-09 12:46:36 -07:00
.gitignore Generate makefile with gyp 2014-03-03 13:20:44 -08:00
.gitmodules Generate makefile with gyp 2014-03-03 13:20:44 -08:00
.travis.yml Link against libboost_regex correctly on travis 2014-04-11 18:33:53 -07:00
README.md Add references to readme 2014-03-09 12:28:18 -07:00
todo.md Update todo 2014-05-01 20:05:03 -07:00
tree_sitter.gyp Link against libboost_regex correctly on travis 2014-04-11 18:33:53 -07:00

tree_sitter

A library for generating incremental LR parsers with integrated lexers

Build Status

References