PARALLEL TREE PATTERN-MATCHING

被引：1

作者：

RAMESH, R ^{[1
]}

RAMAKRISHNAN, IV ^{[1
]}

机构：

[1] SUNY STONY BROOK, DEPT COMP SCI, STONY BROOK, NY 11794 USA

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1990年 / 9卷 / 04期

关键词：

D O I：

10.1016/S0747-7171(08)80023-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model. © 1990, Academic Press Limited. All rights reserved.

引用

页码：485 / 501

页数：17

共 22 条

[1]

AHO AV, 1984, 11TH P ACM S PRINC P, P334

[2]

BERKMAN O, 1989, 21ST P ANN ACM S THE, P309

[3] PARALLEL EVALUATION OF GENERAL ARITHMETIC EXPRESSIONS [J].

BRENT, RP .

JOURNAL OF THE ACM, 1974, 21 (02) :201-206

[4]

COLE R, 1988, LECT NOTES COMPUT SC, V319, P91

[5]

COLE R, 1986, 18TH P ANN ACM S THE, P206

[6]

COLLINS GE, 1971, 2ND P S SYMB ALG MAN, P144

[7]

DWORK C, 1986, 8TH C AUT DED

[8]

GALIL Z, 1985, OPTIMAL PARALLEL ALG, V67, P144

[9] ABSTRACT DATA TYPES AND SOFTWARE VALIDATION [J].

GUTTAG, JV ;

HOROWITZ, E ;

MUSSER, DR .

COMMUNICATIONS OF THE ACM, 1978, 21 (12) :1048-1064

[10] PATTERN-MATCHING IN TREES [J].

HOFFMANN, CM ;

ODONNELL, MJ .

JOURNAL OF THE ACM, 1982, 29 (01) :68-95

← 1 2 3 →