Is that difficult to write a Shift-Reduce parser

kuangpma <kuangpma@gmail.com>
Thu, 29 Apr 2010 19:48:37 -0700 (PDT)

          From comp.compilers
Related articles
Is that difficult to write a Shift-Reduce parser kuangpma@gmail.com (kuangpma) (2010-04-29)
Re: Is that difficult to write a Shift-Reduce parser kym@sdf.lonestar.org (russell kym horsell) (2010-05-01)
Is that difficult to write a Shift-Reduce parser chakaram@auth.gr (Chariton Karamitas) (2010-05-02)
Re: Is that difficult to write a Shift-Reduce parser rpw3@rpw3.org (2010-05-01)
Re: Is that difficult to write a Shift-Reduce parser cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-02)
Re: Is that difficult to write a Shift-Reduce parser dot@dotat.at (Tony Finch) (2010-05-04)
Re: Is that difficult to write a Shift-Reduce parser sh006d3592@blueyonder.co.uk (Stephen Horne) (2010-05-07)
[1 later articles]
| List of all articles for this month |
From: kuangpma <kuangpma@gmail.com>
Newsgroups: comp.compilers
Date: Thu, 29 Apr 2010 19:48:37 -0700 (PDT)
Organization: Compilers Central
Keywords: LR(1), parse, question
Posted-Date: 30 Apr 2010 18:47:03 EDT

Hi,


I am learning compiler theory, several books teach how to write (even
with source code) a Recursive Decent parser but not Shift Reduce
parser, only tell the theroy behind it. Particularly the Louden book,
it says that handcrafting a Shift Reduce parser is very difficult so
it suggests to use tools such like yacc to generate the parser.


So my question is that why Shift Reduce parser is difficult to write?
Is really impossible (well, relatively) to write it?
[I've done the LR parse table for a toy grammar, and it was incredibly
tedious, and I got the same result I would have gotten if I'd fed the
same grammar to yacc. -John]


Post a followup to this message

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