efficient computation of lalr(1) look-ahead sets
We define two relations that capture the essential structure of the problem of computing LALR(1) look-ahead sets, and present an efficient algorithm to compute the sets in time linear in the size of the relations. In particular, for a PASCAL grammar, our algorithm performs less than 20\% of the set unions performed by a popular-compiler (YACC).
efficiency computation