Expand description
Transform a tree-sitter tree into the Ast ECS via recursive decent While parsing we keep a mutable state to store entities and errors
Structsยง
- Visitor
State ๐
Functionsยง
- check_
langlvls ๐ - check_
no_ ๐extra_ blk report error if a node has cardinality or attributes - check_
simple_ ๐blk Report error if a node has children,cardinality or attributes - opt_
aggreate_ ๐op - opt_
aggregate ๐ - opt_
arithmetic_ ๐minor - opt_
attrib_ ๐expr - opt_
bool ๐ - opt_
boolean_ ๐minor - opt_
cardinality ๐ - opt_
constraint ๐ - opt_
equation ๐ - opt_
function_ ๐args - opt_int ๐
- opt_
integer ๐ - opt_
integer_ ๐op - opt_
lang_ ๐lvl - opt_
logic_ ๐op - opt_
major_ ๐lang_ lvl - opt_
name ๐ - opt_
number ๐ - opt_
numeric ๐ - opt_
numeric_ ๐op - opt_
path ๐ - opt_
string ๐ - opt_
type_ ๐minor - opt_
value ๐ - visit_
attributes ๐ - visit_
blk_ ๐decl - visit_
constraint ๐ - visit_
constraints ๐ - visit_
feature ๐ - visit_
features ๐ - visit_
group ๐ - visit_
import ๐ - visit_
import_ ๐decl - visit_
include ๐ - visit_
lang_ ๐lvl - visit_
namespace ๐parse a namespace - visit_
ref ๐ - visits all valid children of a tree-sitter (green tree) recursively to translate them into the AST(red tree)
- visit_
top_ ๐lvl