On 30 Jan 2014, at 17:55, Christian Schoenebeck
wrote:
> On Thursday 30 January 2014 18:03:28 Hans Aberg wrote:
>> I recall some others in the past that have written on interactive parsers
>> showing completions. So it may be of interest integrating it into Bison.
>
> I am sure this is a common
On Thursday 30 January 2014 18:03:28 Hans Aberg wrote:
> I recall some others in the past that have written on interactive parsers
> showing completions. So it may be of interest integrating it into Bison.
I am sure this is a commonly requested feature. However my code is C++ and the
algorithm is
On 30 Jan 2014, at 15:15, Christian Schoenebeck
wrote:
> On Wednesday 29 January 2014 23:11:28 Hans Aberg wrote:
>> It seems that your should use LR(1); see the Bison manual, sec. 5.8.1, "LR
>> Table Construction". Bison by default uses LALR(1), which merges the
>> states in such a way that when
On Wednesday 29 January 2014 23:11:28 Hans Aberg wrote:
> It seems that your should use LR(1); see the Bison manual, sec. 5.8.1, "LR
> Table Construction". Bison by default uses LALR(1), which merges the
> states in such a way that when an error occurs, though no further tokens
> will be read, some
