4 ms·

I actually implemented that in Bison a few years ago, using graphs (DAG) rather than a matrix. You could define groups of totally ordered operators, and they we

I actually implemented that in Bison a few years ago, using graphs (DAG) rather than a matrix. You could define groups of totally ordered operators, and they were not (by default) cross comparable. However, given the low popularity of Bison, and that it's mainly used for its old features, I'm not sure that has ever been used in the wild...

boibombeiro 5y ago
Tree-sitter allows to specify precedence with partial ordering relations. See https://github.com/tree-sitter/tree-sitter/pull/939 https://github.com/tree-sitter/tree-sitter/pull/939