From 8ea5ba2ff786907b1859fb7f8dd0a0342a369cbf Mon Sep 17 00:00:00 2001 From: Lucca Hirschi Date: Tue, 3 Jul 2012 16:42:35 +0200 Subject: [PATCH] Minors (srry for the noise) --- src/asta.ml | 4 ++-- src/test.ml | 4 ++-- tests/results/my.result | 7 ++++--- 3 files changed, 8 insertions(+), 7 deletions(-) diff --git a/src/asta.ml b/src/asta.ml index 56bb8da..9059d8d 100644 --- a/src/asta.ml +++ b/src/asta.ml @@ -133,8 +133,8 @@ let print fmt asta = Format.fprintf fmt " @[%a @]" print_list_tr trans in Format.fprintf fmt "@[# Queries transitions:@ %a@ @]" print_box_list asta.trans_q; - Format.fprintf fmt "@[# Recognizing transitions:@ %a@ @]" + Format.fprintf fmt "@[# Recognizing transitions:@ %a@]" print_box_list asta.trans_r in - Format.fprintf fmt "@[ ##### ASTA #####@, %a@ @]" print_box 0 + Format.fprintf fmt "@[##### ASTA #####@, %a@ @]@." print_box 0 let to_file out asta = () diff --git a/src/test.ml b/src/test.ml index 16c96e5..f20e471 100644 --- a/src/test.ml +++ b/src/test.ml @@ -56,12 +56,12 @@ let () = let doc = doc () in let asta = build_asta query in let run = compute_run doc asta in - fprintf err_formatter "@[##### Query #####@. %a@]@ " + fprintf err_formatter "@[##### 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 "@[ ##### Run #####@. %a@]@ " + fprintf err_formatter "@[##### Run #####@. %a@]\n" Run.print run; exit 0 diff --git a/tests/results/my.result b/tests/results/my.result index 57e54c1..63faaef 100644 --- a/tests/results/my.result +++ b/tests/results/my.result @@ -1,6 +1,7 @@ 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> @@ -13,7 +14,7 @@ Parse query OK ! Parse Tree OK ! Compil OK ! Run OK ! - ##### ASTA ##### +##### ASTA ##### # Query states: { q₁ q₂ q₈ q₉ } # Recognizing states: { q₀ q₃ q₄ q₅ q₆ q₇ } # Selecting states: { q₁ } @@ -36,5 +37,5 @@ Parse query OK ! Parse Tree OK ! Compil OK ! Run OK ! | q₆ ----F(e)---> ⊤ | q₆ ----Cof(ø)---> ↓₂q₆ | q₇ ----F(c)---> ↓₁q₆ ∧ ̅↓̅₁̅q̅₅ | q₇ ----Cof(ø)---> ↓₁q₇ ∨ ↓₂q₇ - - ##### Run ##### + +##### Run ##### -- 2.17.1