Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] tree automata
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: skaller <skaller@u...>
Subject: [Caml-list] tree automata
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