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 条
  • [21] Accurate Context-Free Parsing with Combinatory Categorial Grammar
    Fowler, Timothy A. D.
    Penn, Gerald
    ACL 2010: 48TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2010, : 335 - 344
  • [22] Parsing non-recursive context-free grammars
    Nederhof, MJ
    Satta, G
    40TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 2002, : 112 - 119
  • [23] ON THE COMPLEXITY OF PARALLEL PARSING OF GENERAL CONTEXT-FREE LANGUAGES
    RYTTER, W
    THEORETICAL COMPUTER SCIENCE, 1986, 47 (03) : 315 - 321
  • [24] Speeding up parsing of biological context-free grammars
    Fredouille, D
    Bryant, CH
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2005, 3537 : 241 - 256
  • [25] Iterative CKY parsing for probabilistic context-free grammars
    Tsuruoka, Y
    Tsujii, J
    NATURAL LANGUAGE PROCESSING - IJCNLP 2004, 2005, 3248 : 52 - 60
  • [26] Synchronous Context-Free Grammars and Optimal Parsing Strategies
    Gildea, Daniel
    Satta, Giorgio
    COMPUTATIONAL LINGUISTICS, 2016, 42 (02) : 207 - 243
  • [27] AN EFFICIENT CONTEXT-FREE PARSING ALGORITHM WITH SEMANTIC ACTIONS
    PIASTRA, M
    BOLOGNESI, R
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 549 : 271 - 280
  • [28] A parallel parsing algorithm for arbitrary context-free grammars
    Computer Science Department, Yonsei University, Maeji, Heungup, Wonju-city, KangWon, 220-710, Korea, Republic of
    Inf. Process. Lett., 2 (87-96):
  • [29] Time reduction of stochastic parsing with stochastic context-free grammars
    Sánchez, JA
    Benedí, JM
    PATTERN RECOGNITION AND IMAGE ANALYSIS, PT 2, PROCEEDINGS, 2005, 3523 : 163 - 171
  • [30] A DIVIDE-AND-CONQUER APPROACH TO GENERAL CONTEXT-FREE PARSING
    BOSSI, A
    COCCO, N
    COLUSSI, L
    INFORMATION PROCESSING LETTERS, 1983, 16 (04) : 203 - 208
12345