Grammar needed

Leonardo Teixeira Passos <leonardo@dcc.ufmg.br>
24 Oct 2006 17:35:34 -0400

          From comp.compilers
Related articles
Grammar needed leonardo@dcc.ufmg.br (Leonardo Teixeira Passos) (2006-10-24)
Re: Grammar needed schmitz@i3s.unice.fr (Sylvain Schmitz) (2006-10-26)
Re: Grammar needed 148f3wg02@sneakemail.com (Karsten Nyblad) (2006-10-26)
Re: Grammar needed pjj@cs.man.ac.uk (Pete Jinks) (2006-10-26)
Re: Grammar needed cfc@shell01.TheWorld.com (Chris F Clark) (2006-10-26)
Re: Grammar needed leonardo@dcc.ufmg.br (Leonardo Teixeira Passos) (2006-11-01)
| List of all articles for this month |
From: Leonardo Teixeira Passos <leonardo@dcc.ufmg.br>
Newsgroups: comp.compilers
Date: 24 Oct 2006 17:35:34 -0400
Organization: POP-MG/RNP
Keywords: parse, question
Posted-Date: 24 Oct 2006 17:35:34 EDT

Hi there.


I've been trying to obtain a grammar that meets two properties:


(i) It represents an LR(k) language
(ii) The grammar it self isn't LR(k) for any k, for there is at least
one conflict. One or more of these conflicts does not indicate
ambiguity in the grammar, but can't be solved with any k.


Condition (i) is relatively easy to achieve. However, I can't put (ii) to
work with (i).


Any suggestions?


Post a followup to this message

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