Automatic generation of a Boyer-Moore type pattern matcher from a naive pattern matcher

スポンサーリンク

概要

• 論文の詳細を見る

• The purpose of this paper is to show that we can generate a Boyer-Moore type pattern matcher without the bad-character heuristic from a naive non-linear backward matcher by GPC. This sort of problem has already been discussed in a literature using off-line partial evaluator. However, to the best of our knowledge, no one has proven that every generated matcher runs in the same way as the BM. Here we will show with the proof that the problem can be solved starting from a simple and naive pattern matcher as a source program.

• 社団法人電子情報通信学会の論文
• 2002-04-18

著者

• Futamura Yoshihiko

  School Of Science And Engineering Waseda University

• Konishi Zenjiro

  Institute For Software Production Technology Waseda University

関連論文

• Recursion Removal and Introduction Using Assignments
• Recursion Removal from Recursive Programs with Only One Descent Function(Fundamentals of Software and Theory of Programs)
• Automatic generation of a Boyer-Moore type pattern matcher from a naive pattern matcher

スポンサーリンク