adamc@96: (* Copyright (c) 2008, Adam Chlipala
adamc@96:  * All rights reserved.
adamc@96:  *
adamc@96:  * Redistribution and use in source and binary forms, with or without
adamc@96:  * modification, are permitted provided that the following conditions are met:
adamc@96:  *
adamc@96:  * - Redistributions of source code must retain the above copyright notice,
adamc@96:  *   this list of conditions and the following disclaimer.
adamc@96:  * - Redistributions in binary form must reproduce the above copyright notice,
adamc@96:  *   this list of conditions and the following disclaimer in the documentation
adamc@96:  *   and/or other materials provided with the distribution.
adamc@96:  * - The names of contributors may not be used to endorse or promote products
adamc@96:  *   derived from this software without specific prior written permission.
adamc@96:  *
adamc@96:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
adamc@96:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
adamc@96:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
adamc@96:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
adamc@96:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
adamc@96:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
adamc@96:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
adamc@96:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
adamc@96:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
adamc@96:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
adamc@96:  * POSSIBILITY OF SUCH DAMAGE.
adamc@96:  *)
adamc@96: 
adamc@96: structure MonoOpt :> MONO_OPT = struct
adamc@96: 
adamc@96: open Mono
adamc@96: structure U = MonoUtil
adamc@96: 
adamc@96: fun typ t = t
adamc@96: fun decl d = d
adamc@96: 
adamc@96: fun exp e =
adamc@96:     case e of
adamc@96:         EPrim (Prim.String s) =>
adamc@96:         let
adamc@96:             val (_, chs) =
adamc@96:                 CharVector.foldl (fn (ch, (lastSpace, chs)) =>
adamc@96:                                      let
adamc@96:                                          val isSpace = Char.isSpace ch
adamc@96:                                      in
adamc@96:                                          if isSpace andalso lastSpace then
adamc@96:                                              (true, chs)
adamc@96:                                          else
adamc@96:                                              (isSpace, ch :: chs)
adamc@96:                                      end)
adamc@96:                                  (false, []) s
adamc@96:         in
adamc@96:             EPrim (Prim.String (String.implode (rev chs)))
adamc@96:         end
adamc@96:                                        
adamc@96:         
adamc@96:       | EStrcat ((EPrim (Prim.String s1), loc), (EPrim (Prim.String s2), _)) =>
adamc@96:         let
adamc@96:             val s =
adamc@96:                 if size s1 > 0 andalso size s2 > 0
adamc@96:                    andalso Char.isSpace (String.sub (s1, size s1 - 1))
adamc@96:                    andalso Char.isSpace (String.sub (s2, 0)) then
adamc@96:                     s1 ^ String.extract (s2, 1, NONE)
adamc@96:                 else
adamc@96:                     s1 ^ s2
adamc@96:         in
adamc@96:             EPrim (Prim.String s)
adamc@96:         end
adamc@96:       | _ => e
adamc@96: 
adamc@96: val optimize = U.File.map {typ = typ, exp = exp, decl = decl}
adamc@96: 
adamc@96: end