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 条
  • [31] Parsing local internal contextual languages with context-free choice
    Gramatovici, R
    Manea, F
    FUNDAMENTA INFORMATICAE, 2005, 64 (1-4) : 171 - 183
  • [32] Synchronous context-free grammars and optimal linear parsing strategies
    Crescenzi, Pierluigi
    Gildea, Daniel
    Marino, Andrea
    Rossi, Gianluca
    Satta, Giorgio
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (07) : 1333 - 1356
  • [33] MICROCOMPUTERS IN LINGUISTIC DATA-PROCESSING - CONTEXT-FREE PARSING
    KLENK, U
    MICROPROCESSING AND MICROPROGRAMMING, 1982, 9 (05): : 281 - 284
  • [34] Efficient parallel and incremental parsing of practical context-free languages
    Bernardy, Jean-Philippe
    Claessen, Koen
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2015, 25
  • [35] On the relation between context-free grammars and parsing expression grammars
    Mascarenhas, Fabio
    Medeiros, Sergio
    Ierusalimschy, Roberto
    SCIENCE OF COMPUTER PROGRAMMING, 2014, 89 : 235 - 250
  • [36] Left-to-right parsing and bilexical context-free grammars
    Nederhof, MJ
    Satta, G
    6TH APPLIED NATURAL LANGUAGE PROCESSING CONFERENCE/1ST MEETING OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE AND PROCEEDINGS OF THE ANLP-NAACL 2000 STUDENT RESEARCH WORKSHOP, 2000, : A272 - A279
  • [37] PARCE - AN OBJECT-ORIENTED APPROACH TO CONTEXT-FREE PARSING
    ALPERT, SR
    ROSSON, MB
    COMPUTING SYSTEMS, 1992, 7 (02): : 136 - 144
  • [38] An FPGA-based coprocessor for the parsing of context-free grammars
    Ciressan, C
    Sanchez, E
    Rajman, M
    Chappelier, JC
    2000 IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2000, : 236 - 245
  • [39] A UNIVERSAL RECOGNIZING-PARSING ALGORITHM FOR CONTEXT-FREE LANGUAGES
    RICHARDS, TJ
    JOURNAL OF SYMBOLIC LOGIC, 1981, 46 (02) : 424 - 424
  • [40] BIDIRECTIONAL CONTEXT-FREE GRAMMAR PARSING NATURAL-LANGUAGE PROCESSING
    SATTA, G
    STOCK, O
    ARTIFICIAL INTELLIGENCE, 1994, 69 (1-2) : 123 - 164
12345