CODE GENERATION USING TREE MATCHING AND DYNAMIC-PROGRAMMING

被引：113

作者：

AHO, AV ^{[1
]}

GANAPATHI, M ^{[1
]}

TJIANG, SWK ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1989年 / 11卷 / 04期

关键词：

D O I：

10.1145/69558.75700

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：491 / 516

页数：26

共 46 条

[1]

Aho A. V., 2007, COMPILERS PRINCIPLES

[2] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].

AHO, AV ;

CORASICK, MJ .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340

[3] DETERMINISTIC PARSING OF AMBIGUOUS GRAMMARS [J].

AHO, AV ;

JOHNSON, SC ;

ULLMAN, JD .

COMMUNICATIONS OF THE ACM, 1975, 18 (08) :441-452

[4] OPTIMAL CODE GENERATION FOR EXPRESSION TREES [J].

AHO, AV ;

JOHNSON, SC .

JOURNAL OF THE ACM, 1976, 23 (03) :488-501

[5] CODE GENERATION FOR EXPRESSIONS WITH COMMON SUB-EXPRESSIONS [J].

AHO, AV ;

JOHNSON, SC ;

ULLMAN, JD .

JOURNAL OF THE ACM, 1977, 24 (01) :146-160

[6]

AHO AV, 1985, 12TH ACM S PRINC PRO, P334

[7]

AHO AV, 1977, 4TH P ACM S PRINC PR, P21

[8]

AIGRAIN P, 1984, ACM SIGPLAN NOTICES, V19, P13

[9]

APPEL AW, 1987, CSTR08087 PRINC U DE

[10] CODE GENERATION FOR A ONE-REGISTER MACHINE [J].

BRUNO, J ;

SETHI, R .

JOURNAL OF THE ACM, 1976, 23 (03) :502-510

← 1 2 3 4 5 →