Dec 062017
 
These routines perform fast searches for strings, using the Boyer-Moore-Gosper algorithm. Full C source code.
File BMGSUBS.ZIP from The Programmer’s Corner in
Category C Source Code
These routines perform fast searches for strings, using the Boyer-Moore-Gosper algorithm. Full C source code.
File Name File Size Zip Size Zip Type
BMGSUBS.3L 3185 1346 deflated
BMGSUBS.C 8235 2832 deflated
BMGSUBS.DOC 3631 1372 deflated
BMGTEST.C 1696 788 deflated
BMGTEST2.C 2016 906 deflated
MAKEFILE 423 239 deflated
README 1022 584 deflated

Download File BMGSUBS.ZIP Here

Contents of the README file


Here are routines to perform fast string searches using the
Boyer-Moore-Gosper algorithm; they can be used in any Unix program (and
should be portable to non-Unix systems). You can search either a file
or a buffer in memory.

The code is mostly due to James A. Woods ([email protected])
although I have modified it heavily, so all bugs are my fault. The
original code is from his sped-up version of egrep, recently posted on
mod.sources and available via anonymous FTP from ames-aurora.arpa as
pub/egrep.one and pub/egrep.two. That code handles regular
expressions; mine does not.

The files included here are
READMEThis file
MakefileCan be modified for 4.xBSD or Sys V compilation
bmgsubs.3lManual page
bmgsubs.cThe search code
bmgtest.cTest program (example of file searching)
bmgtest2.cAnother test program, showing buffer searching

These have only been tested on 4.2BSD Vax systems.

-Jeff Mogul
[email protected]
decwrl!glacier!navajo!mogul


 December 6, 2017  Add comments

Leave a Reply