An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 1999-05-25

著者

• Choe Kwang-moo

  Faculty Of The Department Of Computer Science Korea Advanced Institute Of Science And Technology

• Kang Kyung-woo

  Supercomputer Center Electronic & Telecommunications Research Institute

• JUNG Min

  Faculty of the Department of Computer Engineering, KyungNam University

• Jung Min

  Faculty Of The Department Of Computer Engineering Kyungnam University

関連論文

• An Analysis for Fast Construction of States in the Bottom-Up Tree Pattern Matching Scheme

スポンサーリンク