Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,868 of 2,753    |
|    Chariton Karamitas to All    |
|    Is that difficult to write a Shift-Reduc    |
|    02 May 10 00:43:41    |
      From: chakaram@auth.gr              Hello,              A S/R parser is not difficult as in "this equation is difficult to       solve" :-) It's easy but it's a lot of work, that's why we prefer       having yacc do it. Of course, you can do it by hand, but you need to       keep in mind a lot of stuff while constructing the states. Think of it       as trying to multiply two very big integers -- it's easy, but why do       it by hand?              Imho if you want to know how a S/R parser works, you'd better check       how a S/R parser *generator* works. I suggest you take a look at byacc       source code (http://invisible-island.net/byacc/byacc.html). It worked       for me :-)              Cheers       ./ck       --       Chariton Karamitas       Undergraduate Student       Electrical and Computer Engineering Department       Fuculty of Engineering       Aristotle University of Thessaloniki, Greece              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca