CONTEXT-FREE PARSING ON O(N) PROCESSORS

被引：1
|
作者：
BARNARD, DT
SKILLICORN, DB
机构：
[1] Department of Computing and Information Science, Queen's University, Kingston
来源：
COMPUTER LANGUAGES | 1992年 / 17卷 / 01期
关键词：
PARALLEL PARSING; COCKE-YOUNGER-KASAMI ALGORITHM; NATURAL LANGUAGE RECOGNITION; SYNTACTIC; PATTERN RECOGNITION; CONTEXT FREE LANGUAGES;
D O I：
10.1016/0096-0551(92)90022-F
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The growing availability of multiprocessors makes it interesting to treat compilation itself as an algorithm to be parallelized. One approach is to allocate a processor to each symbol or token of the source program and find massively parallel algorithms for the various phases of compilation. The well-known Cocke-Younger-Kasami (CYK) algorithm for parsing context free languages runs in O(n3) time on a uniprocessor. The CYK algorithm can be adapted to run on O(n) processors in O(n2) time. The number of processors in the present generation of multiprocessors makes this a reasonable practical approach.
引用
收藏
页码：61 / 66
页数：6
相关论文
共 50 条
12345