tree-sitter/src/runtime/node.h

#ifndef RUNTIME_NODE_H_
#define RUNTIME_NODE_H_

#include "runtime/tree.h"

TSNode ts_node_make(const Tree *, uint32_t character, uint32_t byte, uint32_t row);

#endif
Hide TSTree, expose TSNode 2014-07-17 23:29:11 -07:00			`#ifndef RUNTIME_NODE_H_`
			`#define RUNTIME_NODE_H_`

Don't create error node in lexer unless token is completely invalid Before, any syntax error would cause the lexer to create an error leaf node. This could happen even with a valid input, if the parse stack had split and one particular version of the parse stack failed to parse. Now, an error leaf node is only created when the lexer cannot understand part of the input stream at all. When a normal syntax error occurs, the lexer just returns a token that is outside of the expected token set, and the parser handles the unexpected token. 2016-05-20 20:26:03 -07:00			`#include "runtime/tree.h"`
Hide TSTree, expose TSNode 2014-07-17 23:29:11 -07:00
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:15:24 -08:00			`TSNode ts_node_make(const Tree *, uint32_t character, uint32_t byte, uint32_t row);`
Hide TSTree, expose TSNode 2014-07-17 23:29:11 -07:00
			`#endif`