* [Caml-list] tree automata
@ 2004-04-10 23:51 skaller
0 siblings, 0 replies; only message in thread
From: skaller @ 2004-04-10 23:51 UTC (permalink / raw)
To: caml-list
I just ran across the need to pattern match a list against:
P1 :: P2 * :: P3
where P2* means "any number of occurences of P2".
It happens in this case I want to forget P2*.
I can do this with
P1 :: tail when f(tail)
for suitable f, however I'm wondering if XDuce
would handle this.. and if the tree automata technology
would fit into Ocaml.
--
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
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2004-04-10 23:51 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2004-04-10 23:51 [Caml-list] tree automata skaller
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).