Return-Path: Delivered-To: apmail-jakarta-regexp-dev-archive@jakarta.apache.org Received: (qmail 30864 invoked by uid 500); 20 Mar 2001 22:41:08 -0000 Mailing-List: contact regexp-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk Reply-To: regexp-dev@jakarta.apache.org list-help: list-unsubscribe: list-post: Delivered-To: mailing list regexp-dev@jakarta.apache.org Delivered-To: moderator for regexp-dev@jakarta.apache.org Received: (qmail 96845 invoked from network); 20 Mar 2001 21:20:51 -0000 From: "Michael McCallum" To: regexp-dev@jakarta.apache.org Date: Wed, 21 Mar 2001 09:20:02 +1200 MIME-Version: 1.0 Content-type: text/plain; charset=US-ASCII Content-transfer-encoding: 7BIT Subject: [Proposal] OO approach to the regexp. Reply-to: michael@spinsoftware.com Message-ID: <3AB87242.12417.D5BB8FC@localhost> Priority: normal In-reply-to: <2149A0BABC77D311AF890090274E00B27D4BA2@salex005.dsto.defence.gov.au> X-mailer: Pegasus Mail for Win32 (v3.12c) X-Spam-Rating: h31.sny.collab.net 1.6.2 0/1000/N Sorry am a bit quiet at the moment. Having to work long hours at the moment. should be back into it 2nd week april. The code of the RE stuff seems to procedural for my tastes. I propose a more OO approach. So instead of having a program that is made of an array of character nodes use java objects instead. This allows for one to instantiate re compilers/matchers from a factory with varying functionality. Im not sure what the overhead would be like but I am thinking that most of it would be in the compiling. Plus is will probably be a little larger. But on the whole the re programs are not very large. Any comments.