Ambiguities from Special-Case Productions

"Evangelos Drikos" <drikosv@otenet.gr>
14 Sep 2005 21:17:53 -0400

          From comp.compilers

Related articles
Ambiguities from Special-Case Productions drikosv@otenet.gr (Evangelos Drikos) (2005-09-14)
Re: Ambiguities from Special-Case Productions cleos@nb.sympatico-dot-ca.remove (Cleo Saulnier) (2005-09-15)
Re: Ambiguities from Special-Case Productions boldyrev@cgitftp.uiggm.nsc.ru (Ivan Boldyrev) (2005-09-17)
Re: Ambiguities from Special-Case Productions DrDiettrich@compuserve.de (Hans-Peter Diettrich) (2005-09-17)
Re: Ambiguities from Special-Case Productions drikosv@otenet.gr (Evangelos Drikos) (2005-09-22)
| List of all articles for this month |

From: "Evangelos Drikos" <drikosv@otenet.gr>
Newsgroups: comp.compilers
Date: 14 Sep 2005 21:17:53 -0400
Organization: An OTEnet S.A. customer
Keywords: parse, question

Hi all,


I need some help to figure out which parsers can process grammars like the
one below.


I found this grammar in a popular compilers book (Ambiguities from
Special-Case Productions):




E -> E sub E sup E


E -> E sub E


E -> E sup E


E -> { E }


E -> c




I think according to this grammar the string "c sub c sup c" has three
interpretations (3 parse trees).


Which GLR Parser should I select to take all the correct interpretations of
such a string?


Any references of how such ambiguities are handled in a GLR or is it a
simple & usual case for such a parser?


Thanks in advance,
Ev. Drikos


Post a followup to this message

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