[Oberon] Re (2): Detecting whether a Text is a module source.
John R. Strohm
strohm at airmail.net
Sun Jan 29 19:26:31 CET 2017
Boyer-Moore string search algorithm?
--- peter at easthope.ca wrote:
From: <peter at easthope.ca>, Bob Walkden <bob at web-options.com>
To: <oberon at lists.inf.ethz.ch>
Subject: [Oberon] Re (2): Detecting whether a Text is a module source.
Date: Sun, 29 Jan 2017 16:10:59 +0000
> According to the EBNF for O7, the smallest legal module ...
OK, thanks. Will keep in mind for later. For now I'm concerned only
with detecting the presence of a word in a text; not with conformity
to a syntax.
What is efficient code to find whether the word "Jaguar" is present
in a text for example? There are many ways of varying efficiency. A
compiler must have a solution but I'm unlikely to recognize it. Can
anyone give a code example or direct me to one?
Thanks, ... Lyall E.
More information about the Oberon
mailing list