Re: C++ variants in reentrant bison/flex combination

[Fedor Sumkin]

Hi all,

Some time ago I've discovered this two good C++ flex/bison reentrant parser
examples :
 -  https://github.com/ezaquarii/bison-flex-cpp-example -- very solid and
clear in terms of time needed to rework it for your needs. I.e. I've
rewrote not highly complex flex/bison C parser to C++ in a day/two just
looking on that example.
 -  https://github.com/esseks/monicelli -- slightly harder example, but
also worth looking too.

Just my 2 cents.

Regards,
Fedor

On Mon, Aug 22, 2016 at 9:55 PM, Hans Åberg <address@hidden> wrote:

>
> > On 22 Aug 2016, at 11:48, PICHLMEIER Florian <address@hidden>
> wrote:
>
> > I am trying to modify an existing nonreentrant bison/flex combination to
> be reentrant.
>
> Sorry, my comment was about when not using variants.
>
> > The problem I encounter during compilation is the error "YYSTYPE does
> not name type”
>
> The Bison distribution calc++ example uses variants but the output C++
> parser file does not contain YYSTYPE. So perhaps your grammar file does not
> end with .yy, some ‘bison’ compile option causing the issue, or something.
>
> > I read through the manual of bison and flex, and tried to find an
> example online that combines an reentrant C++ parser C scanner combination
>
> The Bison C++ parser is reentrant, though.
>
>
>
> _______________________________________________
> address@hidden https://lists.gnu.org/mailman/listinfo/help-bison