Wen Kokke
Wen Kokke
@cyberglot Is this ready for a second review?
Perhaps a BNFC flag which adds the full range of input tokens parsed to create this node to each CST node?
More or less, though instead of only providing the first position of each token it'd be better to provide the entire range, either as a pair of `Position` or using...
This would solve #193, by virtue of the fact that there are tree-sitter bindings for Rust.
Perhaps @banacorn could offer their advice, since they wrote the parser for Agda? It seems that their [scanner.cc](https://github.com/tree-sitter/tree-sitter-agda/blob/master/src/scanner.cc) could be used as-is for top-level layout rules, with only minor adjustments...
> I wonder whether this could be factored into BNFC -> (E)BNF -> tree-sitter Wouldn’t this lead to problems supporting layouts?
I don't think `Relation.Predicate` is particularily meaningful either? Especially if we're using it as a synonym for `Unary`?
I think a solid base proposal would be to just remove the occurances of `Binary`, `Nullary`, and `Unary`: ```sed s/Relation\.\(Binary\|Nullary\|Unary\)/Relation/g ``` That would let us automate most of the work,...
Could anyone explain why negation and decidability are defined in `Relation.Nullary`, though? They seem very... unary?
Maybe we should split into “public” and “private”? @gallais?