- (fun acc_tr (ts, tr) ->
- let pos =
- if ts == TagSet.star then Tree.element_tags tree
- else if ts == TagSet.any then Tree.node_tags tree
- else TagSet.positive ts
- in
- let _, _, m, f = Transition.node tr in
- let ls, rs = Formula.st f in
- if Ptset.Int.is_empty pos then acc_tr
- else
- (TagSet.inj_positive pos, (ls, rs, m))::acc_tr
- )
- states
- []
+ (fun acc_tr (ts, tr) ->
+ let pos =
+ if ts == TagSet.star then Tree.element_tags tree
+ else if ts == TagSet.any then Tree.node_tags tree
+ else TagSet.positive ts
+ in
+ let _, _, m, f = Transition.node tr in
+ let ls, rs = Formula.st f in
+ if Ptset.Int.is_empty pos then acc_tr
+ else
+ (TagSet.inj_positive pos, (ls, rs, m))::acc_tr
+ )
+ states
+ []