Xref: utzoo comp.lang.c:29166 comp.lang.c++:7812 comp.object:1259 comp.sources.wanted:11899
Path: utzoo!attcan!uunet!cs.dal.ca!aucs!880716a
From: 880716a@aucs.uucp (Dave Astels)
Newsgroups: comp.lang.c,comp.lang.c++,comp.object,comp.sources.wanted
Subject: Pattern matching
Message-ID: <1990May29.001918.21545@aucs.uucp>
Date: 29 May 90 00:19:18 GMT
Organization: Acadia University - School of Computer Science
Lines: 24

I am about to start developing pattern matching software using C++.
I have done something similar to what I plan a while ago using LISP. I
would like an algorithm that would be more efficient than the heavily
recursive LISP implementation.  It is to be used in a real-time situation,
to analyse user input.

Input is seen as a list of strings, each being one word.  The patterns are
lists of either strings (requiring a literal match) or sub-lists (commands).
Commands include:
	match any word (0 or one occurance)
	match any words (0 or more) and (1 or more)
	match the 3 cases above, but to match, input must be in a specified list.
	etc.

I would like any information, including pointers to references.
Example code would be appreciated as well.



-- 
- Dave

Internet: 880716a@AcadiaU.CA
Bitnet:   880716a@Acadia