tree-sitter/spec
Max Brunsfeld 535879a2bd Represent byte, char and tree counts as 32 bit numbers
The parser spends the majority of its time allocating and freeing trees and stack nodes.
Also, the memory footprint of the AST is a significant concern when using tree-sitter
with large files. This library is already unlikely to work very well with source files
larger than 4GB, so representing rows, columns, byte lengths and child indices as
unsigned 32 bit integers seems like the right choice.
2016-11-14 12:19:13 -08:00
..
compiler Introduce Symbol::Index type alias 2016-11-14 10:25:26 -08:00
fixtures Store shift states for non-terminals directly in the main parse table 2016-11-14 08:36:06 -08:00
helpers Represent byte, char and tree counts as 32 bit numbers 2016-11-14 12:19:13 -08:00
integration Represent byte, char and tree counts as 32 bit numbers 2016-11-14 12:19:13 -08:00
runtime Represent byte, char and tree counts as 32 bit numbers 2016-11-14 12:19:13 -08:00
spec_helper.h Fix leaked lookahead trees in normal parsing 2016-01-29 17:31:43 -08:00
specs.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00