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 770 of 2,753   
   Yasmina to All   
   Re: Efficient construction of LALR Parsi   
   19 Aug 06 01:32:30   
   
   From: yasmina.andreu@gmail.com   
      
   > " Reduction by A -> e is called for on input a if and only if there is   
   > a kernel item [B -> g · Cd, b] such that C => An for some n, and a is   
   > in FIRST(ndb). The set of nonterminals A such that C => An can be   
   > precomputed for each nonterminal C."   
   >   
   > "We shift on input a if there is a kernel item [B -> g · Cd, b]  where   
   > C => ax in a derivation in which the last step does not use an   
   > e-production. The set of such a's can also be precomputed for each C"   
   >   
   > (Note. "e" means the empty string and "=>" means a rightmost derives in   
   > zero or more steps,)   
      
   Is the set of nonterminals A such that C => An equal if  '=>' means a   
   rightmost derives in zero or more steps or if '=>' means a leftmost   
   derives in zero or more steps??   
      
   (sorry, my english is very bad)   
      
   --- 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