COMPILING PATTERN-MATCHING BY TERM DECOMPOSITION

被引：3

作者：

PUEL, L ^{[1
]}

SUAREZ, A ^{[1
]}

机构：

[1] DIGITAL PRL,F-92563 RUEIL MALMAISON,FRANCE

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1993年 / 15卷 / 01期

关键词：

D O I：

10.1006/jsco.1993.1001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We present method for compiling pattern matching on lazy languages based on previous work by Laville, Huet and Lévy. It consists of coding ambiguous linear sets of patterns using “Term Decomposition,” and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied to strict language giving a match algorithm that include only unavoidable tests when such as algorithm exists. © 1993 Academic Press. All rights reserved.

引用

页码：1 / 26

页数：26

共 50 条

[1] COMPILING PATTERN-MATCHING
AUGUSTSSON, L
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 201 : 368 - 381
[2] ALGORITHMS FOR PATTERN-MATCHING
DAVIES, G
BOWSHER, S
SOFTWARE-PRACTICE & EXPERIENCE, 1986, 16 (06): : 575 - 601
[3] PATTERN-MATCHING IN TREES
HOFFMANN, CM
ODONNELL, MJ
JOURNAL OF THE ACM, 1982, 29 (01) : 68 - 95
[4] APPROXIMATE PATTERN-MATCHING
MANBER, U
WU, S
BYTE, 1992, 17 (12): : 281 - +
[5] ADAPTIVE PATTERN-MATCHING
SEKAR, RC
RAMESH, R
RAMAKRISHNAN, IV
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 247 - 260
[6] FUZZY PATTERN-MATCHING
CAYROL, M
FARRENY, H
PRADE, H
KYBERNETES, 1982, 11 (02) : 103 - 116
[7] ADAPTIVE PATTERN-MATCHING
SEKAR, RC
RAMESH, R
RAMAKRISHNAN, IV
SIAM JOURNAL ON COMPUTING, 1995, 24 (06) : 1207 - 1234
[8] A PATTERN-MATCHING SYSTEM
SOMMERVILLE, I
SOFTWARE-PRACTICE & EXPERIENCE, 1982, 12 (06): : 517 - 530
[9] Pattern-matching algorithms based on term rewrite systems
Katoen, JP
Nymeyer, A
THEORETICAL COMPUTER SCIENCE, 2000, 238 (1-2) : 439 - 464
[10] COMPARISON OF PRIORITY RULES IN PATTERN-MATCHING AND TERM REWRITING
LAVILLE, A
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 11 (04) : 321 - 347

← 1 2 3 4 5 →