On Mon, 2004-09-20 at 06:41, Yutaka OIWA wrote:

> >From the computer room at ICFP2004 in Snowbird Resort,
> I announce a beta version of my combinator-based
> regular-expression match library which supports
> list (Kleene-*) binding.

> I plan to construct a neat syntax sugar over this library 
> and build a next-generation version of Regexp/OCaml library.
> Any comments are welcome.

Can you explain why/how Pcre is being used?

I'm currently looking at providing the same kind
of facility, however I need: 

(a) all pure Ocaml -- reason: maintenance, soundness

(b) able to generate fairly simple automata
Reason-- the execution target may be C,
so it must be possible to both encode the data
fairly simply, and also to provide C routines
to execute various automata based on that data,
without building complex data structures.

(c) must process at least a stream of integer inputs
Reason: 8 bit inputs are unacceptable for i18n reasons.
In addition, there are uses of state machines other
than processing 'strings'.

I'd like to combine at least (i) tokenisation 
and (ii) substring extraction however a more general
facility such as parsing as in C/XDuce is also appealing.
Alternatively, or as well, processing tagged NFA's 
readily yields RTNs and hence CFG parsing support.

-- 
John Skaller, mailto:skaller@users.sf.net
voice: 061-2-9660-0850, 
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net



-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners