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

Dilip Sarkar, Narsingh Deo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsSartaj K. Sahni
PublisherPennsylvania State Univ Press
Pages585-588
Number of pages4
ISBN (Print)0271006080
StatePublished - Dec 1 1987
Externally publishedYes
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: Aug 17 1987Aug 21 1987

Other

OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA
Period8/17/878/21/87

Fingerprint

Context free languages
Context free grammars
Parallel algorithms

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Sarkar, D., & Deo, N. (1987). OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES. In S. K. Sahni (Ed.), Proceedings of the International Conference on Parallel Processing (pp. 585-588). Pennsylvania State Univ Press.

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.

Research output: Chapter in Book/Report/Conference proceedingConference 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. Pennsylvania State Univ Press, pp. 585-588, Proc Int Conf Parallel Process 1987, Universal Park, PA, USA, 8/17/87.
Sarkar D, Deo N. OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES. In Sahni SK, editor, Proceedings of the International Conference on Parallel Processing. Pennsylvania State Univ Press. 1987. p. 585-588
Sarkar, Dilip ; Deo, Narsingh. / OPTIMAL PARALLEL PARSING ALGORITHM FOR A CLASS OF BLOCK-STRUCTURED LANGUAGES. Proceedings of the International Conference on Parallel Processing. editor / Sartaj K. Sahni. Pennsylvania State Univ Press, 1987. pp. 585-588
@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 = "12",
day = "1",
language = "English (US)",
isbn = "0271006080",
pages = "585--588",
editor = "Sahni, {Sartaj K.}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",

}

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

SN - 0271006080

SP - 585

EP - 588

BT - Proceedings of the International Conference on Parallel Processing

A2 - Sahni, Sartaj K.

PB - Pennsylvania State Univ Press

ER -