Re: bison info doc - precedence in recursive parsing

[Hans Åberg]

> On 17 Feb 2019, at 16:18, Akim Demaille <address@hidden> wrote:
> 
>> Le 10 févr. 2019 à 15:10, Hans Åberg <address@hidden> a écrit :
>> 
>> 
>>> On 5 Feb 2019, at 07:18, Akim Demaille <address@hidden> wrote:
>>> 
>>> This feature is very handy for small grammars, but when it gets too big, 
>>> you'd better look at the HTML report (or text).
>> 
>> I made a graph for the grammar itself, using the shape=record feature, for 
>> the calc++ example. Might be of help when designing a grammar.
> 
> Can you send the result?  So that we understand better what you mean.

Attached is a version with the rule expansions dotted. Illustrates the 
language, the set of all expansions from the start symbol that end with 
non-terminals in all branches.

grammar.gv
Description: Binary data