From: gene.ressler@gmail.com   
      
   On Jun 1, 5:47 pm, Matthias-Christian Ott  wrote:   
   > Hi,   
   >   
   > it is generally not decidable whether a context-free language is   
   > deterministic. That means it is not decidable whether a grammar is an   
   > LR(k) grammar.   
      
   The last sentence here is problematic. This actually means that if you   
   have a non-LR(k) grammar for a language (which after all is just a set   
   of strings), the question of whether a LR(k) grammar exists for the   
   same language is undecidable.  As you imply later in your note, if you   
   already have a LR(k) grammar, then you have a trivially decidable   
   instance, but the general problem remains unsolvable.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)