Last update: Thu Jun 20 02:00:37 MDT 2019
@Article{Barnard:1992:CPP,
author = "D. T. Barnard and D. B. Skillicorn",
title = "Context-free parsing on {$O(n)$} processors",
journal = j-COMP-LANGS,
volume = "17",
number = "1",
pages = "61--66",
month = "????",
year = "1992",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Queen's Univ",
affiliationaddress = "Kingston, Ont, Can",
classcodes = "C6150C (Compilers, interpreters and other processors);
C4210 (Formal logic); C4240 (Programming and algorithm
theory); C6110P (Parallel programming)",
classification = "722; 723",
corpsource = "Dept. of Comput. and Inf. Sci., Queen's Univ.,
Kingston, Ont., Canada",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Cocke-Younger-Kasami; Cocke-Younger-Kasami (CYK)
Algorithm; compilers; Computer Programming ---
Algorithms; Computer Systems, Digital; context free
languages; context-free grammars; CYK algorithm;
massively parallel algorithms; Multiprocessing;
multiprocessors; Natural Language Recognition;
parallel; parallel algorithms; parallel parsing;
program compilers; programming; Syntactic Pattern
Recognition",
treatment = "P Practical",
}