Fw: Re: [Caml-list] Module/Functor modelisation

["Johan Baltié" <johan.baltie@wanadoo.fr>]

Uh..
My code was not caml compliant :)
But no that's not my main problem.

I thing i cannot go without giving my real code:

Here is it: 

--------

module type Visitor =
sig
 type output

 val behavior : behavior -> output -> output
 val pattern_action : pattern_action -> output -> output
 val pattern : pattern -> output -> output
 val action : action -> output -> output
 val ident_regex : ident_regex -> output -> output
 val message :  message -> output -> output
 val message_body: message_body -> output -> output
 val declaration :  declaration -> output -> output
 val types : types -> output -> output
 val ident : ident -> output -> output
 val expression : expression -> output -> output
 val litteral : litteral -> output -> output
end

(* Traverser type *)
module type Traverse =
 functor (Av : Visitor) ->
sig
 val behavior : behavior -> Av.output -> Av.output
 val pattern_action : pattern_action -> Av.output -> Av.output
 val pattern : pattern -> Av.output -> Av.output
 val action : action -> Av.output -> Av.output
 val ident_regex : ident_regex -> Av.output -> Av.output
 val message :  message -> Av.output -> Av.output
 val message_body: message_body -> Av.output -> Av.output
 val declaration :  declaration -> Av.output -> Av.output
 val types : types -> Av.output -> Av.output
 val ident : ident -> Av.output -> Av.output
 val expression : expression -> Av.output -> Av.output
 val litteral : litteral -> Av.output -> Av.output
end

(* Traverser implementation *)
module PrefixTraverse =
 functor (Av : Visitor) ->
struct

 let ident i data =
  Av.ident i data

 let rec types t data =
  let output = Av.types t data
  in
   match t with
    | SimpleType(id) ->
       ident id output
    | TypesList(t1, t2) ->
       types t2 (types t1 output)

 let rec ident_regex i data =
  let output = Av.ident_regex i data
  in
   match i with
    | Underscore -> 
       output
    | Ident(id) ->
       ident id output
    | IdentRegexList(id1, id2) ->
       ident_regex id2 (ident_regex id1 output)

 let rec declaration d data =
  let output = Av.declaration d data
  in
   match d with
    | DeclarationConstant(l) ->
       litteral l output
    | DeclarationVariable(t, id) ->
       ident_regex id (types t output)
    | DeclarationList(d1, d2) ->
       declaration d2 (declaration d1 output)

 and pattern p data =
  let output = Av.pattern p data
  and (id1, id2, decl) = p
  in
   declaration decl (ident_regex id2 (ident_regex id1 output))

 and  message m data =
  let output = Av.message m data
  in
   match m with
    | UnansweredMessage(mb) ->
       message_body mb output
    | AnsweredMessage(mb, id) ->
       ident id (message_body mb output)
    | MessageList (m1, m2) ->
       message m2 (message m1 output)

 and message_body m data =
  let output = Av.message_body m data
  in
   match m with
    | NamedMessage(id, e) ->
       expression e (ident id output)
    | AnonymousMessage(e) ->
       expression e output

 and litteral l data =
  let output = Av.litteral l data
  in
   match l with
    | Message(m) ->
       message m output
    | _ ->
       output

 and expression e data =
  let output = Av.expression e data
  in
   match e with
    | ExpressionConstant(l) ->
       litteral l output
    | ExpressionVariable(i) ->
       ident i output
    | ExpressionList(e1, e2) ->
       expression e2 (expression e1 output)

 let action a data =
  let output = Av.action a data
  and (m, e) = a
  in
   expression e (message m output)

 let rec pattern_action p data =
  let output = Av.pattern_action p data
  in 
   match p with
    | PatternAction(pat, act) ->
       action act (pattern pat output)
    | PatternActionList(pa1, pa2) ->
       pattern_action pa2 (pattern_action pa1 output)

 let behavior b data =
  let output = Av.behavior b data
  in
   match b with
    | InheritedBehavior(name, inherited, pas) ->
       pattern_action pas (ident inherited (ident name output))
    | RootedBehavior(name, pas) ->
       pattern_action pas (ident name output)
       
end

(* Traverser implementation *)
module PostfixTraverse =
 functor (Av : Visitor) ->
struct

 let ident i data =
  Av.ident i data

 let rec types t data =
  let output =
   match t with
    | SimpleType(id) ->
       ident id data
    | TypesList(t1, t2) ->
       types t2 (types t1 data)
  in
   Av.types t output

 let rec ident_regex i data =
  let output = 
   match i with
    | Underscore -> 
       data
    | Ident(id) ->
       ident id data
    | IdentRegexList(id1, id2) ->
       ident_regex id2 (ident_regex id1 data)
  in
   Av.ident_regex i output

 let rec declaration d data =
  let output = Av.declaration d data
  in
   match d with
    | DeclarationConstant(l) ->
       litteral l output
    | DeclarationVariable(t, id) ->
       ident_regex id (types t output)
    | DeclarationList(d1, d2) ->
       declaration d2 (declaration d1 output)

 and pattern p data =
  let output = Av.pattern p data
  and (id1, id2, decl) = p
  in
   declaration decl (ident_regex id2 (ident_regex id1 output))

 and  message m data =
  let output = Av.message m data
  in
   match m with
    | UnansweredMessage(mb) ->
       message_body mb output
    | AnsweredMessage(mb, id) ->
       ident id (message_body mb output)
    | MessageList (m1, m2) ->
       message m2 (message m1 output)

 and message_body m data =
  let output = Av.message_body m data
  in
   match m with
    | NamedMessage(id, e) ->
       expression e (ident id output)
    | AnonymousMessage(e) ->
       expression e output

 and litteral l data =
  let output = Av.litteral l data
  in
   match l with
    | Message(m) ->
       message m output
    | _ ->
       output

 and expression e data =
  let output = Av.expression e data
  in
   match e with
    | ExpressionConstant(l) ->
       litteral l output
    | ExpressionVariable(i) ->
       ident i output
    | ExpressionList(e1, e2) ->
       expression e2 (expression e1 output)

 let action a data =
  let output = Av.action a data
  and (m, e) = a
  in
   expression e (message m output)

 let rec pattern_action p data =
  let output = Av.pattern_action p data
  in 
   match p with
    | PatternAction(pat, act) ->
       action act (pattern pat output)
    | PatternActionList(pa1, pa2) ->
       pattern_action pa2 (pattern_action pa1 output)

 let behavior b data =
  let output = Av.behavior b data
  in
   match b with
    | InheritedBehavior(name, inherited, pas) ->
       pattern_action pas (ident inherited (ident name output))
    | RootedBehavior(name, pas) ->
       pattern_action pas (ident name output)
       
end

--------

As I said, my problem is that I'm doing the same job once in a prefix way and
once in a postfix way.
In pattern_action i'd like to have:

"match p with
    | PatternAction(pat, act) ->
       action act (pattern pat output)
    | PatternActionList(pa1, pa2) ->
       pattern_action pa2 (pattern_action pa1 output)"

Factorized from Prefix and Postfix.

Does it enlight my dark explanation ?

> On Wed, Aug 14, 2002 at 08:07:53AM +0100, Johan Baltié wrote:
> > Hi !
> > 
> > I have a simple functor:
> > [..]
> 
> 	I do not know if I have understood your problem but try
> something like that:
> 
>  module type Used =
>  sig
>   type output
> 
>   val toto : int -> output -> output
>   val tutu : float -> output -> output
>  end
> 
>  module type User =
>   functor (U : Used) ->
>  sig
> 
>   val toto : int -> U.output -> U.output
>   val tutu : float -> U.output -> U.output
>  end
> 
>   module User1: User =
>     functor (U : Used) ->
>   struct
>     let rec toto i output =
>       let v = U.tutu 12.0 output
>       in
>        tutu 12.0 v
>      and tutu d output =
>         if (d = 11.0) then
>            output
>         else
>            tutu (d -. 1.0) (U.toto 1 output)
>   end
> 
>   module User2: User =
>     functor (U : Used) ->
>   struct
>     let rec toto i output =
>       let v = tutu 12.0 output
>       in
>        U.tutu 12.0 v
>      and tutu d output =
>         if (d = 11.0) then
>            output
>         else
>            let v = tutu (d -. 1.0) output
>             in
>                 U.toto 1 v
>   end
> 
> -- 
> Yann Régis-Gianas.

Ciao

Jo
------- End of Forwarded Message -------


Ciao

Jo
-------------------
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