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,962 of 2,753    |
|    Chariton Karamitas to All    |
|    Re: shift/reduce problem    |
|    05 Dec 10 17:15:35    |
      From: chakaram@auth.gr              Hello,              You can either use GLR (as Hans Aberg proposed) or backtracking (e.g       BtYacc). Assuming there are no further ambiguities in your grammar,       each of the aforementioned techniques will end up producing one parse       tree. GLR/backtracking will not hurt performance that much since the       disambiguation takes place on the next input token.              ./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