As of late last night, I have a functional tree-sitter parser for highlighting, turns out it's pretty simple to implement grammars for point-free reflective langs if you ignore reflections and just parse on implicit "type". Need to actually build a keyword RegEx instead of hard coding built-ins tho
add a skeleton here at some point
21 days ago