popl/pretty_print_popl.ml

   1 (*
   2  * Copyright 2012, INRIA
   3  * Julia Lawall, Gilles Muller
   4  * Copyright 2010-2011, INRIA, University of Copenhagen
   5  * Julia Lawall, Rene Rydhof Hansen, Gilles Muller, Nicolas Palix
   6  * Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen
   7  * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
   8  * This file is part of Coccinelle.
   9  *
  10  * Coccinelle is free software: you can redistribute it and/or modify
  11  * it under the terms of the GNU General Public License as published by
  12  * the Free Software Foundation, according to version 2 of the License.
  13  *
  14  * Coccinelle is distributed in the hope that it will be useful,
  15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  * GNU General Public License for more details.
  18  *
  19  * You should have received a copy of the GNU General Public License
  20  * along with Coccinelle.  If not, see <http://www.gnu.org/licenses/>.
  21  *
  22  * The authors reserve the right to distribute this or future versions of
  23  * Coccinelle under other licenses.
  24  *)
  25
  26
  27 # 0 "./pretty_print_popl.ml"
  28 open Format
  29 module Past = Ast_popl
  30
  31 let start_block str =
  32   force_newline(); print_string "  "; open_box 0
  33
  34 let end_block str =
  35   close_box(); force_newline ()
  36
  37 (* --------------------------------------------------------------------- *)
  38
  39 let rec print_sequence = function
  40     Past.Seq(e,seq) -> print_element e; force_newline(); print_sequence seq
  41   | Past.Empty -> ()
  42   | Past.SExists((_,v),seq) -> print_string "exists "; print_string v;
  43       print_string " ."; force_newline(); print_sequence seq
  44
  45 and print_element = function
  46     Past.Term(term) -> Pretty_print_cocci.rule_elem "" term
  47   | Past.Or(seq1,seq2) ->
  48       force_newline(); print_string "("; force_newline(); print_sequence seq1;
  49       print_string "|"; force_newline(); print_sequence seq2; print_string ")"
  50   | Past.DInfo(dots,bef,aft) ->
  51       start_block();
  52       List.iter
  53         (function b -> print_string ">>>"; print_element b; force_newline())
  54         bef;
  55       print_dots dots;
  56       List.iter
  57         (function b -> force_newline(); print_string "<<<"; print_element b)
  58         aft;
  59       end_block()
  60   | Past.EExists((_,v),elem) -> print_string "exists "; print_string v;
  61       print_string " ."; force_newline(); print_element elem
  62
  63 and print_dots = function
  64     Past.Dots -> print_string "..."
  65   | Past.Nest(seq)-> print_string "<..."; start_block(); print_sequence seq;
  66       end_block(); print_string "...>"
  67   | Past.When(dots,seq) -> print_dots dots; print_string " when != ";
  68       open_box 0; print_sequence seq; close_box()
  69   | Past.DExists((_,v),dots) -> print_string "exists "; print_string v;
  70       print_string " ."; force_newline(); print_dots dots
  71
  72 (* --------------------------------------------------------------------- *)
  73
  74 let pretty_print_e e =
  75   print_element e;
  76   print_newline()
  77
  78 let pretty_print sl =
  79   print_sequence sl;
  80   print_newline()
  81