home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.compilers      Compiler construction, theory, etc. (Mod      2,753 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 2,542 of 2,753   
   carlglassberg@gmail.com to All   
   Re: A minimal LL(1) parser generator ?   
   23 Jan 20 02:41:24   
   
   Anton, I now see that, in Gray, the precedence of "&&" is higher than every   
   other operator.   
      
   So Gray EBNF:   
   a b && c d && e f && <- x   
      
   is equivalent to Wirth EBNF:   
      
   x = a { b a } c { d c } e { f e } .   
      
   Likewise:   
      
   a b && ? <- x   
      
   is   
   x = [ a { b a } ] .   
      
   Carl   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca