A New Computing Method of FIRST and FOLLOW Sets

摘要

First and Follow functions associated with a grammar G is important when conducting LL and LR (SLR, LR (1), LALR) parser, because the setting up of parsing table is aided by them. For the larger scale grammar, computing First and Follow sets by hand according to the definition brings not only huge intolerable workload but also mistakes, even if adopting automated tools it will cost more time. In order to solve this problem, based on the parallel algorithm already existing, a new method of computing First and Follow sets was brought forward in this paper. This method can not only improve computing efficiency but also avoid errors, and it has both the theoretical and realistic significance for parallel compiler processing.