### 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 |

### Other

Other | Proc Int Conf Parallel Process 1987 |
---|---|

City | Universal Park, PA, USA |

Period | 8/17/87 → 8/21/87 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*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.

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

*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.

}

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

SP - 585

EP - 588

BT - Proceedings of the International Conference on Parallel Processing

A2 - Sahni, Sartaj K.

PB - Pennsylvania State Univ Press

ER -