论文信息 - Parallel parsing of programming languages

Parallel parsing of programming languages

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.

Priti Shankar | Y. N. Srikant

[1] Sartaj Sahni,et al. Binary Trees and Parallel Scheduling Algorithms , 1981, IEEE Transactions on Computers.

[2] John H. Reif,et al. Parallel time O(log N) acceptance of deterministic CFLs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[4] Jean-Pierre Banâtre,et al. A Multiprocessing Approach to Compile-Time Symbol Resolution , 1981, TOPL.

[5] Wojciech Rytter. On the recognition of context-free languages , 1984, Symposium on Computation Theory.

[6] Priti Shankar,et al. A new parallel algorithm for parsing arithmetic infix expressions , 1987, Parallel Comput..

[7] Charles N. Fischer. On parsing context free languages in parallel environments. , 1975 .

[8] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[9] Franco P. Preparata,et al. New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[10] Jr. Richard Marion Schell. Methods for constructing parallel compilers for use in a multiprocessor environment. , 1979 .

[11] Sartaj Sahni,et al. Parallel Generation of Postfix and Tree Forms , 1983, TOPL.

[12] Uzi Vishkin,et al. Optimal parallel generation of a computation tree form , 1985, TOPL.