[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Clarification on "Infinite parsing loops in IELR + LAC"
From: |
Akim Demaille |
Subject: |
Re: Clarification on "Infinite parsing loops in IELR + LAC" |
Date: |
Fri, 5 Oct 2018 06:37:07 +0200 |
Hi Guys!
> Le 30 sept. 2018 à 02:29, Joel Denny <address@hidden> a écrit :
>
> Hi Adrian,
>
>> On a separate point:
>> The grammar I am working on is using the C++ template but LAC is not yet
>> supported for C++.
>> I am thinking about contributing LAC support for C++.
>>
>
> That sounds cool. You should check with Akim before getting started as he
> maintains Bison.
I’m not working on this currently, so it would be a very welcome
contribution! I have not looked at it in details, so I don’t know
either how it would interact with GLR, but it would be nice to find
a means to factor LAC support as much as possible (glr/non-glr,
c/c++, possibly java).
>> I read the parts on syntax error handling from your thesis (
>> https://tigerprints.clemson.edu/cgi/viewcontent.cgi?article=1519&context=all_dissertations,
>> section 5.2.2).
>> I was wondering, if there might be additional pitfalls I should be aware
>> of when porting the C code to C++?
>>
>
> None that I know of, but I'm afraid I've been away from Bison development
> for years. Akim would have to help here.
I’ll be happy to help!
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- Re: Clarification on "Infinite parsing loops in IELR + LAC",
Akim Demaille <=