OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES.

Dilip Sarkar; Narsingh Deo

OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A parallel parsing technique is presented in which parentheses are inserted in the string to be parsed for a syntax-directed partitioning. An O(log n)-time parallel parsing algorithm for a class of block-structured context-free languages is presented. The computation model is a concurrent-read, exclusive-write, parallel random-access machine. The digraph of a context-free grammar is used to define minimum subgrammars such that each subgrammar generates a finite language. The strings of these subgrammars are used to determine the number of parentheses to be inserted to the left and right of every terminal in the string to be parsed.

Original language	English (US)
Title of host publication	Proceedings of the International Conference on Parallel Processing
Editors	Sartaj K. Sahni
Publisher	Pennsylvania State Univ Press
Pages	585-588
Number of pages	4
ISBN (Print)	0271006080
State	Published - Dec 1 1987
Externally published	Yes
Event	Proc Int Conf Parallel Process 1987 - Universal Park, PA, USA Duration: Aug 17 1987 → Aug 21 1987

Publication series

Name	Proceedings of the International Conference on Parallel Processing
ISSN (Print)	0190-3918

Other

Other	Proc Int Conf Parallel Process 1987
City	Universal Park, PA, USA
Period	8/17/87 → 8/21/87

ASJC Scopus subject areas

Hardware and Architecture

Cite this

OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES. / Sarkar, Dilip; Deo, Narsingh.

Proceedings of the International Conference on Parallel Processing. ed. / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. p. 585-588 (Proceedings of the International Conference on Parallel Processing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sarkar, D & Deo, N 1987, OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES. in SK Sahni (ed.), Proceedings of the International Conference on Parallel Processing. Proceedings of the International Conference on Parallel Processing, Pennsylvania State Univ Press, pp. 585-588, Proc Int Conf Parallel Process 1987, Universal Park, PA, USA, 8/17/87.

@inproceedings{63744a7ef7e546aca7d9fc1be24384cd,

title = "OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES.",

abstract = "A parallel parsing technique is presented in which parentheses are inserted in the string to be parsed for a syntax-directed partitioning. An O(log n)-time parallel parsing algorithm for a class of block-structured context-free languages is presented. The computation model is a concurrent-read, exclusive-write, parallel random-access machine. The digraph of a context-free grammar is used to define minimum subgrammars such that each subgrammar generates a finite language. The strings of these subgrammars are used to determine the number of parentheses to be inserted to the left and right of every terminal in the string to be parsed.",

author = "Dilip Sarkar and Narsingh Deo",

year = "1987",

month = dec,

day = "1",

language = "English (US)",

isbn = "0271006080",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "Pennsylvania State Univ Press",

pages = "585--588",

editor = "Sahni, {Sartaj K.}",

booktitle = "Proceedings of the International Conference on Parallel Processing",

note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",

}

TY - GEN

T1 - OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES.

AU - Sarkar, Dilip

AU - Deo, Narsingh

PY - 1987/12/1

Y1 - 1987/12/1

N2 - A parallel parsing technique is presented in which parentheses are inserted in the string to be parsed for a syntax-directed partitioning. An O(log n)-time parallel parsing algorithm for a class of block-structured context-free languages is presented. The computation model is a concurrent-read, exclusive-write, parallel random-access machine. The digraph of a context-free grammar is used to define minimum subgrammars such that each subgrammar generates a finite language. The strings of these subgrammars are used to determine the number of parentheses to be inserted to the left and right of every terminal in the string to be parsed.

AB - A parallel parsing technique is presented in which parentheses are inserted in the string to be parsed for a syntax-directed partitioning. An O(log n)-time parallel parsing algorithm for a class of block-structured context-free languages is presented. The computation model is a concurrent-read, exclusive-write, parallel random-access machine. The digraph of a context-free grammar is used to define minimum subgrammars such that each subgrammar generates a finite language. The strings of these subgrammars are used to determine the number of parentheses to be inserted to the left and right of every terminal in the string to be parsed.

UR - http://www.scopus.com/inward/record.url?scp=0023591743&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023591743&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023591743

SN - 0271006080

T3 - Proceedings of the International Conference on Parallel Processing

SP - 585

EP - 588

BT - Proceedings of the International Conference on Parallel Processing

A2 - Sahni, Sartaj K.

PB - Pennsylvania State Univ Press

T2 - Proc Int Conf Parallel Process 1987

Y2 - 17 August 1987 through 21 August 1987

ER -

OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES.

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this