Since the invention of LALR(1)-grammars by DeRemer[5], LALR grammar analysis and parsing techniques have been popular in compiler construction. Most of the parser generating systems, or compiler-compilers produce LALR(1) parsing table. In general LALR(1) parsing table, computation of LALR(1)-Lookahead sets are the most significant and hard work, so a number of algorithms has been presented for efficient computation of LALR(1)-Lookahead sets. Recently the efficiency in computation of LALR(1)-Lookahead sets are in controversy between J.C. H Park, K.M. Choe[17] and F. Ives[10],[11].
In this thesis, above two methods in LALR(1)-Lookahead set computation are analyzed and compared. Using KAIST Parser Generating System(KPGS), which methods are implemented, so the experimental results could be presented.
