The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 최적의 코드 생성을 위해 동적 프로그래밍 기법을 사용하여 상향식 트리 패턴 매칭에서 상태를 구성하는 효율적인 방법을 제안합니다. 이 방법은 상태를 구성하는 데 필요한 분석을 미리 계산하여 파생될 수 있습니다. 제안된 방식은 컴파일 타임에 상태를 구성할 때 성과 없는 테스트를 피할 수 있기 때문에 다른 방식보다 더 효율적입니다. 또한, 본 제안에 필요한 관련 분석은 대부분 컴파일-컴파일 시간에 이루어지므로 컴파일 시간에 실제 효율성이 보장됩니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kyung-Woo KANG, Kwang-Moo CHOE, Min-Soo JUNG, "An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 5, pp. 973-976, May 1999, doi: .
Abstract: In this paper, we propose an efficient method of constructing states in bottom-up tree pattern matching with dynamic programming technique for optimal code generation. This method can be derived from precomputing the analysis which is needed for constructing states. The proposed scheme is more efficient than other scheme because we can avoid unfruitful tests in constructing states at compile time. Furthermore, the relevant analyses needed for this proposal are largely achieved at compile-compile time, which secures actual efficiency at compile time.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_5_973/_p
부
@ARTICLE{e82-d_5_973,
author={Kyung-Woo KANG, Kwang-Moo CHOE, Min-Soo JUNG, },
journal={IEICE TRANSACTIONS on Information},
title={An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme},
year={1999},
volume={E82-D},
number={5},
pages={973-976},
abstract={In this paper, we propose an efficient method of constructing states in bottom-up tree pattern matching with dynamic programming technique for optimal code generation. This method can be derived from precomputing the analysis which is needed for constructing states. The proposed scheme is more efficient than other scheme because we can avoid unfruitful tests in constructing states at compile time. Furthermore, the relevant analyses needed for this proposal are largely achieved at compile-compile time, which secures actual efficiency at compile time.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme
T2 - IEICE TRANSACTIONS on Information
SP - 973
EP - 976
AU - Kyung-Woo KANG
AU - Kwang-Moo CHOE
AU - Min-Soo JUNG
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 1999
AB - In this paper, we propose an efficient method of constructing states in bottom-up tree pattern matching with dynamic programming technique for optimal code generation. This method can be derived from precomputing the analysis which is needed for constructing states. The proposed scheme is more efficient than other scheme because we can avoid unfruitful tests in constructing states at compile time. Furthermore, the relevant analyses needed for this proposal are largely achieved at compile-compile time, which secures actual efficiency at compile time.
ER -