An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.5 pp.973-976
- Publication Date
- 1999/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Sofware System
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
