tree-sitter/lib/src/error_costs.h

#ifndef TREE_SITTER_ERROR_COSTS_H_
#define TREE_SITTER_ERROR_COSTS_H_

#define ERROR_STATE 0
#define ERROR_COST_PER_RECOVERY 500
#define ERROR_COST_PER_MISSING_TREE 110
#define ERROR_COST_PER_SKIPPED_TREE 100
#define ERROR_COST_PER_SKIPPED_LINE 30
#define ERROR_COST_PER_SKIPPED_CHAR 1

#endif
Just call the C lib 'the library' everywhere, don't call it a 'runtime' 2019-01-10 15:22:39 -08:00			`#ifndef TREE_SITTER_ERROR_COSTS_H_`
			`#define TREE_SITTER_ERROR_COSTS_H_`
Fix some inconsistencies in error cost calculation Signed-off-by: Nathan Sobo <nathan@github.com> 2016-08-31 10:51:59 -07:00
Remove generated parsers' dependency on runtime.h 2016-10-05 14:02:49 -07:00			`#define ERROR_STATE 0`
Introduce an error cost per error instance to favor fewer errors 2018-04-02 11:52:34 -07:00			`#define ERROR_COST_PER_RECOVERY 500`
Maintain a total node count on every tree This simplifies (and fixes bugs in) the parse stack's tracking of its total node count since the last error, which is needed for error recovery. 2018-04-02 10:57:44 -07:00			`#define ERROR_COST_PER_MISSING_TREE 110`
Improve heuristics for pruning parse versions based on errors * Rewrite the error cost comparison in terms of explicit, discrete conditions. * Allow merging versions have different error costs. * Store the depth of each stack version since the last error. Use this state to prevent incorrect merging. * Sort the stack versions in order of preference and put a hard limit on the version count. 2017-06-29 14:58:20 -07:00			`#define ERROR_COST_PER_SKIPPED_TREE 100`
			`#define ERROR_COST_PER_SKIPPED_LINE 30`
			`#define ERROR_COST_PER_SKIPPED_CHAR 1`
Fix some inconsistencies in error cost calculation Signed-off-by: Nathan Sobo <nathan@github.com> 2016-08-31 10:51:59 -07:00
			`#endif`