DocumentCode
3325803
Title
Detection of parallelism in a computer program by grammatical means
Author
Abdollahzadeh, F. ; Badii, M.
Author_Institution
Dept. of Comput. Sci., Central Connecticut State Univ., New Britain, CT, USA
fYear
1991
fDate
3-5 Apr 1991
Firstpage
362
Abstract
A context sensitive grammar (CSG) is developed which selects the balanced tree most suitable for parallel execution. Also, a new parsing algorithm for this grammar has been considered. The grammar detects parallelism in arithmetic expressions by considering boundaries between subexpressions. The grammar can be extended to include all kinds of associative operators. The algorithm is an extension of LR parser which constructs a balanced binary parse tree to process on parallel machine
Keywords
context-sensitive grammars; parallel programming; arithmetic expressions; associative operators; balanced tree; boundaries; computer program; context sensitive grammar; grammatical means; parallelism detection; parsing algorithm; Binary trees; Computer science; Concurrent computing; Digital arithmetic; Parallel machines; Parallel processing; Production;
fLanguage
English
Publisher
ieee
Conference_Titel
Applied Computing, 1991., [Proceedings of the 1991] Symposium on
Conference_Location
Kansas City, MO
Print_ISBN
0-8186-2136-2
Type
conf
DOI
10.1109/SOAC.1991.143902
Filename
143902
Link To Document