> I've been testing the semantic parsers and related tools against
> modes other than C recently. I went to test the tools against
> semantic-grammar.wy and found a few curious things.
> The name of a rule is equal to the concatenation (with spaces) of all
> the :value entries. This makes using senator-jump to something
> defined by %token challenging as there may be several rules that
> match just that %token or %keyword.
> I'd like to suggest naming them the same way they show up in your
> stack traces such as "rule:0" or "some_nonterminal:2". The cool thing
> about that is that if the given function is found in an error,
> standard semantic searches will find it in the grammar buffer with
> very little effort.
That's a very good idea! I will try to do that as soon as possible.