Srikant, YN and Shankar, Priti (1987) Parallel parsing of programming languages. In: Information Sciences, 43 (1-2). pp. 55-83.Full text not available from this repository. (Request a copy)
A new method of specifying the syntax of programming languages, known as hierarchical language specifications (HLS), is proposed. Efficient parallel algorithms for parsing languages generated by HLS are presented. These algorithms run on an exclusive-read exclusive-write parallel random-access machine. They require O(n) processors and O(log2n) time, where n is the length of the string to be parsed. The most important feature of these algorithms is that they do not use a stack.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier Science.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||12 Jan 2010 09:35|
|Last Modified:||12 Jan 2010 09:35|
Actions (login required)