Associative Parallel Lexing

Abstract

This paper presents near constant time associative parallel lexing (APL) algorithms. The best tame complexity thus far claimed on parallel lexing is O(1ogn) (n denotes the number of input characters) for the parallel prefix lexing (PPL) algorithm. The linear state recording step in the PPL algorithm, which needs t o be done only once for each grammar, has… (More)
DOI: 10.1109/IPPS.1992.223001

Topics

4 Figures and Tables