Re: shift/reduce problem

Chariton Karamitas <chakaram@auth.gr>
Sun, 05 Dec 2010 17:15:35 +0200

          From comp.compilers
Related articles
shift/reduce problem csnews77@gmail.com (JohnSmith) (2010-12-02)
Re: shift/reduce problem haberg-news@telia.com (Hans Aberg) (2010-12-03)
Re: shift/reduce problem csnews77@gmail.com (JohnSmith) (2010-12-03)
Re: shift/reduce problem haberg-news@telia.com (Hans Aberg) (2010-12-03)
Re: shift/reduce problem gene.ressler@gmail.com (Gene) (2010-12-03)
Re: shift/reduce problem chakaram@auth.gr (Chariton Karamitas) (2010-12-05)
Re: shift/reduce problem seimarao@gmail.com (Seima) (2010-12-30)
Re: shift/reduce problem kaz@kylheku.com (Kaz Kylheku) (2011-10-20)
| List of all articles for this month |
From: Chariton Karamitas <chakaram@auth.gr>
Newsgroups: comp.compilers
Date: Sun, 05 Dec 2010 17:15:35 +0200
Organization: Compilers Central
References: 10-12-004
Keywords: parse
Posted-Date: 05 Dec 2010 12:22:04 EST

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

Post a followup to this message

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