Re: Can shift/reduce problems be eliminated?

On 31 Dec 2002 23:47:15 -0500, Carl Cerecke wrote:
><grumble>
>I'm currently finishing off a parser for a rather large language with
>many such tricky cases. The current version of my grammar "contains 147
>shift/reduce conflicts and 232 reduce/reduce conflicts.", according
>to bison, in a generated parser of over 2000 states. Beware of languages
>designed by comittee!
></grumble>


    Just out of curiosity: don't you consider this to be exactly the case
    for hand-written recursive parser ? From my experience, once you have
    more hacks than grammar in your .y file, hand crafted recursive parser
    might save you from additional trouble, because you have a complete control
    over how it works. Or may be mixed approach is even better...


    C++ language is one example of this happening, because if I'm not mistaken
    g++ is going to throw formal specification away and code it by hand.


Thanks,
Roman.

Return to the comp.compilers page.
Search the comp.compilers archives again.