From: reznikmm@front.ru   
      
   Hi, all   
      
   I'm playing with GLR and have a question.   
      
   When GLR parser reduces some text to the same non-terminal in two or   
   more ways it merges parse subtrees. Rekers uses 'symbol nodes' for this.   
      
   I this not each non-terminal could cause a merge. Knowing in advance   
   what non-terminals never merge will greatly simplify parse tree   
   construction.   
      
   For instance in Elkhound Technical Report the author implemented C++   
   grammar for GLR parser. He describes it:   
      
       The grammar currently has 37 shift/reduce conflicts, 47   
   reduce/reduce conflicts and 8 ambiguous nonterminal.   
      
   How can I separate ambiguous and unambiguous nonterminal for a given   
   CFG? Where can I read about this?   
      
      
   Thank you   
   --   
   Maxim Reznik   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)