Format.fprintf fmt " @[<hov 0>%a @]" print_list_tr trans in
Format.fprintf fmt "@[<v 0># Queries transitions:@ %a@ @]"
print_box_list asta.trans_q;
- Format.fprintf fmt "@[<v 0># Recognizing transitions:@ %a@ @]"
+ Format.fprintf fmt "@[<v 0># Recognizing transitions:@ %a@]"
print_box_list asta.trans_r in
- Format.fprintf fmt "@[<v 1> ##### ASTA #####@, %a@ @]" print_box 0
+ Format.fprintf fmt "@[<v 1>##### ASTA #####@, %a@ @]@." print_box 0
let to_file out asta = ()
let doc = doc () in
let asta = build_asta query in
let run = compute_run doc asta in
- fprintf err_formatter "@[<v 0>##### Query #####@. %a@]@ "
+ fprintf err_formatter "@[<v 0>##### Query #####@. %a@]\n"
XPath.Ast.print query;
output_string stderr "\n##### Doc #####\n";
Tree.print_xml stderr doc (Tree.root doc);
output_string stderr "\n";
Asta.print err_formatter asta;
- fprintf err_formatter "@[<v 0> ##### Run #####@. %a@]@ "
+ fprintf err_formatter "@[<v 0>##### Run #####@. %a@]\n"
Run.print run;
exit 0
Parse query OK ! Parse Tree OK ! Compil OK ! Run OK !
##### Query #####
/descendant::a[descendant::c[child::e and not descendant::f[not descendant::e]/descendant::g]]/descendant::b[child::g]
+
##### Doc #####
<#document><a>
<b/>
<j> <k/> <l/> <m/> </j>
</a></#document>
- ##### ASTA #####
+##### ASTA #####
# Query states: { q₁ q₂ q₈ q₉ }
# Recognizing states: { q₀ q₃ q₄ q₅ q₆ q₇ }
# Selecting states: { q₁ }
| q₆ ----F(e)---> ⊤ | q₆ ----Cof(ø)---> ↓₂q₆
| q₇ ----F(c)---> ↓₁q₆ ∧ ̅↓̅₁̅q̅₅
| q₇ ----Cof(ø)---> ↓₁q₇ ∨ ↓₂q₇
-
- ##### Run #####
+
+##### Run #####