From: kuangpma@gmail.com   
      
   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]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)